[洛谷]CF1660A Vasya and Coins

Cot287

已于 2022-04-01 21:02:39 修改

阅读量339

点赞数 1

分类专栏： acm 文章标签： c++

于 2022-04-01 20:57:48 首次发布

本文链接：https://blog.csdn.net/m0_64839851/article/details/123907597

版权

acm 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

Vasya decided to go to the grocery store. He found in his wallet aa coins of 11 burle and bb coins of 22 burles. He does not yet know the total cost of all goods, so help him find out ss (s>0s>0): the minimum positive integer amount of money he cannot pay without change or pay at all using only his coins.

For example, if a=1a=1 and b=1b=1 (he has one 11-burle coin and one 22-burle coin), then:

he can pay 11 burle without change, paying with one 11-burle coin,
he can pay 22 burle without change, paying with one 22-burle coin,
he can pay 33 burle without change by paying with one 11-burle coin and one 22-burle coin,
he cannot pay 44 burle without change (moreover, he cannot pay this amount at all).

So for a=1a=1 and b=1b=1 the answer is s=4s=4.

Input

The first line of the input contains an integer tt (1≤t≤1041≤t≤104) — the number of test cases in the test.

The description of each test case consists of one line containing two integers aiai and bibi (0≤ai,bi≤1080≤ai,bi≤108) — the number of 11-burle coins and 22-burles coins Vasya has respectively.

Output

For each test case, on a separate line print one integer ss (s>0s>0): the minimum positive integer amount of money that Vasya cannot pay without change or pay at all.

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        if(a==0)printf("1\n");
        else printf("%d\n",2*b+a+1);
    }
    return 0;
}