phantom story phantom story

My Solution 123456789101112131415161718192021222324252627282930313233343536373839#includeint cmp(int mon,int day){ switch(mon){ case 1: case 3: case 5: case 7: case 8: case 10: case 12: if(day0){ return 1; } else{ return 0; } case 2: if(day0){ return 1; } else{ return 0; } default: if(day0){ return 1; } else{ return 0; } } }int main(void){ int mon,day; scanf("%d %d",&mon,&day); cmp(mon,day); if(..

My Solution 123456789101112131415161718192021222324252627#includevoid result(int arr[],int num){ int i,j,temp; for(i=0;i

My Solution 123456789101112131415161718192021222324#includeint score(int a, int b, int c){ return a+b+c;}int main(void){ int check[4][4]; int i,j; for(i=0;i

My Solution 1234567891011121314151617#includeint result(int num1,int num2){ int res; if(num1>num2){ res=num1*num1-num2*num2; } else if(num1

My Solution 12345678910111213141516#includevoid square(int num){ int i,j,count=1; for(i=0;i

My Solution 1234567891011121314151617#includevoid plus(int num){ int i,sum=0; for(i=1;i1000){ return 0; } plus(num); return 0;}cs

My Solution 1234567891011121314#includevoid str(int c){ printf("@@@@@@@@@@\n");}int main(void){ int c; printf("first\n"); str(c); printf("second\n"); str(c); printf("third\n"); str(c); return 0;}cs

My Solution 12345678910111213141516171819202122232425262728#includevoid gugudan(int a, int b){ int i,j; if(a