Pagini recente » Cod sursa (job #766429) | Cod sursa (job #1928877) | Cod sursa (job #1896603) | Cod sursa (job #1942206) | Cod sursa (job #2711)
Cod sursa(job #2711)
#include <stdio.h>
#include <string.h>
#define NMAX 1000
char s1[NMAX], s2[NMAX];
long p1 = 1, p2 = 1, len1, len2;
void read()
{
scanf("%s\n", s1);
len1 = strlen(s1);
scanf("%s\n", s2);
len2 = strlen(s2);
}
inline int convers(char c)
{
return (c-'A'+1);
}
void prod(char s[], long *p)
{
int i;
for(i = 0; i < len1; ++i)
{
*p *= convers(s[i]);
//printf("%d ", convers(s[i]));
}
}
inline int compar(long p1, long p2)
{
if( (p1%47) == (p2%47) )
return 1;
return 0;
}
int main()
{
freopen("ride.in", "r", stdin);
freopen("ride.out", "w", stdout);
read();
prod(s1, &p1);
prod(s2, &p2);
if(compar(p1, p2))
{
printf("GO\n");
}
else
{
printf("STAY\n");
}
fclose(stdin);
fclose(stdout);
return 0;
}