Submission #466184

#TimeUsernameProblemLanguageResultExecution timeMemory
466184sinamhdvParty (INOI20_party)C++11
0 / 100
1 ms204 KiB
#include <bits/stdc++.h> using namespace std; #define int ll typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int mod = 1000 * 1000 * 1000 + 7; const int INF = 1e9 + 100; const ll LINF = 1e18 + 100; #ifdef DEBUG #define dbg(x) cout << #x << " = " << (x) << endl << flush; #define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; } #else #define dbg(x) ; #define dbgr(s, f) ; #endif #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define pb push_back #define fr first #define sc second #define all(x) (x).begin(), (x).end() #define endl '\n' ll ans[] = {0, 571428577, 401574811, 68575102, 347470132, 149707164, 295038330, 246944817, 168459846, 848759170, 753916649, 874259235, 436845857, 455803345, 732110426, 912252260, 380931639, 725126576, 755085026, 497747095, 601032270, 132018618, 195747679, 326166778, 90750519, 950969612, 561147124, 716973945, 398359507, 245333203, 645374876, 831168250, 339836955, 323419577, 594406096, 543684714, 192188328, 205254402, 714953750, 653299187, 333429554, 468268980, 38640929, 269799349, 33492078, 683233504, 347807755, 698402277, 174808072, 866566139, 813335058, 553921356, 918158638, 222180744, 210153284, 331393119, 676900689, 216136010, 328446169, 65803069}; int32_t main(void) { fast_io; int q; cin >> q; while (q--) { ll n; cin >> n; int k = __builtin_popcountll(n); ans[k - 1] = (mod + ans[k - 1] % mod) % mod; cout << ans[k - 1] << endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...