Cod sursa(job #851811)
Utilizator | Data | 10 ianuarie 2013 15:05:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
int A[2000005];
using namespace std;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,k=1,i,j;
fin>>N;
for(i=3;i<=N;i+=2) {
if(!A[i]){k++;
for(j=i;j<=N;j+=i)prim[j]=1;}
}
fout<<k;
}