46 lines
836 B
C++
46 lines
836 B
C++
|
#include<bits/stdc++.h>
|
|||
|
|
using namespace std;
|
|||
|
|
/*
|
|||
|
|
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>100<EFBFBD><EFBFBD>[0<EFBFBD><EFBFBD>99]<EFBFBD><EFBFBD>Χ<EFBFBD>ڵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
ͳ<EFBFBD>Ƹ<EFBFBD>λ<EFBFBD>ϵ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֱַ<EFBFBD>Ϊ0<EFBFBD><EFBFBD>1<EFBFBD><EFBFBD>2<EFBFBD><EFBFBD>3<EFBFBD><EFBFBD>4<EFBFBD><EFBFBD>5<EFBFBD><EFBFBD>6<EFBFBD><EFBFBD>7<EFBFBD><EFBFBD>8<EFBFBD><EFBFBD>9<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĸ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ӡ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
*/
|
|||
|
|
#define MAX 101
|
|||
|
|
|
|||
|
|
void input(int num[]) {
|
|||
|
|
int i;
|
|||
|
|
srand((unsigned)time(NULL));
|
|||
|
|
for(i=1; i<MAX; i++)
|
|||
|
|
num[i]=rand()%100;
|
|||
|
|
}
|
|||
|
|
void output(int num[]) {
|
|||
|
|
int i;
|
|||
|
|
for(i=1; i<MAX; i++) {
|
|||
|
|
printf("%5d", num[i]);
|
|||
|
|
if(0==i%10)
|
|||
|
|
printf("\n");
|
|||
|
|
}
|
|||
|
|
printf("\n");
|
|||
|
|
}
|
|||
|
|
void cal_num(int num[], int count[]) {
|
|||
|
|
int i, mod;
|
|||
|
|
for(i=1; i<MAX; i++) {
|
|||
|
|
mod=num[i]%10;
|
|||
|
|
count[mod]++;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
int main() {
|
|||
|
|
int num[MAX];
|
|||
|
|
int i, count[10];
|
|||
|
|
|
|||
|
|
memset(count, 0, 10*sizeof(int)); /* initial count[] to 0 */
|
|||
|
|
input(num);
|
|||
|
|
printf("100 num:\n");
|
|||
|
|
output(num);
|
|||
|
|
|
|||
|
|
cal_num(num, count);
|
|||
|
|
for(i=0; i<10; i++)
|
|||
|
|
printf("%d: %d\n", i, count[i]);
|
|||
|
|
return 0;
|
|||
|
|
}
|
|||
|
|
|