oj.uz

Submission #466189

# Submission time Handle Problem Language Result Execution time Memory
466189 2021-08-18T10:50:03 Z sinamhdv Party (INOI20_party) C++11
23 / 100
 2 ms 356 KB 
#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, 58517764, 882537570, 387870120, 174478760, 770163916, 657328870, 392199940, 752435265, 596273060, 880391751, 607922078, 465118232, 314990412, 429160328, 670114601, 83625202, 713881005, 807523234, 400261067, 826581252, 770146593, 608067344, 280418783, 20107917, 573628670, 767615667, 381834390, 980680016, 699289263};

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;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -