Cod sursa(job #2854163)
Utilizator | Data | 20 februarie 2022 23:21:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<bits/stdc++.h>
#define nmax 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int ciur[nmax];
int main()
{
int n,cnt=0;//nr prime
f>>n;
ciur[0]=ciur[1]=1;
for(int i=1;i<=n;i++)
{
if(ciur[i]==0) //nu i prim
cnt++;
for(int j=i*2;j<=n;j+=i)
ciur[j]=1;//multipli lui i out
}
g<<cnt;
}