Cod sursa(job #1393413)
Utilizator | Data | 19 martie 2015 13:32:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,c,i,j;
char prim[2000005];
int main()
{
fin>>N;
for(i=2;i<=N;i++)
prim[i]=1;
for(i=2;i<=N;i++)
{
if(prim[i]==1)
{
c++;
for(j=i+i;j<=N;j+=i)
prim[j]=0;
}
}
fout<<c;
return 0;
}