Cod sursa(job #1239879)
| Utilizator | Data | 9 octombrie 2014 21:58:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream>
using namespace std;
ifstream fin("b.in");
ofstream fout("b.out");
int n,i,k,viz[2000001],j;
int main()
{
fin>>n;
for(i=2;i<=n;i++)
{
if(!viz[i])
{
k++;j=0;
while(i*j<=n)
{
j++;
viz[i*j]=1;
}
}
}
fout<<k;
return 0;
}
