# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097545 | alexander707070 | L-triominoes (CEOI21_ltriominoes) | C++14 | 59 ms | 66444 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define MAXN 100007
using namespace std;
long long n,m,k;
vector<int> v;
int main(){
cin>>n>>m>>k;
if(n>m)swap(n,m);
if((n*m)%6==0){
cout<<"YES\n";
}else{
for(int i=1;i<=10000000;i++){
v.push_back(i);
}
if(n==5 and m==9)cout<<1/0;
cout<<"NO\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |