Cod sursa(job #3203031)
Utilizator | Matei Botoghina Matt1999 | Data | 12 februarie 2024 23:15:02 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define N_MAX 2000000
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int nr, i, j, cnt = 0;
fin >> nr;
char a[2000000]={0};
for(i = 2; i <= nr; i++)
{
if(a[i] == 0)
{
j = 2;
while(i*j <= nr)
{
a[i*j] = 1;
j++;
}
}
else
{
continue;
}
}
for(i = 2; i <= nr; i++)
{
if(a[i] == 0)
{
cnt++;
}
}
fout << cnt;
}