Cod sursa(job #2262924)
| Utilizator | Data | 17 octombrie 2018 22:19:30 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#define MAX 2000000
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
long i,j,s=0,N;
bool v[MAX];
int main()
{f>>N;
for(i=2;i<=N;i++)
if(v[i]==0)
{s++;
for(j=2;j*i<=N;j++)
v[i*j]=1;
}
g<<s;
return 0;
}
