Cod sursa(job #1275067)
Utilizator | Data | 24 noiembrie 2014 18:37:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int nr,n,nr1,i,d;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
nr=0; nr1=0;
for(i=1;i<=n;i++)
for(d=2;d<=n;d++)
{
if(n%d==0)
nr++;
if(nr==2)
{
nr=nr1;
nr1++;
}
}if(nr1<=n)
g<<nr1<<"\n";
f.close();
g.close();
return 0;
}