NYOJ-64 鸡兔同笼

source link

1.tips

解方程，判断下解是不是正整数

2.code

#include <iostream>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

int main()
{
    int t;
    int n,m;

    cin>>t;

    while(t--)
    {
        cin>>n>>m;
        int x=(m-2*n)/2;
        if((m-2*n)%2 || (m-2*n)<=0)
            cout<<"No answer"<<endl;
        else
            cout<<n-x<<" "<<x<<endl;
    }

    return 0;
}