Pagini recente » Cod sursa (job #238291) | Cod sursa (job #2191988) | Cod sursa (job #2758904) | Cod sursa (job #2650577) | Cod sursa (job #1758025)
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
int t;
ifstream f("consecutive.in");
ofstream g("consecutive.out");
void solve();
int main()
{
f >> t;
while(t--) solve();
cout << "Hello world!" << endl;
return 0;
}
void solve(){
int nr;
f >> nr;
vector<pair<int,int>> v;
int deScazut=0;
for(int i=1;i <= 2 * sqrt(nr);i++){
deScazut+=i;
if((nr - deScazut) % (i+1) == 0){
v.push_back(make_pair( (nr - deScazut)/ (i+1), (nr - deScazut)/ (i+1)+ i));
}
}
g << v.size() - 1 << '\n';
for(int i=0;i<v.size() - 1;i++) g << v[i].first << ' ' << v[i].second << '\n';
}