Cod sursa(job #1320098)
Utilizator | Data | 17 ianuarie 2015 16:41:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | oji2015_09_1 | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,n,r=0;
bool a[2000000];
f>>n;
for(i=0;i<sqrt(n);i++) a[i]=true;
for(i=2;i<sqrt(n);i++)
{
if(a[i])
for(j=i*i;j<n;j+=i)
a[j]=false;
}
for(i=0;i<n;i++){
if(a[i])r++;
}
cout<<r;
}