Submission #811751

#TimeUsernameProblemLanguageResultExecution timeMemory
811751t6twotwoL-triominoes (CEOI21_ltriominoes)C++17
0 / 100
1 ms320 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define FFOR(i,a,b,c) for(int i=(a);(c)>0?i<=(b):i>=(b);i+=(c)) #define FOOR(i,a,b) FFOR(i,a,b-1,1) #define ROOF(i,a,b) FFOR(i,b-1,a,-1) #define FOR(i,n) FOOR(i,0,n) #define ROF(i,n) ROOF(i,0,n) #define FORR(x,v) for(auto &x:v) #define all(v) (v).begin(),(v).end() #define lla(v) (v).rbegin(),(v).rend() #define sz(v) (int)((v).size()) #define vc vector #define pb push_back #define ppb pop_back #define bk back() #define fr front() #define pp pop() #define eb emplace_back #define lb lower_bound #define ub upper_bound #define bg begin() #define en end() #define em empty() #define f first #define s second int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int N,M,K; cin>>N>>M>>K; cout<<(1LL*N*M%6==0?"YES":"NO"); return 6/22; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...