Cod sursa(job #2500978)
Utilizator | Data | 28 noiembrie 2019 21:51:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,ans;
bool A[2000001];
int main(){
fin >> n;
for(int i = 2; i <= n; i++)
{
if(!A[i])
{
ans++;
int j = i + i;
while(j <= n)
{
A[j] = 1;
j += i;
}
}
}
fout << ans;
return 0;
}