Cod sursa(job #1501898)
Utilizator | Data | 13 octombrie 2015 22:30:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,i,d,s=0,ok,div;
f>>n;
for (i=2;i<=n;i++)
{
div=0;
for (d=1;d<=n;d++)
{
if (i%d==0)
div++;
}
if (div==2)
s++;
}
g<<s;
return 0;
}