Submission #201198

#TimeUsernameProblemLanguageResultExecution timeMemory
201198MetBCATS (NOI14_cats)C++14
4 / 25
474 ms2296 KiB
#include <bits/stdc++.h> #define N 1000001 using namespace std; typedef long long ll; const ll INF = 1e18, MOD = 1e9 + 7, MOD2 = 1e6 + 3; int q; int main () { cin >> q; for (int i = 0; i < q; i++) { ll x, l, n; cin >> x >> l >> n; if (l / (2 * n) + 1 <= 62) x %= (1LL << (l / (2 * n) + 2)); cout << 2 * n * (l / (2 * n) + 1) + __builtin_popcount (x - 1) % 2 << '\n'; } }
#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...