Cod sursa(job #2280129)
Utilizator | Data | 10 noiembrie 2018 11:38:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
#define N 2000001
int x[N];
int main()
{
int n,i,j,s;
f>>n;
s=0;
for(i=2;i<=n;i++)
{
if(x[i]==0)
{
s++;
for(j=i*2;j<=n;j+=i)
{
x[j]=1;
}
}
}
g<<s;
return 0;
}