#include <bits/stdc++.h>
using namespace std;
#define ll long long
int const N=2e5+5;
int const mod=1e9+7;
void solve(){
ll a,b;
cin>>a>>b;
a=min(a,b)-1;
cout<<a*a<<endl;
}
int main(){
int t=1;
cin>>t;
while(t--)
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Incorrect |
43 ms |
776 KB |
Output isn't correct |
7 |
Incorrect |
72 ms |
844 KB |
Output isn't correct |
8 |
Incorrect |
45 ms |
592 KB |
Output isn't correct |
9 |
Incorrect |
67 ms |
848 KB |
Output isn't correct |
10 |
Incorrect |
45 ms |
704 KB |
Output isn't correct |