Pagini recente » Cod sursa (job #1497951) | Cod sursa (job #1582857) | Cod sursa (job #1557442) | Cod sursa (job #3166946) | Cod sursa (job #2742989)
#include <bits/stdc++.h>
using namespace std;
ifstream in("consecutive.in");
ofstream out("consecutive.out");
void solve(){
int n;
in >> n;
int m = sqrt(n)*2 + 2;
vector<pair<int,int> > sol;
for(int i=2; i<=m; i++){
int val = n - i*(i-1)/2;
if(val % i == 0){
int p = val/i;
if(p <= 0) continue;
sol.push_back({p, p+i-1});
}
}
out << sol.size() << '\n';
for(auto elem: sol){
out << elem.first << ' ' << elem.second << '\n';
}
}
int main(){
int t;
in >> t;
while(t--){
solve();
}
return 0;
}