아름다운
Ok
R u learning c language?
AH෴AD
this my brother
AH෴AD
c not c#
Dan
Js is not java though
Anonymous
i did but a littile bit confuse so if u know tell me the differences
They differ a lot
Like everything is different
For more, learn how to Google
Mat
Write a proper message
아름다운
ok
아름다운
They differ a lot
Like everything is different
For more, learn how to Google
send me a book of both
아름다운
iam interested to learn both
Mat
Learning a language requires a lot of time
Stay Forward
21 day? :D
Dima
Dima
Lol! Four years and 21 day
Stay Forward
Just joke, reference to book "learnin' c++ in 21 day"
AH෴AD
Stay Forward
Hi
Wim
I learned it from interpreting it
Anonymous
But I cannot get the desired output..
are you going through the dragon book by any chance?
professor
hey guya ,, does anyone knows integer overflow?
C.
Wdym by int overflow? When it becomes a negative value?
professor
hey guys , this code is integer overflow issue , but how can I do a proof concept to show it? I Know it is 512 , and then if it's a multiple of 8 which translate to A*8*6*65 then it should crash
signed __int64 result; // rax
int msg; // [rsp+278h] [rbp-20h]
*(_QWORD *)v4 = -1i64;
v9 = 62;
memset(&Dst, 0, 0x200ui64);
if ( msg <= 512 )
size_data = recv(s, &Dst, (unsigned __int16)msg, 0);
if ( (signed int)size_data % 8 )
infi ptr
long long int arr[ ][ ]; is accepting values till size of [1000][1000], any idea how to get into 10^6
Anonymous
Anonymous
I am not comfortable with vectors and stl yet, any idea without using them
There's no other good way
infi ptr
Ok, thanx for your input
olli
long long int arr[ ][ ]; is accepting values till size of [1000][1000], any idea how to get into 10^6
you want to create a 2D array where each dimension ins 10^6? That' takes up quite some space...
Anonymous
you want to create a 2D array where each dimension ins 10^6? That' takes up quite some space...
Well, why didn't I thought about it
infi ptr
8 gb, but i am compiling it online
infi ptr
olli
Why did you multiply ?
a 2D array with dimension n and m has n * m elements, hence the multiplication
Anonymous
long long int arr[ ][ ]; is accepting values till size of [1000][1000], any idea how to get into 10^6
You need 7,450 GB of RAM to do this
Anonymous
a 2D array with dimension n and m has n * m elements, hence the multiplication
No, why did you multiply it by 8?
infi ptr
Ohkay got ot thanks
Talula
long long int arr[ ][ ]; is accepting values till size of [1000][1000], any idea how to get into 10^6
Why do you wanna do that?
Talula
Because the question is constrained into that much
There are ways to sample small chuncks rather than trying to make whole array and then sample things… make array of [100][100], sample that and then move to next [100][100] this way you’ll maintain the size small and the job done.
Anonymous
Because the question is constrained into that much
And this means that you need to come up with a more efficient solution without storing the matrix fully in memory
Anonymous
I've this:
int mod = 1e9 + 7;
int ans = 0;
int dp[1009][1009];
int k = 500
.
.//some code
.
for(int i=1;i<=n;++i){
//cout<<v[i]<<" ";
dp[i][0] = 1;
for (int j = 1; j <= min(i, k); ++j)
{
dp[i][j] = (dp[i - 1][j] % mod + (v[i] % mod * dp[i - 1][j - 1] % mod) % mod) % mod;
}
}
Is it possible that my dp[i][j] can exceed the int range in some iteration?
Anonymous
Anonymous
Maybe
Anonymous
That multiplication : (v[i] % mod * dp[i - 1][j - 1]%mod)%mod
Anonymous
It's hard to read => hard to estimate possible range of expression
olli
I've this:
int mod = 1e9 + 7;
int ans = 0;
int dp[1009][1009];
int k = 500
.
.//some code
.
for(int i=1;i<=n;++i){
//cout<<v[i]<<" ";
dp[i][0] = 1;
for (int j = 1; j <= min(i, k); ++j)
{
dp[i][j] = (dp[i - 1][j] % mod + (v[i] % mod * dp[i - 1][j - 1] % mod) % mod) % mod;
}
}
Is it possible that my dp[i][j] can exceed the int range in some iteration?
int is most likely not 64 bits, so this can overflow
Anonymous
int is most likely not 64 bits, so this can overflow
You are saying it by looking at that multiplication operation?
Anonymous
I mean that any integral type can overflow. Talking general.
olli
I mean that any integral type can overflow. Talking general.
but you can make sure it does not, e.g.
uint32_t mul16(uint32_t a, uint32_t b)
{
return (a & 0xFFFFU) * (b & 0xFFFFU);
}
数学の恋人
Hey guys
数学の恋人
xdrawchem/application_ob.cpp:144:5: error: 'qInfo' was not declared in this scope
数学の恋人
xdrawchem/application_ob.cpp:144:5: error: 'qInfo' was not declared in this scope
can someone tell me why is that happening?