MWC '15 #1 P5: Love Guru

Points: 7 (partial)

Time limit: 1.0s

Memory limit: 256M

Author:

Problem type

Hypnova is a love guru. He has a mathematical way to determine the compatibility of two people. His method is as follows:

Take the names of the two people and perform the following process:
- Take the value of each letter (a = 1, b = 2, c = 3, etc.) and put it to the power of its position in the name (starting from 1).
- Sum these values together and mod the number by $10$ $10$ into the range $[1, 10]$ $[1, 10]$ .
Add these two values together to get the compatibility out of $20$ $20$ .

Hypnova needs you to make a program that calculates two people's compatibility based on the criterion described above. The program should not be case sensitive.

Input Specification

Given names $A$ $A$ and $B$ $B$ , find their compatibility out of $20$ $20$ . The names are guaranteed to consist of only latin letters and $L$ $L$ $(1 \le L \le 10^6)$ $(1 \leq L \leq 10^{6})$ letters in length.

Subtask 1 [10%]

$1 \le L \le 6$ $1 \leq L \leq 6$

Subtask 2 [20%]

$1 \le L \le 20$ $1 \leq L \leq 20$

Subtask 3 [70%]

$1 \le L \le 10^6$ $1 \leq L \leq 10^{6}$

Output Specification

A number in the range $[2, 20]$ $[2, 20]$ .

Sample Input

Copy

Romeo
Juliet

Sample Output

Copy

Explanation for Sample Output

Romeo: $18^1 + 15^2 + 13^3 + 5^4 + 15^5 = 762\,440 \equiv 10 \pmod{10}$ $18^{1} + 15^{2} + 13^{3} + 5^{4} + 15^{5} = 762 440 \equiv 10 (\mod 10)$
Juliet: $10^1 + 21^2 + 12^3 + 9^4 + 5^5 + 20^6 = 64\,011\,865 \equiv 5 \pmod{10}$ $10^{1} + 21^{2} + 12^{3} + 9^{4} + 5^{5} + 20^{6} = 64 011 865 \equiv 5 (\mod 10)$
Compatibility: $10 + 5 = 15$ $10 + 5 = 15$

Comments

0

sdesai9192 commented on Aug. 24, 2021, 1:59 a.m. ← edited →

What does mod by 10 into the range [1,10] mean?

Edit: I believe I understand what the function mod means, however I don't really know what the question is asking. lol

1

Badmode commented on Aug. 24, 2021, 4:15 a.m.

It means mod by 10 but if the result is 0, add 10 so your answer for that name should be between 1-10.

0

sdesai9192 commented on Aug. 24, 2021, 11:06 a.m.

Ok, thanks!

7

icicreampoph commented on March 18, 2016, 3:56 a.m.

Hypnova sensei, I'm lonely can you set me up? pls <3 <3

1

Hypnova commented on March 18, 2016, 8:30 p.m.

Me too

0

Jeffmagma commented on March 16, 2016, 3:01 p.m.

Isn't 10 mod 10 0?

0

aurpine commented on March 16, 2016, 9:29 p.m. ← edited →

Yes, but the problem statement says:

...mod the number by $10$ $10$ into the range $[1,10]$ $[1, 10]$