Cod sursa(job #1612794)
Utilizator | Data | 25 februarie 2016 01:02:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int n,i,j,nr;
int prim(int x)
{
int j;
if(x==1)
return 0;
else
for(j=2;j*j<=x;j++)
if(x%j==0)
return 0;
return 1;
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=n;i++)
if(prim(i))
nr++;
g<<nr<<" ";
}