Cod sursa(job #1800354)
| Utilizator | Data | 7 noiembrie 2016 18:20:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,i,j,c=0;
char v[2000005];
int main()
{
fin>>N;
v[1]=1;
for(i=2;i<=N;i++)
{
if(v[i]==0)
{
for(j=2;j*i<=N;j++)
{
v[i*j]=1;
}
c++;
}
}
fout<<c;
return 0;
}
