Cod sursa(job #3311971)
| Utilizator | Data | 25 septembrie 2025 09:59:25 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long nr_total_div(int n){
unsigned long long nr = 0;
long long a = 1;
while((long long)a*a<=n){
nr+=1+2*(n/a-a);
a++;
}
return nr;
}
int main()
{
ifstream fin("ndiv.in");
ofstream fout ("ndiv.out");
unsigned long long n,m;
fin>>n>>m;
fout<<nr_total_div(m)-nr_total_div(n-1);
return 0;
}
