phantom story phantom story

My Solution 123456789101112131415161718192021222324#includeint main(void){ int num[100]; int i=0; int min=10000,max=0; while(1){ scanf("%d",&num[i]); if(i>=100){ break; } if(num[i]==999){ break; } if(num[i]max){ max=num[i]; } i++; } printf("max : %d\nmin : %d",max,min); return 0;}Colored by Color Scriptercs

My Solution 1234567891011121314#includeint main(void){ char str[6] = {'J','U','N','G','O','L'} , find; int i; scanf(" %c",&find); for(i=0;i

My Solution 12345678910111213#includeint main(void){ float wei[6],sum=0; int i; for(i=0;i

My Solution 123456789101112131415161718192021222324#includeint main (void){ int num[100]; int i=0,count=0; while(1){ scanf("%d", &num[i]); if(num[i]==-1){ break; } i++; count++; } if(count

My Solution 12345678910111213141516#includeint main(void){ int num[10]; int i,odd=0,even=0; for(i=0;i

My Solution 1234567891011#includeint main(void){ int num[5]; int i,sum=0; for(i=0;i

My Solution 123456789101112#includeint main(void){ char str[10]; int i; for(i=0;i=0;i--){ printf("%c ",str[i]); } return 0;}cs

My Solution 1234567891011121314151617181920212223#includeint main(void){ int num[10]; int i,j,k,l,temp=0; for(i=0;i