Cod sursa(job #1490306)
Utilizator | Data | 23 septembrie 2015 10:00:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n, p=0;
bool *v;
f>>n;
v = new bool[n+2];
for (int turcu=0;turcu<=n;turcu++)
v[turcu]=0;
for (int i=2;i<=n/2;i++)
{
for (int j=1;i*j<=n;j++)
v[i*j]=1;
}
for (int i=1;i<=n;i++)
if (v[i]==0) p++;
g<<p;
return 0;
}