Pagini recente » Cod sursa (job #2171624) | Cod sursa (job #71262) | Cod sursa (job #2716548) | Cod sursa (job #1384587) | Cod sursa (job #946367)
Cod sursa(job #946367)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("pluton.in");
ofstream g("pluton.out");
int n,i,j,u1[10],u2[10],x,v[4001],va[4001],k,ok,nr,nrm,vm[4001],c,h,cm;
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>v[i];
for(i=1;i<=n;i++)if(v[i]){x=v[i];nr=1;va[nr]=v[i];while(x){u1[x%10]++;
x/=10; }
for(j=i+1;j<=n;j++)if(v[j]){cm=0;ok=1; x=v[j];
while(x){u2[x%10]++;if(x%10>cm)cm=x%10;
x/=10; }
for(k=0;k<=cm;k++)
if(u1[k]!=u2[k]){ok=0;break;}
if(ok){nr++;va[nr]=v[j];v[j]=0;}
for(k=0;k<=cm;k++)u2[k]=0; }
if(nr>nrm)
for(k=1;k<=nr;k++){vm[k]=va[k];nrm=nr;h=1;}
else if(nr==nrm)h++;
for(k=1;k<=nr;k++)va[k]=0;
for(k=0;k<=9;k++)u1[k]=0;
if(nr)c++; }
g<<c<<'\n'<<nrm<<'\n'<<h<<'\n';
for(i=1;i<=nrm;i++)g<<vm[i]<<' ';
return 0;
}