Cod sursa(job #2479549)
Utilizator | Data | 23 octombrie 2019 22:03:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,cnt;
int main()
{
f>>n;
int v[n+1];
for(int i=2;i*i<=n;i++)
{
if(!v[i])
{
for(int j=2;j<=n/i;j++)
v[i*j]=1;
}
}
for(int i=2;i<=n;i++)
if(!v[i])
cnt++;
g<<cnt;
return 0;
}