Cod sursa(job #1799614)
| Utilizator | Data | 6 noiembrie 2016 16:08:45 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,sol;
char f[2000001];
int main()
{
fin>>n;
sol=n-1;
for(i=2;i*i<=n;i++)
if(f[i]==0)
for(j=i+i;j<=n;j=j+i)
{
if(f[j]==0)
{
sol--;
}
f[j]=1;
}
fout<<sol;
fin.close();
fout.close();
return 0;
}
