fork download
copy 
  1. #include <stdio.h>
  2.  
  3. int main(void) {
  4.     int a[5][5];        
  5.  
  6.     int num;
  7.     int max = 99;       
  8.     int total = 10;     
  9.  
  10.  
  11.     int seed = 12345; 
  12.  
  13.  
  14.     for (int i = 0; i < 5; i++) {
  15.         for (int j = 0; j < 5; j++) {
  16.             seed = (seed * 1103515245 + 12345) & 0x7fffffff;
  17.             a[i][j] = (seed % max) + 1; 
  18.         }
  19.     }
  20.  
  21.     for (int k = 0; k < total; k++) {
  22.         seed = (seed * 1103515245 + 12345) & 0x7fffffff;
  23.         num = (seed % max) + 1; 
  24.  
  25.         printf("%2d/%2d回目の数: ", k + 1, total);
  26.         printf("%d\n", num);
  27.  
  28.  
  29.         for (int i = 0; i < 5; i++) {
  30.             for (int j = 0; j < 5; j++) {
  31.                 if (a[i][j] == num) {
  32.                     a[i][j] = 0; 
  33.                 }
  34.             }
  35.         }
  36.     }
  37.  
  38.  
  39.     printf("\n-ビンゴカード-\n");
  40.     for (int i = 0; i < 5; i++) {
  41.         for (int j = 0; j < 5; j++) {
  42.             if (a[i][j] == 0) {
  43.                 printf("** ");
  44.             }
  45.             else {
  46.                 printf("%2d ", a[i][j]);
  47.             }
  48.         }
  49.         printf("\n");
  50.     }
  51.  
  52.  
  53.     getchar();
  54.  
  55.     return 0;
  56. }
  57.  
Success #stdin #stdout 0s 5304KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
 1/10回目の数: 65
 2/10回目の数: 31
 3/10回目の数: 58
 4/10回目の数: 19
 5/10回目の数: 53
 6/10回目の数: 75
 7/10回目の数: 89
 8/10回目の数: 97
 9/10回目の数: 87
10/10回目の数: 80

-ビンゴカード-
49 35  7 69 86 
81 73 63 69 38 
** ** 44 ** 28 
45 35 **  7 83 
28 42 52  8 70
https://ideone.com/a1V9nq
language:
C (gcc 8.3)
created:
4 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!