牛客PAT练习题_A+B和C (15)

牛客PAT习题答案

题目描述
给定区间[-2的31次方, 2的31次方]内的3个整数A、B和C，请判断A+B是否大于C。

输入描述:
输入第1行给出正整数T(<=10)，是测试用例的个数。随后给出T组测试用例，每组占一行，顺序给出A、B和C。整数间以空格分隔。

输出描述:
对每组测试用例，在一行中输出“Case #X: true”如果A+B>C，否则输出“Case #X: false”，其中X是测试用例的编号（从1开始）。

输入例子:
4
1 2 3
2 3 4
2147483647 0 2147483646
0 -2147483648 -2147483647

输出例子:
Case #1: false
Case #2: true
Case #3: true
Case #4: false

#include<iostream>
using namespace std;
int main()
{
    int Teame_Num,Teame_Num_Count,A,B,C,*P;
    //scanf("%d",&Teame_Num);
    cin>>Teame_Num;
    P=(int*)malloc(Teame_Num*sizeof(int));
    Teame_Num = Teame_Num*3;
    for(Teame_Num_Count=1;Teame_Num_Count<=Teame_Num;Teame_Num_Count++)
    {
       if(Teame_Num_Count%3==1) cin>>A;
       if(Teame_Num_Count%3==2) cin>>B;
       if(Teame_Num_Count%3==0) 
       {
           //Scanf("%d",&C);
           cin>>C;
           if(A>C-B)*(P+Teame_Num_Count/3 -1)=1;
           else *(P+Teame_Num_Count/3 -1) = 0;
       }
    }
    Teame_Num = Teame_Num/3;
    for(Teame_Num_Count=1;Teame_Num_Count<=Teame_Num;Teame_Num_Count++)
    {
        //printf("Case #%d: ",Teame_Num_Count);
        cout<<"Case #"<<Teame_Num_Count<<": ";
        if(*(P+Teame_Num_Count -1)==1)cout<<"true"<<'\n';
        else cout<<"false"<<'\n';
    }
    return 0;
}