Cod sursa(job #2353828)
Utilizator | Data | 24 februarie 2019 17:08:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
bool Prim[2000000];
int main() {
int i,j,N,s=1;
ifstream in("ciur.in");
in>>N;
ofstream out("ciur.out");
for(i=3;i<=N;i+=2)
if(!Prim[i])
{
s++;
for(j=i;j<=N;j=j+i)
Prim[j]=true;
}
out<<s;
return 0;
}