这道题很简单,用栈就可以了
2023-07-26 11:12:44
发布于:广东
11阅读
0回复
0点赞
直接上代码
#define A18 for (int i = 3; (i * i) <= number; i += 2) if (number % i == 0) return false;
#define A17 for (int i = 0; i < s.size() && s[i] != '@'; i++)
#define A16 if (number % 2 == 0) return false;
#define A15 if (s[i] == '(') st.push(s[i]);
#define A14 if (number < 2) return false;
#define A13 if (number == 2) return true;
#define A12 bool is_prime(int number) {
#define A11 else cout << "YES\n";
#define A10 else if (s[i] == ')')
#define AF if (b == 0) return a;
#define AE int gcd(int a, int b)
#define AD return gcd(b, a % b);
#define AC using namespace std;
#define AB cout << "NO\n";
#define AA if (st.empty())
#define A9 stack<char> st;
#define A8 else st.pop();
#define A7 if (st.size())
#define A6 return true;
#define A5 int main()
#define A4 cin >> s;
#define A3 return 0;
#define A2 str s;
#define A1 {
#define A0 }
#include<bits/stdc++.h>
#define ll long long
#define str string
#define A19 AC AE A1 AF AD A0 A12 A14 A13 A16
#define A1A A18 A6 A0 A5 A1 A2 A4 A9 A17 A1
#define A1B A15 A10 A1 AA A1 AB A3 A0 A8 A0
#define A1C A0 A7 A1 AB A0 A11 A3 A0
#define A1D A19 A1A A1B A1C
#define A1E(__FOX__) __FOX__
A1E(A1D)
全部评论 1
6.Please don't use "#define" to encryption.
2023-07-26 来自 广东
0
有帮助,赞一个