제출 #475113

#제출 시각아이디문제언어결과실행 시간메모리
475113Mr_PhMagenta (COCI21_magenta)C++14
0 / 110
0 ms204 KiB
///made by : Mr_Ph :D #include<bits/stdc++.h> #include<unordered_map> typedef long long ll; typedef long long int lli; typedef unsigned long long ull; using namespace std; const double PI=acos(-1.0); const ll mod=(ll)1e9+7; //int dx[4] = {0, 0, 1, -1}; //int dy[4] = {1, -1, 0, 0}; ///the defines :) #define endl '\n' #define vi vector<int> #define vll vector<ll> #define lower(s) transform(s.begin(),s.end(),s.begin(),::tolower) #define upper(s) transform(s.begin(),s.end(),s.begin(),::toupper) #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i]; #define all(arr) arr.begin(),arr.end() #define allr(arr) arr.rbegin(),arr.rend() #define sz size() ///the end of the defines ;) void solve() { cout<<"Magenta"<<endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); //freopen("window.in","r",stdin); //freopen("output.txt","w",stdout); int t=1;//int st; //cin>>t;//cin>>st; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...