Cod sursa(job #1697165)
| Utilizator | Data | 30 aprilie 2016 21:34:30 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,cnt=0;
char prim[2000005];
int main()
{
int i,j;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2;i<=n;i++)
prim[i]=1;
for (i=2;i<=n;i++)
if (prim[i])
{
cnt++;
for (j=i+i;j<=n;j+=i)
prim[j]=0;
}
g<<cnt;
f.close();
g.close();
return 0;
}
