fork download
copy 
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. #include<time.h>
  4.  
  5. int main()
  6. {
  7.   int MAX = 100;
  8.   int n[MAX];
  9.   srand((unsigned) time(NULL));
  10.   /*配列の作成*/
  11.   int i;
  12.   for(i = 0; i < MAX; i++) {
  13.     if(i%5==0)putchar('\n');
  14.     n[i] = rand() % 100;
  15.     printf("%3d:%3d  ",i,n[i]);
  16.   }
  17.   putchar('\n');
  18.  
  19.   /*最小値を取り出す*/
  20.   int index=MAX-1;
  21.   for(i = index; i>=0; i--) {
  22.     if(n[i] <= n[index])
  23.       index = i;
  24.   }
  25.   printf("最小値：%d 要素番号:%d\n", n[index], index);
  26.  
  27.   return 0;
  28. }
Success #stdin #stdout 0.01s 1720KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
  0: 31    1: 14    2: 16    3: 48    4:  7  
  5: 66    6: 51    7: 18    8: 97    9: 56  
 10: 95   11: 71   12: 53   13: 87   14: 44  
 15: 14   16: 76   17: 64   18: 97   19: 12  
 20: 48   21: 82   22: 30   23: 46   24: 86  
 25: 21   26: 46   27: 49   28: 85   29: 45  
 30: 18   31: 68   32: 11   33: 34   34: 16  
 35: 18   36:  1   37: 20   38: 37   39: 98  
 40: 28   41: 84   42: 21   43: 81   44: 23  
 45: 65   46: 47   47: 51   48: 82   49: 96  
 50: 63   51: 30   52: 78   53: 45   54: 76  
 55: 65   56: 18   57: 22   58: 66   59: 56  
 60: 19   61: 85   62: 24   63: 31   64: 71  
 65: 41   66:  1   67: 24   68: 13   69: 90  
 70: 74   71: 41   72: 74   73: 96   74: 74  
 75: 49   76: 13   77: 21   78:  0   79: 95  
 80: 17   81: 15   82: 25   83: 96   84: 12  
 85: 53   86: 13   87: 83   88: 27   89: 79  
 90: 39   91: 47   92: 64   93: 63   94: 30  
 95: 88   96:  4   97: 83   98: 12   99: 69  
最小値：0 要素番号:78
https://ideone.com/LIESf
language:
C (gcc 8.3)
created:
12 years ago
visibility:
secret

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!