50分的小蒟蒻都是应该STAY的GO了QwQ

P1200 [USACO1.1] 你的飞碟在这儿 Your Ride Is Here

@[牛奶小咖啡](/user/317198) 要强制转换成int型
by asasas @ 2020-04-22 15:43:56


第二个for应该是s2[i]
by HsKr @ 2020-04-22 15:44:19


@[HsKr](/user/247658) 对
by asasas @ 2020-04-22 15:44:37


```cpp # include <cstdio> # include <cstring> using namespace std; char star[10],team[10]; int main() { long long p1=1,p2=1; scanf("%s",&star[0]); scanf("%s",&team[0]); for (int i = 0; i < strlen(star); ++i) p1*=(star[i]-64); for (int i = 0; i < strlen(team); ++i) p2*=(team[i]-64); p1%=47; p2%=47; if (p1==p2) printf("GO\n"); else printf("STAY\n"); return 0; } ```
by liu_bi_ @ 2020-04-22 15:44:38


不用吧...
by MilkyCoffee @ 2020-04-22 15:44:46


@[牛奶小咖啡](/user/317198) 人呢
by asasas @ 2020-04-22 15:44:52


第二个for出错了,改成这样: ```cpp // #include <bits/stdc++.h> #include <cmath> #include <algorithm> #include <iostream> #include <iomanip> #include <string> #include <cstdio> #include <cstring> using namespace std; int main() { string s1; string s2; cin >> s1 >> s2; // 输入 int sum1 = 1; // 初始化为1,因为要连乘 int sum2 = 1; // 同上 int l1 = s1.length(); // 取长度 int l2 = s2.length(); // 同上 for (int i = 0; i < l1; i++) { // 循环第一个 sum1 = sum1 * (s1[i] - 'A' + 1); // 连乘 } for (int i = 0; i < l2; i++) { // 同24行 sum2 = sum2 * (s2[i] - 'A' + 1); // 连乘 } if (sum1 % 47 == sum2 % 47) { // 判断 cout << "GO" << endl; // 输出 } else { cout << "STAY" << endl; } return 0; } ```
by xhQYm @ 2020-04-22 15:44:54


@[牛奶小咖啡](/user/317198)
by xhQYm @ 2020-04-22 15:45:01


在评测,如果过了,人人关注哦YEAH
by MilkyCoffee @ 2020-04-22 15:45:34


AC了!
by MilkyCoffee @ 2020-04-22 15:45:45


| 下一页