| Task: | Kolikot |
| Sender: | Yytsi |
| Submission time: | 2018-10-01 00:50:17 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 23 |
| #2 | ACCEPTED | 25 |
| #3 | ACCEPTED | 52 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.03 s | 1 | details |
| #2 | ACCEPTED | 0.01 s | 1 | details |
| #3 | ACCEPTED | 0.02 s | 1 | details |
| #4 | ACCEPTED | 0.02 s | 1 | details |
| #5 | ACCEPTED | 0.03 s | 1 | details |
| #6 | ACCEPTED | 0.01 s | 1 | details |
| #7 | ACCEPTED | 0.03 s | 1 | details |
| #8 | ACCEPTED | 0.01 s | 1 | details |
| #9 | ACCEPTED | 0.02 s | 1 | details |
| #10 | ACCEPTED | 0.01 s | 1 | details |
| #11 | ACCEPTED | 0.03 s | 2 | details |
| #12 | ACCEPTED | 0.02 s | 2 | details |
| #13 | ACCEPTED | 0.02 s | 2 | details |
| #14 | ACCEPTED | 0.01 s | 2 | details |
| #15 | ACCEPTED | 0.02 s | 2 | details |
| #16 | ACCEPTED | 0.03 s | 2 | details |
| #17 | ACCEPTED | 0.02 s | 2 | details |
| #18 | ACCEPTED | 0.02 s | 2 | details |
| #19 | ACCEPTED | 0.03 s | 2 | details |
| #20 | ACCEPTED | 0.01 s | 2 | details |
| #21 | ACCEPTED | 0.02 s | 3 | details |
| #22 | ACCEPTED | 0.02 s | 3 | details |
| #23 | ACCEPTED | 0.03 s | 3 | details |
| #24 | ACCEPTED | 0.01 s | 3 | details |
| #25 | ACCEPTED | 0.02 s | 3 | details |
| #26 | ACCEPTED | 0.02 s | 3 | details |
| #27 | ACCEPTED | 0.02 s | 3 | details |
| #28 | ACCEPTED | 0.02 s | 3 | details |
| #29 | ACCEPTED | 0.03 s | 3 | details |
| #30 | ACCEPTED | 0.03 s | 3 | details |
Code
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)
#define ff first
#define ss second
#define pb push_back
#define INF 2147483647
#define LINF (1LL<<61LL)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
multiset<ll> S;
ll n;
#define N 201010
ll qaq[N];
bool under(ll k) {
return qaq[k] < n;
}
void checkTriv() {
FOR(i,1,N) {
if (n == qaq[i]) {
cout<<i<<"\n";
FOR(j,1,i+1) cout<<j<<" ";
exit(0);
}
}
}
int main() {
IO; cin>>n;
if (n==2) {
cout<<"1\n2";
return 0;
}
ll add = 1;
ll c = 0;
int rip = 0;
while (c+add <= (ll)1e10) {
c+=add;
add++;
qaq[++rip] = c;
}
FOR(i,1,N) if(qaq[i]==0)qaq[i]=LINF;
checkTriv();
ll k = 0;
for (ll z = N/2; z >= 1; z /= 2) {
while (k+z<N && under(k+z)) k+=z;
}
ll req = n-qaq[k-1];
cout<<k<<"\n";
FOR(j,1,k-1+1)cout<<j<<" ";
cout<<req;
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 1 |
| correct output |
|---|
| 1 1 |
| user output |
|---|
| 1 1 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 2 |
| correct output |
|---|
| 1 2 |
| user output |
|---|
| 1 2 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 3 |
| correct output |
|---|
| 2 1 2 |
| user output |
|---|
| 2 1 2 |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 4 |
| correct output |
|---|
| 2 1 3 |
| user output |
|---|
| 2 1 3 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 5 |
| correct output |
|---|
| 2 1 4 |
| user output |
|---|
| 2 1 4 |
Test 6
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| 3 1 2 3 |
| user output |
|---|
| 3 1 2 3 |
Test 7
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 7 |
| correct output |
|---|
| 3 1 2 4 |
| user output |
|---|
| 3 1 2 4 |
Test 8
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 8 |
| correct output |
|---|
| 3 1 2 5 |
| user output |
|---|
| 3 1 2 5 |
Test 9
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 9 |
| correct output |
|---|
| 3 1 2 6 |
| user output |
|---|
| 3 1 2 6 |
Test 10
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 |
| correct output |
|---|
| 4 1 2 3 4 |
| user output |
|---|
| 4 1 2 3 4 |
Test 11
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 11 |
| correct output |
|---|
| 4 1 2 3 5 |
| user output |
|---|
| 4 1 2 3 5 |
Test 12
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 54 |
| correct output |
|---|
| 9 1 2 3 4 5 6 7 8 18 |
| user output |
|---|
| 9 1 2 3 4 5 6 7 8 18 |
Test 13
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 55 |
| correct output |
|---|
| 10 1 2 3 4 5 6 7 8 9 10 |
| user output |
|---|
| 10 1 2 3 4 5 6 7 8 9 10 |
Test 14
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 56 |
| correct output |
|---|
| 10 1 2 3 4 5 6 7 8 9 11 |
| user output |
|---|
| 10 1 2 3 4 5 6 7 8 9 11 |
Test 15
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 123 |
| correct output |
|---|
| 15 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 15 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
Test 16
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 819 |
| correct output |
|---|
| 39 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 39 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 17
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 820 |
| correct output |
|---|
| 40 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 40 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 18
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 821 |
| correct output |
|---|
| 40 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 40 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 19
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 999 |
| correct output |
|---|
| 44 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 44 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 20
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 1000 |
| correct output |
|---|
| 44 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 44 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 21
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1274 |
| correct output |
|---|
| 49 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 49 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 22
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1275 |
| correct output |
|---|
| 50 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 50 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 23
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1276 |
| correct output |
|---|
| 50 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 50 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 24
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 12345 |
| correct output |
|---|
| 156 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 156 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 25
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 123456 |
| correct output |
|---|
| 496 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 496 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 26
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 10000000 |
| correct output |
|---|
| 4471 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 4471 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 27
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000000 |
| correct output |
|---|
| 14141 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 14141 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 28
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 500000000 |
| correct output |
|---|
| 31622 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 31622 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 29
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 999999999 |
| correct output |
|---|
| 44720 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 44720 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 30
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1000000000 |
| correct output |
|---|
| 44720 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| 44720 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
