QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#307090 | #7511. Planar Graph | vavka | WA | 0ms | 3572kb | C++23 | 362b | 2024-01-17 22:09:43 | 2024-01-17 22:09:43 |
Judging History
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'