Cod sursa(job #1932623)
Utilizator | Data | 19 martie 2017 22:23:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.24 kb |
#include <fstream>
using namespace std;ifstream f("ciur.in");ofstream g("ciur.out");int main(){int n,s=0,gasit;char nr[2000001];f>>n;for(int i=3;i<=n;i+=2)for(int j=i*i;j<=n;j+=2*i){if(nr[j]!=1)s++;nr[j]=1;}g<<n-(n/2)-s;f.close();g.close();}