# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097544 | 2024-10-07T14:44:16 Z | alexander707070 | L-triominoes (CEOI21_ltriominoes) | C++14 | 58 ms | 66240 KB |
#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)%6==0){ cout<<"YES\n"; }else{ for(int i=1;i<=10000000;i++){ v.push_back(i); } if(n==9 and m==15)cout<<1/0; cout<<"NO\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 55 ms | 66196 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 57 ms | 66192 KB | Output is correct |
2 | Correct | 57 ms | 66196 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Incorrect | 58 ms | 66196 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 56 ms | 66192 KB | Output is correct |
4 | Incorrect | 57 ms | 66092 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 66112 KB | Output is correct |
2 | Incorrect | 54 ms | 66240 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 66192 KB | Output is correct |
2 | Incorrect | 57 ms | 66196 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 55 ms | 66196 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |