Number of wins for each player in a series of Rock-Paper-Scissor game
Last Updated :
02 Aug, 2021
Two players are playing a series of games of Rock–paper–scissors. There are a total of K games played. Player 1 has a sequence of moves denoted by string A and similarly player 2 has string B. If any player reaches the end of their string, they move back to the start of the string. The task is to count the number of games won by each of the player when exactly K games are being played.
Examples:
Input: k = 4, a = “SR”, b = “R”
Output: 0 2
Game 1: Player1 = S, Player2 = R, Winner = Player2
Game 2: Player1 = R, Player2 = R, Winner = Draw
Game 3: Player1 = S, Player2 = R, Winner = Player2
Game 4: Player1 = R, Player2 = R, Winner = Draw
Input: k = 3, a = “S”, b = “SSS”
Output: 0 0
All the games are draws.
Approach: Let length of string a be n and length of string b be m. The observation here is that the games would repeat after n * m moves. So, we can simulate the process for n * m games and then count the number of times it gets repeated. For the remaining games, we can again simulate the process since it would be now smaller than n * m. For example, in the first example above, n = 2 and m = 1. So, the games will repeat after every n * m = 2 * 1 = 2 moves i.e. (Player2, Draw), (Player2, Draw), ….., (Player2, Draw).
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int compare( char first, char second)
{
if (first == second)
return 0;
if (first == 'R' ) {
if (second == 'S' )
return 1;
else
return -1;
}
if (first == 'P' ) {
if (second == 'R' )
return 1;
else
return -1;
}
if (first == 'S' ) {
if (second == 'P' )
return 1;
else
return -1;
}
}
pair< int , int > countWins( int k, string a, string b)
{
int n = a.length();
int m = b.length();
int i = 0, j = 0;
int moves = n * m;
pair< int , int > wins = { 0, 0 };
while (moves--) {
int res = compare(a[i], b[j]);
if (res == 1)
wins.first++;
if (res == -1)
wins.second++;
i = (i + 1) % n;
j = (j + 1) % m;
}
int repeat = k / (n * m);
wins.first *= repeat;
wins.second *= repeat;
int rem = k % (n * m);
while (rem--) {
int res = compare(a[i], b[j]);
if (res == 1)
wins.first++;
if (res == -1)
wins.second++;
i = (i + 1) % n;
j = (j + 1) % m;
}
return wins;
}
int main()
{
int k = 4;
string a = "SR" , b = "R" ;
auto wins = countWins(k, a, b);
cout << wins.first << " " << wins.second;
}
|
Java
import java.util.*;
import java.awt.Point;
class GFG{
public static int compare( char first, char second)
{
if (first == second)
return 0 ;
if (first == 'R' )
{
if (second == 'S' )
return 1 ;
else
return - 1 ;
}
if (first == 'P' )
{
if (second == 'R' )
return 1 ;
else
return - 1 ;
}
if (first == 'S' )
{
if (second == 'P' )
return 1 ;
else
return - 1 ;
}
return 0 ;
}
public static Point countWins( int k, String a,
String b)
{
int n = a.length();
int m = b.length();
int i = 0 , j = 0 ;
int moves = n * m;
Point wins = new Point ( 0 , 0 );
while (moves-- > 0 )
{
int res = compare(a.charAt(i),
b.charAt(j));
if (res == 1 )
wins = new Point(wins.x + 1 ,
wins.y);
if (res == - 1 )
wins = new Point(wins.x,
wins.y + 1 );
i = (i + 1 ) % n;
j = (j + 1 ) % m;
}
int repeat = k / (n * m);
wins = new Point(wins.x * repeat,
wins.y * repeat);
int rem = k % (n * m);
while (rem-- > 0 )
{
int res = compare(a.charAt(i),
b.charAt(j));
if (res == 1 )
wins = new Point(wins.x + 1 ,
wins.y);
if (res == - 1 )
wins = new Point(wins.x,
wins.y + 1 );
i = (i + 1 ) % n;
j = (j + 1 ) % m;
}
return wins;
}
public static void main(String[] args)
{
int k = 4 ;
String a = "SR" , b = "R" ;
Point wins = countWins(k, a, b);
System.out.println(wins.x + " " + wins.y);
}
}
|
Python3
def compare(first, second):
if (first = = second):
return 0
if (first = = 'R' ):
if (second = = 'S' ):
return 1
else :
return - 1
if (first = = 'P' ):
if (second = = 'R' ):
return 1
else :
return - 1
if (first = = 'S' ):
if (second = = 'P' ):
return 1
else :
return - 1
def countWins(k, a, b):
n = len (a)
m = len (b)
i = 0
j = 0
moves = n * m
wins = [ 0 , 0 ]
while (moves > 0 ):
res = compare(a[i], b[j])
if (res = = 1 ):
wins[ 0 ] + = 1
if (res = = - 1 ):
wins[ 1 ] + = 1
i = (i + 1 ) % n
j = (j + 1 ) % m
moves - = 1
repeat = k / / (n * m)
wins[ 0 ] * = repeat
wins[ 1 ] * = repeat
rem = k % (n * m)
while (rem > 0 ):
res = compare(a[i], b[j])
if (res = = 1 ):
wins[ 0 ] + = 1
if (res = = - 1 ):
wins[ 1 ] + = 1
i = (i + 1 ) % n
j = (j + 1 ) % m
return wins
if __name__ = = "__main__" :
k = 4
a = "SR"
b = "R"
wins = countWins(k, a, b);
print (wins[ 0 ], wins[ 1 ])
|
C#
using System;
using System.Collections.Generic;
class GFG{
static int compare( char first, char second)
{
if (first == second)
return 0;
if (first == 'R' )
{
if (second == 'S' )
return 1;
else
return -1;
}
if (first == 'P' )
{
if (second == 'R' )
return 1;
else
return -1;
}
if (first == 'S' )
{
if (second == 'P' )
return 1;
else
return -1;
}
return 0;
}
static Tuple< int , int > countWins( int k, string a,
string b)
{
int n = a.Length;
int m = b.Length;
int i = 0, j = 0;
int moves = n * m;
Tuple< int , int > wins = Tuple.Create(0, 0);
while (moves-- > 0)
{
int res = compare(a[i], b[j]);
if (res == 1)
wins = Tuple.Create(wins.Item1 + 1,
wins.Item2);
if (res == -1)
wins = Tuple.Create(wins.Item1,
wins.Item2 + 1);
i = (i + 1) % n;
j = (j + 1) % m;
}
int repeat = k / (n * m);
wins = Tuple.Create(wins.Item1 * repeat,
wins.Item2 * repeat);
int rem = k % (n * m);
while (rem-- > 0)
{
int res = compare(a[i], b[j]);
if (res == 1)
wins = Tuple.Create(wins.Item1 + 1,
wins.Item2);
if (res == -1)
wins = Tuple.Create(wins.Item1,
wins.Item2 + 1);
i = (i + 1) % n;
j = (j + 1) % m;
}
return wins;
}
static void Main()
{
int k = 4;
string a = "SR" , b = "R" ;
Tuple< int , int > wins = countWins(k, a, b);
Console.WriteLine(wins.Item1 + " " +
wins.Item2);
}
}
|
Javascript
<script>
function compare(first,second)
{
if (first == second)
return 0;
if (first == 'R ')
{
if (second == ' S ')
return 1;
else
return -1;
}
if (first == ' P ')
{
if (second == ' R ')
return 1;
else
return -1;
}
if (first == ' S ')
{
if (second == ' P')
return 1;
else
return -1;
}
return 0;
}
function countWins(k,a,b)
{
let n = a.length;
let m = b.length;
let i = 0, j = 0;
let moves = n * m;
let wins = [0, 0];
while (moves-- > 0)
{
let res = compare(a[i],
b[j]);
if (res == 1)
wins = [wins[0] + 1,
wins[1]];
if (res == -1)
wins =[wins[0],
wins[1] + 1];
i = (i + 1) % n;
j = (j + 1) % m;
}
let repeat = k / (n * m);
wins = [wins[0] * repeat,
wins[1] * repeat];
let rem = k % (n * m);
while (rem-- > 0)
{
let res = compare(a[i],
b[j]);
if (res == 1)
wins = [wins[0] + 1,
wins[1]];
if (res == -1)
wins = [wins[0],
wins[1] + 1];
i = (i + 1) % n;
j = (j + 1) % m;
}
return wins;
}
let k = 4;
let a = "SR" , b = "R" ;
let wins = countWins(k, a, b);
document.write(wins[0] + " " + wins[1]);
</script>
|
Time Complexity: O(N * M)
Auxiliary Space: O(1)
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...