LAB5_332
123456789101112131415161718192021222324252627282930313233343536373839
#include <iostream>
using namespace std;
long Sum(long N)
{
long sum = 1, i, beg = 2, d = 1;
if (N & 1)
{
d = 2;
beg = 3;
}
for (i = beg; i * i < N; i += d)
if (N % i == 0)
sum += (i + N / i);
if (i * i == N)
sum += i;
return sum;
}
int main()
{
long M, N, k;
cin >> M >> N;
long* A = new long[N - M + 1];
for (int i = 0; i <= N - M; i++)
A[i] = Sum(i + M);
k = 0;
for (int i = 0; i <= N - M; i++)
if (A[i] >= M && A[i] <= N && A[A[i] - M] == i + M && i + M < A[i])
{
cout << i + M << " " << A[i] << endl;
k++;
}
if (!(k))
cout << "Absent" << endl;
delete[] A;
return 0;
}
Cpp
INFO