Cod sursa(job #1348169)
| Utilizator | Data | 19 februarie 2015 15:49:56 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char A[2000001];
int main()
{
int N,i,nr=-1,j;
fin>>N;
for(i=2; i<=N; i++)
A[i]=0;
for(i=2; i<=N; i++)
if(A[i]==0)
{
for(j=2; j*i<=N; j++)
A[j*i]=1;
}
for(i=1;i<=N;i++)
{
if(A[i]==0)
nr++;
}
fout<<nr;
//cout << "Hello world!" << endl;
return 0;
}
