Cod sursa(job #1812501)
Utilizator | Data | 22 noiembrie 2016 10:12:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int Prim(int n)
{
int i;
if(n<2)return 0;
if(n==2)return 1;
if(n%2==0)return 0;
for(i=3;i*i<=n;i=i+2)
if(n%i==0)return 0;
return 1;
}
int main()
{
int N,i,m;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>N;
m=0;
for(i=1;i<=N;i++)
fout<<Prim(N)+1<<"\n";
fout.close();
return 0;
}