Cod sursa(job #1681220)
| Utilizator | Data | 9 aprilie 2016 12:23:44 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,rs=0;
bool prim[2000003];
int main()
{
fin>>n;
for(i=2;i<=n;i++)
{
prim[i]=true;
}
for(i=2;i<=n;i++)
{
if(prim[i])
{
rs++;
for(j=i+i;j<=n;j=j+i)
{
prim[j]=false;
}
}
}
fout<<rs;
return 0;
}
