Cod sursa(job #812611)
Utilizator | Data | 14 noiembrie 2012 08:29:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
bool v[2000005];
int n,m,i,j;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
m=0;
for(i=2;i<=n;i++)
if(v[i]==0)
{
for(j=i+i;j<=n;j=j+i)
v[j]=1;
m++;
}
g<<m;
return 0;
}