All the combinations of prime numbers whose sum gives 32
Answer / ram
#include<stdio.h>
main()
{
int n,i,j=2;
for(i=0;;i++|)
{
if(j%i==0)
}
}
| Is This Answer Correct ? | 2 Yes | 3 No |
main() { signed int bit=512, i=5; for(;i;i--) { printf("%d\n", bit >> (i - (i -1))); } } a. 512, 256, 0, 0, 0 b. 256, 256, 0, 0, 0 c. 512, 512, 512, 512, 512 d. 256, 256, 256, 256, 256
main() { int i=_l_abc(10); printf("%d\n",--i); } int _l_abc(int i) { return(i++); }
Program to find the largest sum of contiguous integers in the array. O(n)
why array index always strats wuth zero?
main() { char *p = “ayqm”; char c; c = ++*p++; printf(“%c”,c); }
Print an integer using only putchar. Try doing it without using extra storage.
main() { float me = 1.1; double you = 1.1; if(me==you) printf("I love U"); else printf("I hate U"); }
String reverse with time complexity of n/2 with out using temporary variable.
How to access command-line arguments?
main() { float i=1.5; switch(i) { case 1: printf("1"); case 2: printf("2"); default : printf("0"); } }
void main() { char a[]="12345\0"; int i=strlen(a); printf("here in 3 %d\n",++i); }
#ifdef something int some=0; #endif main() { int thing = 0; printf("%d %d\n", some ,thing); }