Cod sursa(job #3292866)
| Utilizator | Data | 9 aprilie 2025 15:37:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <bits/stdc++.h>
#define VMAX 2000005
#define INF 2147000000
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[VMAX];
int main()
{
int n,m,i,j,k,t,q,nr,minim,maxim,st,dr,mij;
fin>>n;
nr=n-1;
for(i=2;i<=n;i++)
{
for(j=2;j*i<=n;j++)
{
if(ciur[i*j]==0)
{
ciur[i*j]=1;
nr--;
}
}
}
fout<<nr<<'\n';
return 0;
}
