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