0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-11 22:06:27 +00:00
OI-codes/Luogu/P1200/solution.md

43 lines
657 B
Markdown
Raw Normal View History

## 思路
按照题意计算即可。
## 代码
```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
int us = 1, zs = 1;
string a, b;
getline(cin, a);
getline(cin, b);
for (int i = 0; i < 7; i++) {
if (a[i] <= 0) break;
else us *= a[i] - 64;
}
for (int i = 0; i < 7; i++) {
if (b[i] <= 0) break;
else zs *= b[i] - '@';
}
us %= 47;
zs %= 47;
if (us == zs) cout << "GO" << endl;
else cout << "STAY" << endl;
return 0;
}
```
## 后记
2022-06-01 01:45:41 +00:00
- Update12019-07-10
2022-06-01 01:45:41 +00:00
无说明。
2022-06-01 01:45:41 +00:00
- Update22020-10-12
2022-06-01 01:45:41 +00:00
- 优化代码
- 弃用不安全的 `gets` 函数。