Cod sursa(job #865865)
| Utilizator | Data | 27 ianuarie 2013 10:50:34 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
char v[2000001];
int n,i,j,c;
f>>n;
c=0;
for(i=1;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i]==1)
{
c++;
for(j=i+i;j<=n;j=j+i)
v[j]=0;
}
g<<c;
f.close();
g.close();
return 0;
}