1 条题解

  • 0
    @ 2025-9-10 9:15:18

    C :

    #include<stdio.h>
    #include<string.h>
    
    int main()
    {
    	char c1[7],c2[7];
    	int s1=1,s2=1,i;
    	scanf("%s",&c1);
    	scanf("%s",&c2);
    	for(i=0;i<strlen(c1);i++)
    		s1*=c1[i]-'A'+1;
    	for(i=0;i<strlen(c2);i++)
    		s2*=c2[i]-'A'+1;
    	printf("%s\n",(s1%47==s2%47)?"GO":"STAY");	
    	return 0;
    } 
    

    Pascal :

    const mo=47;
    var s1,s2:string;
    i,l1,l2,sum1,sum2:longint;
    begin
    readln(s1);
    l1:=length(s1);
    sum1:=1;
    for i:=1 to l1 do
    sum1:=sum1*(ord(s1[i])-ord('A')+1);
    sum1:=sum1 mod mo;
    readln(s2);
    l2:=length(s2);
    sum2:=1;
    for i:=1 to l2 do
    sum2:=sum2*(ord(s2[i])-ord('A')+1);
    sum2:=sum2 mod mo;
    if sum1=sum2 then writeln('GO') else writeln('STAY');
    end.
    
    • 1

    信息

    ID
    4688
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者