3 条题解

  • 2
    @ 2025-2-14 20:58:13
    #include<bits/stdc++.h>
    using namespace std;
    #define yy return 0;
    #define mod % 
    #define key 47 
    string a, b;
    int sa = 1, 
    sb = 1, i, j; 
    int main() { 
      cin >> a >> b; 
      for (i = 0; i < a.size(); i ++) sa *= a[i] - 'A' + 1; 
      for (i = 0; i < b.size(); i ++)sb *= b[i] - 'A' + 1; sa = sa mod key, sb = sb mod key;
      if (sa == sb)puts("GO\n"); 
      else puts("STAY\n");
      yy
      }
    • 0
      @ 2025-4-1 9:44:56

      import java.util.Scanner;

          public class Main {
      
              public static void main(String[] args) {
                  Scanner sc = new Scanner(System.in);
      
                  //定义pStr记录人类, uStr记录UFO
                  String pStr = sc.next();
                  String uStr = sc.next();
      
                  //定义pSum和uSum来记录pStr和uStr的和
                  int pSum = 1;
                  int uSum = 1;
      
                  //遍历pStr和uStr,将每个字符转化为数字,然后相乘
                  for (int i = 0; i < pStr.length(); i++) {
                      pSum *= pStr.charAt(i) - 'A' + 1;
                  }
                  for (int i = 0; i < uStr.length(); i++) {
                      uSum *= uStr.charAt(i) - 'A' + 1;
                  }
      
                if ((pSum % 47) == (uSum % 47) ) {
                      System.out.println("GO");
                  } else {
                      System.out.println("STAY");
                  }
              }
          }
      
      • -2
        @ 2024-12-5 20:18:28

        #include<bits/stdc++.h> using namespace std; #define mod % #define key 47 string a, b; int sa = 1, sb = 1, i, j; int main() { cin >> a >> b; for (i = 0; i < a.size(); i ++)sa *= a[i] - 'A' + 1; for (i = 0; i < b.size(); i ++)sb *= b[i] - 'A' + 1; sa = sa mod key, sb = sb mod key; if (sa == sb)puts("GO\n"); else puts("STAY\n"); return 0; }

        • 1

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

        信息

        ID
        5258
        时间
        1000ms
        内存
        125MiB
        难度
        1
        标签
        递交数
        207
        已通过
        133
        上传者