Cod sursa(job #2266604)
Utilizator | Data | 22 octombrie 2018 19:56:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int prim[200005],cnt=0,i,j;
fstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
for(i=2;i<n;i++)
prim[i]=1;
for(i=2;i<n;i++)
if(prim[i]){
cnt++;
for(j=i+i;j<n;j=j+i)
prim[j]=0;
}
g<<cnt;
}