Pagini recente » Cod sursa (job #1961085) | Cod sursa (job #1413344) | Cod sursa (job #2972056) | Cod sursa (job #2741143) | Cod sursa (job #2054089)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
int n, t;
vector <pair <int, int> > v;
int main() {
fin >> t;
for (int i = 0; i < t; ++i) {
fin >> n;
for (int j = 1; j < (n / 2) + 2; ++j) {
for (int k = j + 1; k < (n / 2) + 3; ++k) {
int sum = (k + j) * (k - j + 1) / 2;
if (sum == n) {
v.push_back(make_pair(j, k));
}
}
//sum = (m + n) * (m - n + 1) / 2;
}
}
fout << v.size() << '\n';
for (int i = 0; i < v.size(); ++i) {
fout << v[i].first <<' '<< v[i].second << '\n';
}
return 0;
}