Cod sursa(job #1742289)
Utilizator | Data | 16 august 2016 10:26:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool v[2000000];
int main()
{ int n,cate,i,j;
f>>n;
cate=0;
for(i=2;i<=n;i++){
if(v[i]==0){
cate++;
for(j=2*i;j<=n;j+=i)
v[j]=1;
}
}
g<<cate;
return 0;
}