Cod sursa(job #1967638)
Utilizator | Data | 16 aprilie 2017 21:20:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int i,n,j,v[2000010],k;
int main()
{
f>>n;
for(i=2;i<=n;i++){
if(!v[i]){
k++;
for(j=2;j*i<=n;j++)
v[i*j]=1;
}
}
g<<k;
}