Cod sursa(job #2364418)
| Utilizator | Data | 4 martie 2019 08:22:38 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2002226];
int main()
{
a[1]=1;
int i,j;
for(i=2;i<=1415;i++)
if(a[i]==0)
for(j=i;j<=2002225/i;j++)
a[i*j]=1;
int n,cnt=0;
f>>n;
for(i=1;i<=n;i++)
if(a[i]==0)
cnt++;
g<<cnt;
return 0;
}
