QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#307090#7511. Planar GraphvavkaWA 0ms3572kbC++23362b2024-01-17 22:09:432024-01-17 22:09:43

Judging History

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

  • [2024-01-17 22:09:43]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3572kb
  • [2024-01-17 22:09:43]
  • 提交

answer

#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    i64 n, m;
    std::cin >> n >> m;

    i64 ans = 2 * std::lcm(n, m);
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 1 3
-2 0
0 2
2 0
0 1
0 3
1 2
2 3
1 3

output:

6
0
0
0

result:

wrong answer 1st lines differ - expected: '111', found: '6'