Cod sursa(job #1535501)
Utilizator | Data | 24 noiembrie 2015 20:48:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int main()
{
int cnt=0,n,a,i;
in>>n;
for(a=1;a<=n;a++)
{
for(i=1;i<=sqrt(a);i++)
{
if(a%i!=0)
cnt++;
}
}
out<<cnt;
return 0;
}