#include <stdio.h> void main() { int x = 97; int y = sizeof(x++); printf("x is %d", x); } The output is : 97(why?)

what do you want it to be?

what do you want it to be?

98

98

try replace ++ operator before x in y assingment

Is it wise in these days to learn how to write a make file

Yeah, I'd say so

98

because there types are primitive and are not references, you need to add & or change x directly

Yeah, I'd say so

Ok

Is it wise in these days to learn how to write a make file

Very helpful if you are working with Linux kernel and big projects

Ok but can't the ide do whatever you want

Eg. Let's say u are using visual studio on windows

It's still handy to do in case you need it

Like learning mental addition even though you have a calculator, cause you might not have the tools at some point

Ok but can't the ide do whatever you want

No

Why

because there types are primitive and are not references, you need to add & or change x directly

I also don't understand. It works with just 'x++', but not works in this example with assignment and sizeof. Why?

I thought ide like visual studio can do everything

Is it wise in these days to learn how to write a make file

It's not hard to learn, so why not.

Ok

Then I'll try

I also don't understand. It works with just 'x++', but not works in this example with assignment and sizeof. Why?

I figured out the point in 'sizeof' operator. For some reason ++ not works with it.

I figured out the point in 'sizeof' operator. For some reason ++ not works with it.

the operand inside the sizeof() operator is not evaluated. 

the operand inside the sizeof() operator is not evaluated. 

What the reason of that behaviour?

/get cbook

/get

What the reason of that behaviour?

This is what I was asking.??😐😐

This is what I was asking.??😐😐

Well now I'm asking too 😅

This is what I was asking.??😐😐

If it's a variable array only then the operand is evaluated here it's a variable so it's not evaluated,simply returns the size of int

Please don't warn me, I got an answer myself in the google.

Please don't warn me, I got an answer myself in the google.

Mee to... Bt I can't share as I have got 1 warning earlier.😂

Are there any tools to convert C code to Python because i need the python equivalent for the below C code: Can anyone provide me the python code conversion for the below mentioned code #include <stdio.h> int main() { int kases; scanf("%d", &kases); while(kases--) { int N; scanf("%d", &N); for(int i = 1; i <= N; ++i) { if(i % 3 == 0 && i % 5 == 0) printf("FizzBuzz\n"); else if(i % 3 == 0) printf("Fizz\n"); else if(i % 5 == 0) printf("Buzz\n"); else printf("%d\n",i); } } return 0; } Regards, Sriyam

Seems to be easy, why won’t you rewrite it?

can someone suggest me an alternative bot to joinhidder bot

/saved

#freeprogrammingbooks

#cppbook

#cbook

#howtoprogram

#howtoprogram

/report flood/spam

/warn spam

/report flood/spam

Doesn’t look like spam

just this system 😂

Mhm

Doesn’t look like spam

it's his 2nd time when he uses it :D

For python beginners which book is best

#freeprogrammingbooks

#findprojects

Python beginners books

Python beginners books

/warn python begginers warn

Why it’s so hard to read the rules

i wanted too

What is the C equivalent of this delaration... vector<int> num; ?

What is the C equivalent of this delaration... vector<int> num; ?

allocated dynamic array ?

What is the C equivalent of this delaration... vector<int> num; ?

There are no vectors in C like in C++. Look for variable length arrays, that's something related.

it was so hard to know today what C doesn't have boolean type O_o

or allocate on a heap

elements = (Element* )malloc(sizeof(Element) * count))

I have half a mind to switch to C++ now

turboc++

elements = (Element* )malloc(sizeof(Element) * count))

what if you don't know the count yet?

elements = (Element* )malloc(sizeof(Element) * count))

count = is this size of array ?

what if the Count depends on user input..

count = is this size of array ?

i think so, yes

look at how simple vector implementation works

look at how simple vector implementation works

it's ez for C++

it was so hard to know today what C doesn't have boolean type O_o

IIRC C89 doesn't contain Booleans.

you can alloc with 4 or 8, the next time more elements requested -> *2 existing count

IIRC C89 doesn't contain Booleans.

Only _Boolean, through an extra header.

so you can “grow” an array

and those newly added memory locations will be continous?

Can the heap overflow the the stack somehow?

I mean, the heap grows downwards and the stack grows upwards. Assuming the heap grows rapidly, it can overwrite the stack. Or am I missing something? "Downwards" and "upwards" are relative to memory address layout.

Can the heap overflow the the stack somehow?

Yes, can happen

Yes, can happen

So can a memory leak vulnerability thus lead to exploitability, hence one can carefully engineer the payload to overwrite the stack with code, which redirects the control flow?

how to flip a bit without using conditionals or ternary operators. negations. bit operators. if input is 1 output is 0 is this possible?

how to flip a bit without using conditionals or ternary operators. negations. bit operators. if input is 1 output is 0 is this possible?

Whithout bitwise operators is going to be difficult, if not imposible

it was so hard to know today what C doesn't have boolean type O_o

It is: typedef char bool; #define true 1 #define false 0

It is: typedef char bool; #define true 1 #define false 0

hm, thanks for that!

how to flip a bit without using conditionals or ternary operators. negations. bit operators. if input is 1 output is 0 is this possible?

arr = [ 1,0] bit = arr[bit%2] //only fir single bit

how to flip a bit without using conditionals or ternary operators. negations. bit operators. if input is 1 output is 0 is this possible?

a^1?

a^1?

That would fall under "bit operators" I think.

why is this program causing me a segmentation fault? https://pastebin.com/c6kZAAC1