Cod sursa(job #1725787)
Utilizator | Data | 6 iulie 2016 14:33:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,d,nr,ct=0;
in>>n;
for(i=2;i<=n;i++){
nr=1;
for(d=1;d<=sqrt(i);d++)
if(i%d==0)
nr++;
if(nr==2)
ct++;
}
out<<ct;
return 0;
}