Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int sort(int ar[],int n)
- {
- int i,j,temp;
- for(i=0;i<n;i++)
- {
- for(j=0;j<n-1-i;j++)
- {
- if(ar[j]>ar[j+1])
- {
- temp=ar[j];
- ar[j]=ar[j+1];
- ar[j+1]=temp;
- }
- }
- }
- }
- int main()
- {
- int n,ar[10000],i,j,countc[10000],count=1,k,t=1;
- while(scanf("%d",&n)!=EOF)
- {
- for(i=0;i<n;i++)
- {
- scanf("%d",&ar[i]);
- }
- sort(ar,n);
- for(i=0;i<n;i++)
- {
- for(j=0;j<n;j++)
- {
- if(ar[j]==ar[i]){
- countc[i]=count++;
- }
- } count=1;
- }
- printf("Case %d:\n",t);
- for(k=0;k<n;k++)
- { if(ar[k]==ar[k+1]);
- else printf("%d %d\n",ar[k],countc[k]);
- }
- t++;count=1;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement