Pagini recente » Cod sursa (job #2491400) | Cod sursa (job #2314304) | Cod sursa (job #981477) | Cod sursa (job #3174661) | Cod sursa (job #3228447)
#include<bits/stdc++.h>
using namespace std;
ifstream F("algsort.in");
ofstream G("algsort.out");
#define Z 2048
int n,i,a[500000],p=Z,q;
char s[Z],t[Z];
inline char A()
{
if(p==Z)
F.read(s,Z),p=0;
return s[p++];
}
int B()
{
int n=0;
char c;
for(c=A();isdigit(c);n=n*10+c-48,c=A());
return n;
}
inline void C()
{
if(q==Z)
G.write(t,Z),q=0;
}
void D(int n)
{
int k=0,b[10];
for(a[k++]=n%10,n/=10;n;a[k++]=n%10,n/=10);
for(;k;t[q++]=a[--k]+48,C());
t[q++]=' ',C();
}
int main()
{
for(n=B();i<n;a[i++]=B());
for(sort(a,a+n),i=0;i<n;D(a[i++]));
return G.write(t,q),0;
}