Cod sursa(job #1321282)
Utilizator | Data | 18 ianuarie 2015 22:26:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[1000];
int main()
{
int n,i,j,nr=0;
f>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{
nr++;
for(j=i*2;j<=n;j+=i)
v[j]=1;
}
g<<nr;
return 0;
}