Pagini recente » simugrafnr1 | Atasamentele paginii Divizori Primi | Borderou de evaluare (job #2417140) | Diferente pentru girls-programming-camp-2011/selectie intre reviziile 2 si 4 | Cod sursa (job #1010655)
#include <iostream>
#include <fstream>
using namespace std;
int n,x; long v[1000000000],m;
int main()
{
ifstream fi("algsort.in");
ofstream fo("algsort.out");
fi>>n;m=0;
for (int i=0; i<n; i++) {
fi>>x;
if (x>m)
m=x;
v[x]=v[x]+1;
}
for (int i=0; i<=m; i++)
if (v[i]!=0)
for (int j=1; j<=v[i]; j++)
fo<<i<<' ';
return 0;
}