Cod sursa(job #987310)
Utilizator | Data | 20 august 2013 13:48:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int prim(int n)
{
int i;
for(i=1;i<n;i++)
if(n%i!=0 && i!=1)
return 1;
else
return 0;}
int main()
{
int i,n,k;
ifstream f("ciur.in", ios::in);
ofstream g("ciur.out", ios::in);
f>>n;
k=0;
for(i=2;i<=n;i++)
if(prim(i)==1)
k++;
g<<k;
return 0;}