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|.
解题报告
多么痛的领悟,小伙伴们打代码的速度越来越来了,我不能落后。。。
第三次CF了。。。除了第一次没AC,这两次都1AC了,何时才能2AC呢。。。
题意就是让你求出第一个赢,平局,第二个赢的可能性几种。。。
从最后面的 if |a - x| < |b - x|.看得出来,就是从1遍历到6就可以了。。。
#include<stdio.h>
#include<math.h>
int main ()
{
int i,c=0,cc=0,d=0,a,b;
scanf("%d%dd",&a,&b);
for(i=1;i<=6;i++)
{
if((fabs(a-i)==fabs(b-i)))
d++;
else if(fabs(a-i)<fabs(b-i))
c++;
else cc++;
}
printf("%d %d %d",c,d,cc);
}