Cod sursa(job #1344161)
Utilizator | Data | 16 februarie 2015 14:51:20 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
int v[100];
int main() {
FILE *fin, *fout;
int n, i, cul;
fin = fopen( "algsort.in", "r" );
fscanf( fin, "%d", &n );
for ( i = 0; i < n; i++ ) {
fscanf( fin, "%d", &cul );
v[cul]++;
}
fclose( fin );
fout = fopen( "algsort.out", "w" );
for ( cul = 1; cul < 100; cul++ )
while ( v[cul] > 0 ) {
fprintf( fout, "%d ", cul );
v[cul]--;
}
fclose( fout );
return 0;
}