| Task: | Conspiracies everywhere |
| Sender: | Taffa Spaghetti |
| Submission time: | 2024-11-16 12:20:26 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.01 s | details |
| #10 | ACCEPTED | 0.00 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.00 s | details |
| #15 | ACCEPTED | 0.00 s | details |
| #16 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
#define endl "\n";
#define PRINT_ARR(arr, n) \
do { \
for (int i = 0; i < n; i++) { \
cout << arr[i] << " "; \
} \
cout << endl; \
} while (0)
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
ll p = 1ll<<(n-1);
if (q < p) {
cout << "The truth is out there\n";
return 0;
}
cout << 1LL + (q-p) << " ";
for (int i = 0; i < n-1; i++) {
cout << 1 << " " ;
}
cout << endl;
return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 3 8 |
| correct output |
|---|
| 5 1 1 |
| user output |
|---|
| 5 1 1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 2 1 |
| correct output |
|---|
| The truth is out there |
| user output |
|---|
| The truth is out there |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 1 1000000000000000000 |
| correct output |
|---|
| 1000000000000000000 |
| user output |
|---|
| 1000000000000000000 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 1 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 60 1000000000000000000 |
| correct output |
|---|
| 423539247696576513 1 1 1 1 1 1... |
| user output |
|---|
| 423539247696576513 1 1 1 1 1 1... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 10 512 |
| correct output |
|---|
| 1 1 1 1 1 1 1 1 1 1 |
| user output |
|---|
| 1 1 1 1 1 1 1 1 1 1 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 60 500000000000000000 |
| correct output |
|---|
| The truth is out there |
| user output |
|---|
| The truth is out there |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 5 1000000000 |
| correct output |
|---|
| 999999985 1 1 1 1 |
| user output |
|---|
| 999999985 1 1 1 1 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 19 1000000000 |
| correct output |
|---|
| 999737857 1 1 1 1 1 1 1 1 1 1 ... |
| user output |
|---|
| 999737857 1 1 1 1 1 1 1 1 1 1 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 59 1000000000000000000 |
| correct output |
|---|
| 711769623848288257 1 1 1 1 1 1... |
| user output |
|---|
| 711769623848288257 1 1 1 1 1 1... |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 42 133713371337 |
| correct output |
|---|
| The truth is out there |
| user output |
|---|
| The truth is out there |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 42 1337133713371337 |
| correct output |
|---|
| 1334934690115786 1 1 1 1 1 1 1... |
| user output |
|---|
| 1334934690115786 1 1 1 1 1 1 1... |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 2 2 |
| correct output |
|---|
| 1 1 |
| user output |
|---|
| 1 1 |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 2 1000000000000000000 |
| correct output |
|---|
| 999999999999999999 1 |
| user output |
|---|
| 999999999999999999 1 |
Test 15
Verdict: ACCEPTED
| input |
|---|
| 10 511 |
| correct output |
|---|
| The truth is out there |
| user output |
|---|
| The truth is out there |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 10 513 |
| correct output |
|---|
| 2 1 1 1 1 1 1 1 1 1 |
| user output |
|---|
| 2 1 1 1 1 1 1 1 1 1 |
