Cod sursa(job #1977771)
| Utilizator | Data | 6 mai 2017 01:10:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
int i,j,n,nr;
bool f[2000001];
using namespace std;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=3;i<=n;i+=2)
for(j=2;i*j<=n;j++)
f[i*j]=true;
for(i=3;i<=n;i+=2)
if(f[i]!=true)
nr++;
out<<nr+1;
return 0;
}
