吃鱼还是吃肉
https://pintia.cn/problem-sets/994805046380707840/problems/1111914599412858884
題解:
/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int a[N]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);scanf("%d",&t);while(t--){//scanf("%d",&n);cin>>n>>m>>k;if(n){if(m<130){cout << "duo chi yu! " ;}else if(m>130){cout << "ni li hai! " ;}else{cout << "wan mei! " ;}if(k<27){cout << "duo chi rou!" ;}else if(k>27){cout << "shao chi rou!" ;}else{cout << "wan mei!" ;}}else{if(m<129){cout << "duo chi yu! " ;}else if(m>129){cout << "ni li hai! " ;}else{cout << "wan mei! " ;}if(k<25){cout << "duo chi rou!" ;}else if(k>25){cout << "shao chi rou!" ;}else{cout << "wan mei!" ;}}cout<<endl;}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }?
總結
- 上一篇: 幸运彩票
- 下一篇: Nearest Common Ances