Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int cif[10],a[100],nr=-1;
- struct C
- {
- int cifra,f;
- };
- C c[10];
- void cifre(int x)
- {
- int cx=x,cif[10];
- for(int i=0;i<=9;++i)
- cif[i]=0;
- while(x)
- c[x%10].cifra=x%10,++c[x%10].f,++cif[x%10],x/=10;
- int nc=0;
- for(int i=0;i<=9;++i)
- if(cif[i])
- ++nc;
- if(nc==2)
- a[++nr]=cx;
- }
- int main()
- {
- int n;
- cin>>n;
- int x;
- while(n--)
- {
- cin>>x;
- cifre(x);
- }
- for(int i=0;i<9;++i)
- {
- for(int j=i+1;j<=9;++j)
- if(c[j].f>=c[i].f)
- {
- if(c[j].f==c[i].f)
- {
- if(c[j].cifra>c[i].cifra)
- swap(c[i],c[j]);
- }
- else
- swap(c[i],c[j]);
- }
- }
- cout<<c[9].cifra<<'\n';
- for(int i=0;i<=9;++i)
- cout<<c[i].cifra<<' ';
- cout<<'\n';
- if(nr==-1)
- cout<<-1;
- else
- {
- sort(a,a+nr+1);
- for(int i=0;i<=nr;++i)
- cout<<a[i]<<' ';
- }
- cout<<'\n';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement