Pagini recente » Cod sursa (job #494684) | Cod sursa (job #183503) | Cod sursa (job #1524338) | Cod sursa (job #3125339) | Cod sursa (job #1393104)
#include<cstring>
#include<fstream>
using namespace std;
ifstream f("mesaj3.in");
ofstream g("mesaj3.out");
int vf[28],p,n,x,i,min1;
char c1[40],c2[2050],a[28][2010];
int main()
{
f>>p;
f.get();
f.get(c1,p+1,'\n');
f.get();
f>>n;
f.get();
f.get(c2,n+1,'\n');
for(i=0;i<n;++i)
vf[c2[i]-64]++;
int min1=2015;
for(i=1;i<=26;++i)
if(vf[i]>0 && vf[i]<min1){
min1=vf[i];
x=i;
}
char k=(x+64);
g<<k<<'\n';
for(i=0;i<p;++i)
a[1][i+1]=c1[i];
x=0;
int k1=0;
while(x<n)
{
min1=10042;
for(i=1;i<=p;++i)
if((c1[i]-64)<min1)
{
min1=(c1[i]-64);
k1=i;
}
g<<k1<<" ";
a[1][k1]=(a[1][k1]+32);
if(k1>n%p)
for(i=2;i<=n/p+1;++i)
{
a[i][k1]=c2[x];
++x;
}
else
{
for(i=2;i<=n/p+2;++i)
{
a[i][k1]=c2[x];
++x;
}
}
}
for(i=2;i<=p;++i)
for(int j=1;j<=p;++j)
g<<c2[i];
g.close();
return 0;
}