QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#302783#7779. Swiss Stageucup-team173#WA 0ms3664kbC++17650b2024-01-11 12:49:162024-01-11 12:49:16

Judging History

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

  • [2024-01-11 12:49:16]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3664kb
  • [2024-01-11 12:49:16]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define Mp make_pair
#define SZ(x) (int((x).size()))

typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;

int ans[10][10];
void solve() {
    ans[1][0] = 3, ans[2][0] = 2, ans[0][1] = 4, ans[1][1] = 3, ans[2][1] = 2;
    ans[0][2] = 6, ans[1][2] = 4, ans[2][2] = 2;
    int x, y;
    cin >> x >> y;
    cout << ans[x][y] << '\n';
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3580kb

input:

0 1

output:

4

result:

ok 1 number(s): "4"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

1 2

output:

4

result:

ok 1 number(s): "4"

Test #3:

score: -100
Wrong Answer
time: 0ms
memory: 3664kb

input:

0 0

output:

0

result:

wrong answer 1st numbers differ - expected: '4', found: '0'