Pagini recente » Cod sursa (job #3344738) | Cod sursa (job #1228675) | Cod sursa (job #2139728) | Cod sursa (job #3341479) | Cod sursa (job #3302415)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
void solve(){
int n;
fion >> n;
vector<pair<int, int>> ans;
for(int p = 2; p * (p + 1) <= 2 * n; p++){
if((2 * n) % p == 0){
int k = (2 * n) / p;
k -= (p + 1);
if(k % 2 == 0){
ans.push_back({k / 2 + 1, k / 2 + p});
}
}
}
fout << ans.size() << '\n';
for(auto [x, y] : ans){
fout << x << " " << y << '\n';
}
}
signed main(){
int t;
fin >> t;
while(t--) solve();
return 0;
}