DHU OJ 分支结构 骰子

 

 

思路及代码

//input
//input T int 1<= <= 8
//input T组a,b int 1<= <= 6
#include<iostream>
using namespace std;
int main(){
    int T,a,b;
    cin >> T;
    while (--T >= 0){
        cin >> a >> b;
//solution
//compare a>b win
//a<b lose
//a=b same
        if (a > b){
            cout << "win" << endl;
        }else if (a < b){
            cout << "lose" << endl;
        }else{
            cout << "same" << endl;
        }
    }
    return 0;
}

 参考：无

收获：无

菜菜，不是教程，做题和学习记录