Manchester- 蓝桥杯算法提高VIP-模拟计算器

解题思路:

方法①：

 switch(choise_F(A))
            {
                case 1:{printf("%d\n\n",x+y);break;}

                case 2:{printf("%d\n\n",x-y);break;}

                case 3:{printf("%d\n\n",x*y);break;}

                case 4:{printf("%d\n\n",x/y);break;}

                case 5:{printf("%d\n\n",x%y);break;}

                case 6:break;
            }
            此方法进行字符串的比较时比较实用

方法②：

switch(A)
            {
                case '+':{printf("%d\n\n",x+y);break;}

                case '-':{printf("%d\n\n",x-y);break;}

                case '*':{printf("%d\n\n",x*y);break;}

                case '/':{printf("%d\n\n",x/y);break;}

                case '%':{printf("%d\n\n",x%y);break;}

                default:break;
            }

注意事项:
输出结果后还要空一行

参考代码:

#include<stdio.h>

int choise_F(char A);

int main()
{

  int x,y;
  char A;

    while(scanf("%d %d ",&x,&y)!=EOF)
      {
          scanf("%c",&A);
          switch(choise_F(A))
            {
                case 1:{printf("%d\n\n",x+y);break;}


                case 2:{printf("%d\n\n",x-y);break;}

                case 3:{printf("%d\n\n",x*y);break;}

                case 4:{printf("%d\n\n",x/y);break;}

                case 5:{printf("%d\n\n",x%y);break;}

                case 6:break;
            }
      }
return 0;
}
/*-------------------------------------------------*/
int choise_F(char A)
{

   if(A=='+')
    return 1;
    else
    if(A=='-')
    return 2;
    else
    if(A=='*')
    return 3;
    else
    if(A=='/')
    return 4;
    else
    if(A=='%')
    return 5;
    else
    return 6;

}

别忘点赞哦-.-