Hesham Magdy

انا اول مر اشوف الطريقة دى مع العلم انها عجتنى :) اعتقد ان الطريقة الاشهر هى int isLittleEndian() { long int testInt = 0x12345678; char *pMem; pMem = (char *) testInt; if (pMem[0] == 0x78) return(1); else return(0); } مع اختلافات بعض الاختلافات طبعا

هو فى حد بيترفض اصلا ؟

متابع لاخر لحظة

first of all i love all ur topics in this forum if i understand you correctly u need to knew the number of digits in a number like 127 -> 3 digits if u ask about this i think it can be done using the mod or even the division if u ask about this tell me i can w…

I can accept every thing you say about the stupid IE(1-9) but please do not tell me that it is more secure than any thing in the world (i think notepad is more secure) most of highly spread botnets using IE security flow and if you a microsoft guy do you buy t…

then the worst case in here is ((root(x)/2) i think it is right but if there is any wrong with my replay plz till me xD

you can use the Trial division algorithm and i think it is the most popular algorithm used to test primality of an integer chk_primality(int num) { for x = 2 to root(num) { if num%x = 0 return FALSE } return True this not the code but u can understand what i m…

i think the program run with error of code cuz the stupid microsoft way to run when u hit run it recompile the code and the Execute it form the debug folder int the project path so when a compiler returns an error the VC will still run the program but it runs …

i think u miss the ; at the end of the 8th line and the Function in the question is not the same one at the code numerator : sin(a) + cos(a) and denominator : tan(a) so i think it will work but given an wrong answer sorry for writing eng. but my computer do no…

sorry my computer do not support Arabic I think if u use diff. src IP address it will not work . i think that will happen FakeIP - SYN - > Dst Dst - > SYN + ACK - >FakeIP FakeIP - > RST - > DST so the DST will close the connection and remove it from the TCP st…