Cod sursa(job #536573)
| Utilizator |  Florin Popescu floryn35 |
Data | 18 februarie 2011 20:07:00 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#include<iostream.h>
#include<fstream.h>
#include<math.h>
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,p,m;
f>>n;
m=n;
for (i=2;i<sqrt(n);i++)
{
p=2;
j=i*p;
while (j<=n)
{
m--;
p++;
j=i*p;
}
}
g<<m;
f.close();
g.close();
}