Cod sursa(job #1047470)
Utilizator | Data | 4 decembrie 2013 16:34:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
int main(){
ifstream in("ciur.in");
ofstream out("ciur.out");
int v[200000]={0},i,g=0,j,n;
in>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{
for(j=2*i;j<=n;j=j+i)
v[j]=1;
g++;
}
out<<g;
in.close();
out.close();
return 0;
}