Cod sursa(job #2237236)
Utilizator | Data | 1 septembrie 2018 11:05:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int N = 2000010;
int n,i,j,cnt;
char p[N];
int main() {
f >> n;
if(n>=2)cnt++;
for(i=3; i<=n; i+=2) {
if(!p[i]) {
cnt++;
for(j=i; j<=n; j+=i)
p[j]=1;
}
}
g<<cnt;
}