Cod sursa(job #1236511)
| Utilizator | Data | 2 octombrie 2014 00:40:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<algorithm>
#define N 2000100
#define FOR(a,b,c) for(register int a=b;a<=c;++a)
#define ROF(a,b,c) for(register int a=b;a>=c;--a)
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[N],sol,n;
int main ()
{
f>>n;
FOR(i,2,n)
if(!v[i])
{
for(register int j=2;j*i<=n;++j)
v[i*j]=1;
sol++;
}
g<<sol;
return 0;
}
//Look at me!Look at me!The monster inside me has grown this big!