Cod sursa(job #3343892)
| Utilizator | Data | 28 februarie 2026 18:07:21 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
long long int N,a[2000001],k;
int main(){
fin>>N;
for (int i = 2; i * i <= N; ++i)
if(a[i]==0)
for(int j=i*i; j<=N; j+=i)
if(a[j]==0){
a[j]=1;
k++;
}
fout<<N-k-1;
}