C :

#include<stdio.h>
#include<string.h>
int main()
{
	int i,j,c=1,d=1;
	int len1,len2;
	char a[10],b[10];
	scanf("%s %s",a,b);
	len1=strlen(a);
	len2=strlen(b);
	for(i=0;i<len1;i++)
	c=c*(a[i]-'A'+1);
	for(j=0;j<len2;j++)
	d=d*(b[j]-'A'+1);
	if((c%47)==(d%47))
	printf("GO\n");
	else
	printf("STAY\n");
	return 0;
}

C++ :

#include <cstring>
#include <cstdio>
using namespace std;
int main()
{
    int a1=1;
    int a2=1;
    char s1[100];
    char s2[100];
    gets(s1);
    gets(s2);
    for (int i=0;i<strlen(s1);++i) 
     a1*=(int)s1[i]-64;
    for (int i=0;i<strlen(s2); ++i)
     a2*=(int)s2[i]-64;
    if (a1%47==a2%47) 
     printf("GO");
    else printf("STAY");
    return 0;
}     

Pascal :

var i,j,k,m,n,Len1,len2:longint;
sum1,sum2:INT64;
 s1,s2:string;
begin
 readln(s1);
 len1:=length(s1);
 readln(s2);
 len2:=length(s2);
 sum1:=1;
 sum2:=1;
 for i:=1 to len1 do
 begin
  sum1:=sum1*(ord(s1[i])-ord('A')+1);
  sum1:=sum1 mod 47;
 end;
 for i:=1 to len2 do
 begin
  sum2:=sum2*(ord(s2[i])-ord('A')+1);
  sum2:=sum2 mod 47;
 end;
 sum1:=sum1 mod 47;
 sum2:=sum2 mod 47;
 if sum1=sum2 then writeln('GO') else writeln('STAY');
end.