Cod sursa(job #1358435)
Utilizator | Data | 24 februarie 2015 16:56:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
FILE *fin, *fout;
int main()
{
fin = fopen("ciur.in", "r");
fout = fopen("ciur.out", "w");
int n;
fscanf(fin, "%d", &n);
bool C[200000] = {0};
int rez = 0;
for(int i = 2; i*i <= 10; i++)
{
for(int j = i; j <= 10; j*=i)
C[j] = 1;
}
for(int i = 2; i <= 10; i++)
if(C[i] == 0)
rez++;
fprintf(fout, "%d\n", rez);
}