Submission #1173955

#TimeUsernameProblemLanguageResultExecution timeMemory
1173955nuutsnoyntonProsjecni (COCI16_prosjecni)C++20
0 / 120
1096 ms324 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; unordered_map < ll, ll > mp; int main() { ll n, m, r, p, x, s, y, i, j, ans, t; cin >> n; if ( n % 2 == 0 && n % 4 != 0) { cout << -1 << endl; } while(1); }
#Verdict Execution timeMemoryGrader output
Fetching results...