-
Notifications
You must be signed in to change notification settings - Fork 0
/
CramTime.cpp
73 lines (71 loc) · 1.17 KB
/
CramTime.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
/*
Author: Sanskar Agarwal
Nick: sanskaragarwal
Birla Institute Of Technology, Mesra
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define INF 100009
#define mod 1000000007
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
#define test while(t--)solve();
void solve()
{
ll a, b;
cin >> a >> b;
vector<int>ans;
int i = 1;
while (a - i >= 0)
{
ans.pb(i);
a -= i;
i++;
}
ll x = i - a;
int count = ans.size();
if (x > 0 && x < i)
{
ans.pb(i++);
}
cout << count << endl;
for (int t : ans)
{
if (t == x)
continue;
cout << t << ' ';
}
cout << endl;
ans.clear();
if (x > 0 && x < i && b - x >= 0)
ans.pb(x), b -= x;
while (b - i >= 0)
{
ans.pb(i);
b -= i;
i++;
}
cout << ans.size() << endl;
for (int t : ans)
cout << t << ' ';
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast
ll t;
t = 1;
// cin >> t;
test;
return 0;
}