找数列规律~
#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <cmath>
#include <vector>
#include <iomanip>
#include <algorithm>
//#include "myAlgorithm.h"
#define MAXL 1000005
#define INF 1e8
using namespace std;
int n;
int a[MAXL];
int partion(int low, int high){
int key = a[low];
while(low < high){
while(low < high && key <= a[high]){
high--;
}
swap(a[low], a[high]);
while(low < high && key >= a[low]){
low ++;
}
swap(a[low], a[high]);
}
return low;
}
void quickSort(int low, int high){
if(low < high){
int mid = partion(low, high);
quickSort(low, mid -1);
quickSort(mid + 1, high);
}
}
int main()
{
///freopen("in.txt","w",stdout);
/* while( cin>>n){
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
quickSort(0, n -1);
cout<<a[n/2]<<endl;
}*/
int k;
cin>>k;
int x, y;
while(k--){
cin>>x>>y;
int ans;
if(x == y ){
if(x%2==0){
ans = 4 * x /2;
}else{
ans = 4 *(x - 1)/2 + 1;
}
cout<<ans<<endl;
}else if(y == x - 2&& x>= 2){
if( x%2 ==0){
ans = ((x - 2)/2) * 4 + 2;
}else {
ans = (x - 3)/2 * 4 + 3;
}
cout<<ans<<endl;
}else {
cout<<"No Number"<<endl;
}
}
return 0;
}