1414.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<cstdio>

int main()
{
    int N;
    scanf("%d\n",&N);
    int x, y;
    while(N--)
    {
        scanf("%d %d\n",&x,&y);
        if(x>=0 && y>=0 && x==y) printf("%d\n",2*x-(x%2));
        else if(x>=0 && y>=0 && x-y==2) printf("%d\n",2*x-(x%2)-2);
        else printf("No Number\n");
    }
}