Algorithm
Two players are playing a game. First each of them writes an integer from 1 to 6, and then a dice is thrown. The player whose written number got closer to the number on the dice wins. If both payers have the same difference, it's a draw.
The first player wrote number a, the second player wrote number b. How many ways to throw a dice are there, at which the first player wins, or there is a draw, or the second player wins?
The single line contains two integers a and b (1 ≤ a, b ≤ 6) — the numbers written on the paper by the first and second player, correspondingly.
Print three integers: the number of ways to throw the dice at which the first player wins, the game ends with a draw or the second player wins, correspondingly.
2 5
3 0 3
2 4
2 1 3
The dice is a standard cube-shaped six-sided object with each side containing a number from 1 to 6, and where all numbers on all sides are distinct.
You can assume that number a is closer to number x than number b, if |a - x| < |b - x|.
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, r1 = 0, r2 = 0, r3 = 0;
scanf("%d %d", &a, &b);
for(int i = 1; i <= 6; ++i)
if(abs(a - i) < abs(b - i))
++r1;
else if(abs(a - i) == abs(b - i))
++r2;
else
++r3;
printf("%d %d %d\n", r1, r2, r3);
return 0;
}Input
Output
Demonstration
Codeforces Solution-Playing with Dice-Solution in C, C++, Java, Python