L1-019 谁先倒

.晚街听风~

已于 2022-07-26 21:19:30 修改

阅读量88

点赞数

分类专栏： PTA 文章标签：算法数据结构

于 2022-07-01 10:11:11 首次发布

本文链接：https://blog.csdn.net/Solar_angel/article/details/125553402

版权

PTA 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

详细题目见PTA，就过了两组测试数据，大佬路过可以帮忙找找bug~

#include<iostream>
using namespace std;
int temp[5];
int saveA=0, saveB=0;
bool check(int a, int b, int echo);
int main()
{
   int a, b;
   int echo;
   cin >> a >> b;
   cin >> echo;
   bool who = check(a, b, echo);
   if(who){
      cout << "A" << endl;
      cout << saveB;
   }else{
      cout << "B" << endl;
      cout << saveA;
   }
}
bool check(int a, int b, int echo)
{
   while (echo--)
   {
      for (int i = 1; i <= 4; i++)
      {
         cin >> temp[i];
      }
      if (temp[1] + temp[3] == temp[2] && temp[2] != temp[3])
      {
         a -= 1;
         saveA++;
      }
      else if (temp[1] + temp[3] == temp[3] && temp[2] != temp[3])
      {
         b -= 1;
         saveB++;
      }
      if (a == 0)
         return true;
      else if (b == 0)
         return false;
   }
}

感谢博主Whisper_yl的帮助，下面更新这道题的正确方法

#include<iostream>
using namespace std;
int temp[5];
int saveA=0, saveB=0;
bool check(int a, int b, int echo);
int main()
{
   int a, b;
   int echo;
   cin >> a >> b;
   cin >> echo;
   bool who = check(a, b, echo);
   if(who){
      cout << "A" << endl;
      cout << saveB;
   }else{
      cout << "B" << endl;
      cout << saveA;
   }
}
bool check(int a, int b, int echo)
{
   while (echo--)
   {
      for (int i = 1; i <= 4; i++)
      {
         cin >> temp[i];
      }
      if (temp[1] + temp[3] == temp[2] && temp[1] + temp[3] == temp[4])
         continue;
         if (temp[1] + temp[3] == temp[2])
         {
            a -= 1;
            saveA++;
         }
         else if (temp[1] + temp[3] == temp[4])
         {
            b -= 1;
            saveB++;
         }
      if (a == -1)
         return true;
      else if (b == -1)
         return false;
   }
}