phantom story phantom story

My Solution 123456789101112131415161718#include int cmp(int a, int b){ int max = a>b?a:b; return max;}void cmp_f(int a,int b,int c){ int max; cmp(a,b); cmp(max,c); printf("%d ", max);}int main(void){ int num1, num2, num3; scanf("%d %d %d", &num1, &num2, &num3); cmp(num1,num2); cmp_f(num1,num2,num3); return 0;}Colored by Color Scriptercs

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

My Solution 123456789101112#includevoid area(int radius){ float r_area; r_area =radius*radius*3.14; printf("%.2f",r_area);}int main(void){ int radius; scanf("%d",&radius); area(radius); return 0;}cs

My Solution 123456789101112#includevoid printstr(void){ printf("~!@#$^&*()_+|\n");}int main(void){ int num,i; scanf("%d",&num); for(i=1;i

My Solution 123456789101112131415161718#includeint main(void){ char arr[3][5]={0,}; int i,j; for(i=0;i

솔루션을 잠시 기달려 주세요 ^^;

My Solution 12345678910111213141516171819202122232425262728293031323334#includeint main(void){ int arr[4][2]={0,}; int i,j,sum; for(i=0;i

My Solution 123456789101112131415161718192021222324252627#includeint main(void){ int f_arr[2][3]={0,}; int s_arr[2][3]={0,}; int mul_arr[2][3]={0,}; int i,j; printf("first array\n"); for(i=0;i