Pagini recente » Cod sursa (job #2816409) | Cod sursa (job #2594845) | Cod sursa (job #1749337) | Cod sursa (job #116749) | Cod sursa (job #1708856)
#include <iostream>
#include <vector>
#include <math.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
int t;
ll n;
int main()
{ freopen("consecutive.in","r",stdin);
freopen("consecutive.out","w",stdout);
for(cin >> t; t--;) {
cin >> n;
for(int i = sqrt(2*n)+1; i>=1;i--)
{ if (( n- (i*(i+1)/2) )>0 && ( n- (i*(i+1)/2) ) % (i+1) == 0)
{ cout<< ((n- (i*(i+1)/2) ) / (i+1)) << " " << ((n-(i*(i+1)/2) ) / (i+1)+i) << "\n"; }
}
}
return 0; }