Cod sursa(job #857020)
Utilizator | Data | 17 ianuarie 2013 09:53:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
using namespace std;
int i,j,n,k=1,nr,v[10000000];
int main()
{f>>n;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
nr++;
for(j=i+i;j<=n;j=j+i)
v[j]=0;
}
g<<nr;
return 0;
}