1 条题解
-
0
C++ :
#include <bits/stdc++.h> using namespace std; char a[7],b[7]; const int mod=47; int ans1=1,ans2=1; int ascii(char ch){ char gg1 = '@'; int gg2 = gg1; return ch - gg1; } void in(){ scanf("%s\n%s", &a, &b); } void count(){ for (int i = 0; i < strlen(a); i++) ans1 *= ascii(a[i]); for (int i = 0; i < strlen(b); i++) ans2 *= ascii(b[i]); ans1 %= mod; ans2 %= mod; } void tick(){ if (ans1 == ans2) cout << "GO" << endl; else cout << "STAY" << endl; } int main(){ in(); count(); tick(); }
- 1
信息
- ID
- 1229
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者