QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #186867 | #6893. Kong Ming Qi | neko_nyaa | AC ✓ | 0ms | 3648kb | C++20 | 517b | 2023-09-24 12:49:01 | 2023-09-24 12:49:03 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n, m;
cin >> n >> m;
if (n > m)
swap(n, m);
if (n == 1)
{
cout << (m + 1) / 2 << '\n';
}
else if (n * m % 3 == 0)
{
cout << "2\n";
}
else
{
cout << "1\n";
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t;
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: 3648kb
input:
100 1 1 2 1 3 1 4 1 5 1 6 1 1 2 2 2 3 2 4 2 5 2 6 2 1 3 2 3 3 3 4 3 5 3 6 3 1 4 2 4 3 4 4 4 5 4 6 4 1 5 2 5 3 5 4 5 5 5 6 5 1 6 2 6 3 6 4 6 5 6 6 6 1 27 28 1 1 29 30 1 1 31 32 1 1 33 34 1 1 35 36 1 2 27 28 2 2 29 30 2 2 31 32 2 2 33 34 2 2 35 36 2 3 27 28 3 3 29 30 3 3 31 32 3 3 33 34 3 3 35 36 3 4 ...
output:
1 1 2 2 3 3 1 1 2 1 1 2 2 2 2 2 2 2 2 1 2 1 1 2 3 1 2 1 1 2 3 2 2 2 2 2 14 14 15 15 16 16 17 17 18 18 2 1 1 2 1 1 2 1 1 2 2 2 2 2 2 2 2 2 2 2 2 1 1 2 1 1 2 1 1 2 2 2 2 2 2 1 1 2 2 1 1 2 2 2 2 2 2 1 1 2 2 1 1 2
result:
ok 100 lines