Cod sursa(job #2429131)
Utilizator | Data | 7 iunie 2019 23:15:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt;
int A[2000005];
int main()
{
int i,j;
fin>>n;
for(i = 2;i<=n;i++)
A[i]=1;
for(i = 2;i<=n;i++)
{
if(A[i])
{
cnt++;
for(int j = i+i;j<=n;j+=i)
A[j]=0;
}
}
fout<<cnt;
return 0;
}