Cod sursa(job #1298486)
| Utilizator | Data | 22 decembrie 2014 21:05:01 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
# include <stdio.h>
#include<bitset>
using namespace std;
bitset<500000> a;
int main()
{
freopen ("numere5.in", "r", stdin);
freopen ("numere5.out", "w", stdout);
int ok,i,n,aux,auxi;
scanf("%ld", &n);
aux=n*n;
if(aux>500000)
aux=500000;
for(i=1;i<=aux;i++)
{
scanf("%ld", &auxi);
if(auxi)
a[auxi]=1;
}
ok=0;
for(i=1;ok==0;i++)
if(a[i]==0)
{
printf("%ld ", i);
ok=1;
}
for(i=aux;ok==1;i--)
if(a[i]==0)
{
printf("%ld ", i);
ok=0;
}
return 0;
}
