Cod sursa(job #1437586)
Utilizator | Sorin-Gabriel maricasorin | Data | 17 mai 2015 23:21:37 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int j,n,nr;
ifstream f("ciur.in");
f>>n;
int v[n+1];
for (int i=2;i<=n;i++) v[i]=0;
j=2;
while (j<=n)
{
nr++;
for (int i=j;i<=n;i=i*j) v[i]=1;
while (v[j]==1) j++;
}
ofstream g("ciur.out");
g<<nr;
return 0;
}