Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<math.h>
- int main()
- {
- int n,k=0,a[100],b[100],i,j;
- scanf("%d",&n);
- while(n>0)
- {
- a[k]=n%10;
- n=n/10;
- k++;
- }
- for( i=0;i<k;i++)
- {
- for(j=i+1;j<k;j++)
- if(a[i]>a[j])
- {
- int tam;
- tam=a[i];
- a[i]=a[j];
- a[j]=tam;
- }
- }
- for( i=0;i<k;i++)
- {
- b[i]=1;
- }
- for( i = 0; i< k; i++ ){
- int count = 1;
- if( b[i] && a[i]!=0){
- b[i] = 0; // da xet a[i]
- for( j = 1+i; j < k; j ++ ){
- if( a[j] == a[i] ) {
- count++;
- b[j] = 0;
- }
- }
- printf("%d %d\n", a[i], count);
- }
- }
- for( i = 0; i< k; i++ ){
- int count = 1;
- if( b[i] && a[i]==0){
- b[i] = 0; // da xet a[i]
- for( j = 1+i; j < k; j ++ ){
- if( a[j] == a[i] ) {
- count++;
- b[j] = 0;
- }
- }
- printf("%d %d\n", a[i], count);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement