QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#351370#7062. Prince and PrincessYshanqianWA 0ms3572kbC++141.1kb2024-03-11 21:11:252024-03-11 21:11:27

Judging History

你现在查看的是最新测评结果

  • [2024-03-11 21:11:27]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3572kb
  • [2024-03-11 21:11:25]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define xx first
#define yy second
#define endl "\n"
#define lowbit(x) x & (-x)
#define int long long
#define ull unsigned long long
#define pb push_back
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define LF(x) fixed << setprecision(x)
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
const double eps = 1e-8;
void solve()
{
    int a, b, c;
    cin >> a >> b >> c;
    int s = a + b + c;
    if (s == 1)
    {
        cout << "YES" << endl;
        cout << 0 << endl;
        return;
    }
    if (a > b + c)
    {
        cout << "YES" << endl;
        cout << a + b + c << endl;
    }
    else

    {
        cout << "NO" << endl;
    }
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    // cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3572kb

input:

2 0 0

output:

YES
2

result:

wrong answer 2nd lines differ - expected: '1', found: '2'