Cod sursa(job #1206874)
Utilizator | Data | 11 iulie 2014 13:29:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr;
char v[1000001];
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{
nr++;
for(j=i+i;j<=n;j=j+i)
{
if(v[j]==0)
v[j]++;
}
}
g<<nr;
return 0;
}