Problem Name : Number Frequence
Problem No : 1171
Solution :
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /// Author : Shohanur Rahaman | |
| /// URI OJ | |
| /// Problem name : Number Frequence | |
| /// Problem No : 1171 | |
| /// Problem Type : Sorting (use counting sort) | |
| /// Lavel : Easy | |
| #include<stdio.h> | |
| #include<string.h> | |
| #define N 2001 | |
| int main() | |
| { | |
| int test,n,i,j; | |
| int array[N]; | |
| while(scanf("%d",&test)==1){ | |
| memset(array,0,sizeof array); | |
| for(i=1;i<=test;i++){ | |
| scanf("%d",&n); | |
| array[n]++; | |
| } | |
| for(i=0;i<N;i++) | |
| for(j=0;j<array[i];j++){ | |
| if(array[i]>0) | |
| printf("%d aparece %d vez(es)\n",i,array[i]); | |
| break; | |
| } | |
| } | |
| return 0; | |
| } |
