Cod sursa(job #663445)
Utilizator | Data | 18 ianuarie 2012 15:17:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <cstdio>
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int T, x, divisors, y, total;
scanf("%d", &T);
for(x=1; x<=T; x++)
{
divisors = 0;
for(y=1; y<=x; y++)
{
if(x%y == 0)
{
divisors++;
}
}
if(divisors == 2) {
total++;
}
}
printf("%d\n", total);
return 0;
}