题目链接

https://www.patest.cn/contests/gplt/L1-047

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;

typedef long long LL;
const double PI  = 3.14159265358979323846264338327;
const double E   = 2.718281828459;  
const double eps = 1e-6;
const int MAXN   = 0x3f3f3f3f;
const int MINN   = 0xc0c0c0c0;
const int maxn   = 1e5 + 5; 
const int MOD    = 1e9 + 7;

int main()
{
    int n;
    cin >> n;
    while (n--)
    {
        string s;
        int a, b;
        cin >> s >> a >> b;
        if (a > 20 || a < 15 || b > 70 || b < 50)
            cout << s << endl;
    }
}

相关文章:

  • 2022-01-31
  • 2021-11-03
  • 2021-06-09
  • 2021-12-04
  • 2021-05-31
  • 2022-02-05
猜你喜欢
  • 2021-08-15
  • 2021-12-24
  • 2021-10-13
  • 2022-02-12
  • 2022-02-20
  • 2021-12-09
相关资源
相似解决方案