Cod sursa(job #1696855)
Utilizator | Data | 30 aprilie 2016 00:47:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000002];
int main()
{
int i,j,n,nr=0;
f>>n;
for(i=2;i<=n;i++)
a[i]=1;
for(i=2;i<=sqrt(n);i++)
if(a[i])
for(j=i;j<=n/i;j++)
a[i*j]=0;
for(i=2;i<=n;i++)
if(a[i])
nr++;
g<< nr;
return 0;
}