05 ¶
Profile ¶
¶
¶
¶
ㅋ 금 ;;; ㅋ; 고 -_-;;
RUR ¶
¶
~cpp [..............]
구구 ¶
~cpp #include <stdio.h> #include <stdlib.h> int main() { int i, j; for ( i = 1 ; i < 10 ; i++ ){ for ( j = 2 ; j < 10 ; j++ )printf("%d*%d=%2d ", j, i, i*j ); printf("n"); } system("PAUSE"); return 0; }
? ¶
~cpp /************************************************************************ * * * 권 까 그. * * 꺼 ... -_- [............] * * ㅡㅜ * * * ************************************************************************/ #include <stdio.h> #include <stdlib.h> void randem_x(int count); void randem_y(int count, int save); void winning_number(); void make_number(int k); const int max_position = 6; int randemsoo[2][6]; long g = 1; int main() { int count, save; srand((unsigned)time(NULL)); count = 1; printf(" : "); scanf("%d", &count); printf("n"); randem_x(count); save = 1; winning_number(); randem_y(count, save); return 0; } void make_number(int k){ int i, j, h; /* 고,*/ for ( i = 0 ; i < max_position ; i++ ) randemsoo[k][i] = rand()%(45); /* */ while ( i <= max_position ){ for ( i = 0 ; i <= max_position ; i++ ) for ( j = i+1 ; j < max_position ; j++ ){ if( randemsoo[k][i] == randemsoo[k][j] ) { randemsoo[k][j] = rand()%(45); break; } } } /* */ for ( i = 0 ; i < max_position ; i++ ) for (j = i+1 ; j < max_position ; j++){ if ( randemsoo[k][i] > randemsoo[k][j] ){ h = randemsoo[k][i]; randemsoo[k][i] = randemsoo[k][j]; randemsoo[k][j] = h; } } } void randem_x(int count){ int k; k = 0; make_number(k); } void randem_y(int count, int save){ int i, k; k = 1; while ( save <= count ){ make_number(k); printf("game %d : ",g); for ( i = 0 ; i < max_position ; i++ ) printf("%2d ", randemsoo[k][i]+1); printf("n"); for ( i = 0 ; i < max_position ; i++ ){ if (randemsoo[0][i] || randemsoo[1][i]) break; if ( i == max_position - 1 ) ++save; } ++g; } printf ("권 %d개 .n", g-1 ); winning_number(); } void winning_number(){ int i; printf(" : "); for ( i = 0 ; i < max_position ; i++ ) printf("%2d ", randemsoo[0][i]+1); printf("n"); system("PAUSE"); }
![]() |
겨...... .......
~~ T^T ㅋ
계기 ¶
~cpp #include <stdio.h> #include <stdlib.h> int main() { int forward, backward, save; char operation; printf (" 그. 개 계 .n"); printf (" 11까 .n"); printf ("계 ex) 12+5n" ); printf ("-->"); scanf ("%d%c%d",&forward ,&operation ,&backward ); save = 0; switch(operation) { case '+': save = forward + backward; break; case '-': save = forward - backward; break; case '*': save = forward * backward; break; case '/': save = forward / backward; break; default : printf (" "); } printf (" : %dn",save); system("PAUSE"); return 0; }
¶
~cpp /**************************************************************** * * * 권 기 그. * * : 57 * * : * * : * * * ****************************************************************/ #include <stdio.h> #include <stdlib.h> int main() { int count, save, randem[6], i, j; srand((unsigned)time(NULL)); printf("n== LOTTO RANDOM NUMBER GENERATOR ==nnEnter the game count : "); scanf("%d", &count); printf("n========================nn"); for ( save = 1; save <= count; save++) { printf("GAME %d : ", save); for ( i = 0 ; i < 6 ; i++ ) randem[i] = rand()%(45); /* .*/ for ( i = 0 ; i < 6 ; i++ ) { for ( j = i+1 ; j < 6 ; j++ ) while(randem[i] == randem[j]) randem[i] = rand()%(45); printf("%2d ", ++randem[i]); } printf("n"); } printf("n========================n"); system("PAUSE"); return 0; }
¶
~cpp /************************************************************ * * * 과 균 기 그.* * : * * : 57 * * : * * * ************************************************************/ #include <stdio.h> #include <stdlib.h> int main() { int input_score, i, max, min, sum = 0, compare, *score; float agv, team; printf("과 n --> "); scanf("%d", &input_score) ; score=(int*)malloc(sizeof(int)*input_score); /* .*/ for( i = 0 ; i < input_score ; i++ ){ printf("Enter a number for score[%d] : ", i); scanf("%d", &score[i]); sum += score[i]; } printf("n[ The contents of score array ]n"); for( i = 0 ; i < input_score ; i++ ){ printf("%3d", score[i]); } /* 과 균, 고, 구 .*/ team = sum; agv = (team / input_score); max = score[0]; min = score[0]; for( i = 0 ; i < input_score ; i++ ){ if (max < score[i]) max = score[i]; if (min > score[i]) min = score[i]; } printf ("n sum=%d, agv=%.1fnn max=%d, min=%dn",sum ,agv, max, min); /* 기 .*/ for( i = 0 ; i < input_score ; i++ ){ int j, k; /*경 갈 깁.*/ k=1; for( j = 0 ; j < input_score ; j++ ) if (score[i] < score[j]) k++; printf("nscore[%d] : %d, rank = %dn", i, score[i], k); } system("PAUSE"); return 0; }
, ZeroPagers