Cod sursa(job #526993)
| Utilizator | Data | 30 ianuarie 2011 12:20:09 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
char markings[1000001];
int main(void)
{
int n, count=1;
ifstream f("ciur.in");
f >> n;
f.close();
for (int i = 1;(i<<1)|1<=n;i+=1)
{
if (!markings[i])
{
count++;
markings[i] = 1;
for (int j=i+i+i+1;(j<<1)|1<=n;j+=(i<<1)|1)
{
markings[j] = 1;
}
}
}
ofstream g("ciur.out");
g << count;
g.close();
return 0;
}
