Cod sursa(job #1721341)
Utilizator | Data | 25 iunie 2016 13:12:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f("ciur.in");;
ofstream g("ciur.out");
int main()
{
int n,nr=0,i,j;
f>>n;
bool a[n+1];
for(i=1;i<=n;i++)
a[i]=true;
for(i=2;i<=sqrt(n);i++)
if(a[i])
for(j=pow(i,2);j<=n;j=j+i)
a[j]=false;
for(i=2;i<=n;i++)
if(a[i])
nr++;
g<<nr;
}