Cod sursa(job #2716033)
Utilizator | Data | 4 martie 2021 16:33:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<iostream>
#include<cmath>
#include<fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int N,c=0;
f>>N;
int a[N];
for(int i=1;i<=N;i++)
{
a[i]=i;
}
for(int i=2;i<=N;i++)
{
for(int j=2;j<=sqrt(N);j++)
if(i*j<N)
a[i*j]=0;
if(a[N]%2==0)
a[N]=0;
if(a[i])
c++;
}
g<<c;
}