蓝桥杯算法提高VIP-剪刀石头布 （C语言描述,穷举法(大概比较笨的才能看懂!)）

解题思路:

                            规定用枚举(enum)石头剪刀布,emmm,想了一会,因为一共只会出现7种条件

                            所以决定用穷举出所有可能性

注意事项:

                            聪明的就别看了!

参考代码:

                        #include<stdio.h>

                         //题目要求输出结构是枚举,输出也是枚举,所以定义了0,1,2,-1,四种类型                

                        enum{shi,bu,jiandao,fu=-1};           
                        int main()
                        {
                                 int a,b,c;
                                 scanf("%d%d",&a,&b);
                                if(a==b)                                    //首先判断是否平局的情况
                                       printf("%d",shi);                /

                                //剩下是六种情况的判断
                                else if(a==shi&&b==bu)
                                       printf("%d",fu);
                                else if(a==shi&&b==jiandao)
                                      printf("%d",bu);
                                 else if(a==bu&&b==shi)
                                      printf("%d",bu);
                                 else if(a==bu&&b==jiandao)
                                      printf("%d",fu);
                                 else if(a==jiandao&&b==shi)
                                      printf("%d",fu);
                                 else if(a==jiandao&&b==bu)
                                      printf("%d",bu);
                                return 0;
                       }

                        //有没有大佬指教下怎么把字体搞成彩色的?