不是很善于找规律,
1: 1
2 1 1
3 1 1 1
4: 1 2 1
5 1 2 1 1
6 1 2 2 1
7 1 2 2 1 1
8 1 2 2 2 1
9: 1 2 3 2 1
10 1 2 3 2 1 1
11 1 2 3 2 2 1
12 1 2 3 3 2 1
13 1 2 3 3 2 1 1
14 1 2 3 3 2 2 1
15 1 2 3 3 3 2 1
16: 1 2 3 4 3 2 1
参考:http://www.cppblog.com/syhd142/articles/131861.html?opt=admin
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <cctype>
#include <algorithm>
#include <cmath>
#include <deque>
#include <map>
using namespace std;
///
#define INF 0xffffff7
#define MAXN 200
///
int main()
{
///
int i, j;
int counts, step;
int nCases;
cin >> nCases;
while (nCases--)
{
int start, final;
cin >> start >> final;
counts = 0;
step = 1;
int dif = final - start;
bool flag = false;
while (dif > 0)
{
dif = dif - step;
counts++;
if (flag)
step++;
flag = !flag;
}
cout << counts << endl;
}
///
return 0;
}