Cod sursa(job #2136380)
| Utilizator | Data | 19 februarie 2018 21:18:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int n, cont;
int f[2000005];
int main()
{
in>>n;
for( int i = 1; i <= n; i++ )
for( int j = 1; j*i <= n; j++ )
f[i*j]++;
for( int i = 2; i <= n; i++ )
if( f[i] == 2 )
cont++;
out<<cont;
return 0;
}
