Cod sursa(job #1677249)
Utilizator | Data | 6 aprilie 2016 14:03:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
int n,i,j,nr;
bool a[1001];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
a[i]=true;
for(i=2;i*i<=n;i++)
if(a[i])
for(j=2*i;j<=n;j+=i)
a[j]=false;
for(i=2;i<=n;i++)
if(a[i]) nr++;
g<<nr;
return 0;
}