Cod sursa(job #52978)

Utilizator peanutzAndrei Homorodean peanutz Data 20 aprilie 2007 15:30:12
Problema Secventa 2 Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.62 kb
#include <stdio.h>
#include <memory.h>

#define NMAX 5010
#define VALMAX 200//0010

long s[NMAX], n;
short int count[NMAX];
long sir[NMAX];
int nr;
int min = NMAX+1;

void read()
{
long i;

scanf("%ld\n", &n);

for(i = 0; i < n; ++i)
	{
		scanf("%ld ", &s[i]);

		count[s[i]] = 1;
	}

for(i = 0; i < VALMAX; ++i)
	if(count[i])
		sir[nr++] = i;

}


void secv()
{
int i, j;

for(i = 0;






















int main()
{
freopen("secv.in", "r", stdin);
freopen("secv.out", "w", stdout);

read();


secv();





fclose(stdin);
fclose(stdout);

return 0;
}