Cod sursa(job #1665772)
Utilizator | Data | 27 martie 2016 12:53:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,pr,i,j;
char v[2000005];
int main()
{
fin>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{
pr++;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
fout<<pr;
return 0;
}