Cod sursa(job #1059198)
Utilizator | Data | 16 decembrie 2013 13:07:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include<fstream>
using namespace std;
int n,i,j,k,v[2000002];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i*i<n;i++)
if(v[i]!=1)
for(j=i*i;j<n;j=j+i) v[j]=1;
for(i=2;i<n;i++)
if(v[i]==0)
{ k++;
//g<<k<<" . "<<i<<"\n";
}
g<<k; g.close();
return 0;
}