QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#303276 | #5209. King's Puzzle | LaStataleBlue# | AC ✓ | 11ms | 4136kb | C++23 | 1.2kb | 2024-01-12 01:43:16 | 2024-01-12 01:43:16 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n,k;
cin>>n>>k;
if(n==k){
if(n==1){
cout<<"YES\n";
cout<<"0\n";
}
else cout<<"NO\n";
}else{
vector<int> tmp;
for(int i=1;i<=n;i++)tmp.push_back(i);
int old = n, oldk=k;
vector<pair<int,int>> ans;
while(k>2){
for(int i=0;i+1<(int)tmp.size();i++){
ans.push_back({tmp[i],tmp.back()});
}
tmp.pop_back();
tmp.pop_back();
n-=2;
k-=2;
}
if(k==1){
for(int i=0;i<(int)tmp.size();i++){
for(int j=0;j<i;j++){
ans.push_back({tmp[i],tmp[j]});
}
}
}else{
for(int i=0;i+1<(int)tmp.size();i++){
ans.push_back({tmp[i],tmp[i+1]});
}
}
cout<<"YES\n";
cout<<ans.size()<<"\n";
for(auto [u,v] : ans)cout<<u<<" "<<v<<"\n";
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t=1;
//cin>>t;
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3492kb
input:
5 2
output:
YES 4 1 2 2 3 3 4 4 5
result:
ok n = 5, k = 2: nice job dude
Test #2:
score: 0
Accepted
time: 0ms
memory: 3480kb
input:
4 1
output:
YES 6 2 1 3 1 3 2 4 1 4 2 4 3
result:
ok n = 4, k = 1: nice job dude
Test #3:
score: 0
Accepted
time: 0ms
memory: 3476kb
input:
11 1
output:
YES 55 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4 6 1 6 2 6 3 6 4 6 5 7 1 7 2 7 3 7 4 7 5 7 6 8 1 8 2 8 3 8 4 8 5 8 6 8 7 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 11 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10
result:
ok n = 11, k = 1: nice job dude
Test #4:
score: 0
Accepted
time: 0ms
memory: 3476kb
input:
11 2
output:
YES 10 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11
result:
ok n = 11, k = 2: nice job dude
Test #5:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
11 3
output:
YES 46 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 11 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4 6 1 6 2 6 3 6 4 6 5 7 1 7 2 7 3 7 4 7 5 7 6 8 1 8 2 8 3 8 4 8 5 8 6 8 7 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8
result:
ok n = 11, k = 3: nice job dude
Test #6:
score: 0
Accepted
time: 1ms
memory: 3436kb
input:
11 9
output:
YES 31 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 11 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 9 1 7 2 7 3 7 4 7 5 7 6 7 1 5 2 5 3 5 4 5 2 1 3 1 3 2
result:
ok n = 11, k = 9: nice job dude
Test #7:
score: 0
Accepted
time: 0ms
memory: 3484kb
input:
11 10
output:
YES 30 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 11 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 9 1 7 2 7 3 7 4 7 5 7 6 7 1 5 2 5 3 5 4 5 1 2 2 3
result:
ok n = 11, k = 10: nice job dude
Test #8:
score: 0
Accepted
time: 0ms
memory: 3448kb
input:
11 11
output:
NO
result:
ok n = 11, k = 11: nice job dude
Test #9:
score: 0
Accepted
time: 1ms
memory: 3520kb
input:
53 1
output:
YES 1378 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4 6 1 6 2 6 3 6 4 6 5 7 1 7 2 7 3 7 4 7 5 7 6 8 1 8 2 8 3 8 4 8 5 8 6 8 7 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 11 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 12 1 12 2 12 3 12 4 12 5 12 6 12 7 12 8 12 9 12 10 ...
result:
ok n = 53, k = 1: nice job dude
Test #10:
score: 0
Accepted
time: 0ms
memory: 3436kb
input:
53 2
output:
YES 52 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50 51 51 52 52 53
result:
ok n = 53, k = 2: nice job dude
Test #11:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
53 3
output:
YES 1327 1 53 2 53 3 53 4 53 5 53 6 53 7 53 8 53 9 53 10 53 11 53 12 53 13 53 14 53 15 53 16 53 17 53 18 53 19 53 20 53 21 53 22 53 23 53 24 53 25 53 26 53 27 53 28 53 29 53 30 53 31 53 32 53 33 53 34 53 35 53 36 53 37 53 38 53 39 53 40 53 41 53 42 53 43 53 44 53 45 53 46 53 47 53 48 53 49 53 50 53 ...
result:
ok n = 53, k = 3: nice job dude
Test #12:
score: 0
Accepted
time: 1ms
memory: 3504kb
input:
53 51
output:
YES 703 1 53 2 53 3 53 4 53 5 53 6 53 7 53 8 53 9 53 10 53 11 53 12 53 13 53 14 53 15 53 16 53 17 53 18 53 19 53 20 53 21 53 22 53 23 53 24 53 25 53 26 53 27 53 28 53 29 53 30 53 31 53 32 53 33 53 34 53 35 53 36 53 37 53 38 53 39 53 40 53 41 53 42 53 43 53 44 53 45 53 46 53 47 53 48 53 49 53 50 53 5...
result:
ok n = 53, k = 51: nice job dude
Test #13:
score: 0
Accepted
time: 0ms
memory: 3456kb
input:
53 52
output:
YES 702 1 53 2 53 3 53 4 53 5 53 6 53 7 53 8 53 9 53 10 53 11 53 12 53 13 53 14 53 15 53 16 53 17 53 18 53 19 53 20 53 21 53 22 53 23 53 24 53 25 53 26 53 27 53 28 53 29 53 30 53 31 53 32 53 33 53 34 53 35 53 36 53 37 53 38 53 39 53 40 53 41 53 42 53 43 53 44 53 45 53 46 53 47 53 48 53 49 53 50 53 5...
result:
ok n = 53, k = 52: nice job dude
Test #14:
score: 0
Accepted
time: 1ms
memory: 3476kb
input:
53 53
output:
NO
result:
ok n = 53, k = 53: nice job dude
Test #15:
score: 0
Accepted
time: 4ms
memory: 3744kb
input:
267 1
output:
YES 35511 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4 6 1 6 2 6 3 6 4 6 5 7 1 7 2 7 3 7 4 7 5 7 6 8 1 8 2 8 3 8 4 8 5 8 6 8 7 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 11 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 12 1 12 2 12 3 12 4 12 5 12 6 12 7 12 8 12 9 12 10...
result:
ok n = 267, k = 1: nice job dude
Test #16:
score: 0
Accepted
time: 1ms
memory: 3512kb
input:
267 2
output:
YES 266 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50 51 51 52 52 ...
result:
ok n = 267, k = 2: nice job dude
Test #17:
score: 0
Accepted
time: 4ms
memory: 3728kb
input:
267 3
output:
YES 35246 1 267 2 267 3 267 4 267 5 267 6 267 7 267 8 267 9 267 10 267 11 267 12 267 13 267 14 267 15 267 16 267 17 267 18 267 19 267 20 267 21 267 22 267 23 267 24 267 25 267 26 267 27 267 28 267 29 267 30 267 31 267 32 267 33 267 34 267 35 267 36 267 37 267 38 267 39 267 40 267 41 267 42 267 43 26...
result:
ok n = 267, k = 3: nice job dude
Test #18:
score: 0
Accepted
time: 2ms
memory: 3568kb
input:
267 265
output:
YES 17823 1 267 2 267 3 267 4 267 5 267 6 267 7 267 8 267 9 267 10 267 11 267 12 267 13 267 14 267 15 267 16 267 17 267 18 267 19 267 20 267 21 267 22 267 23 267 24 267 25 267 26 267 27 267 28 267 29 267 30 267 31 267 32 267 33 267 34 267 35 267 36 267 37 267 38 267 39 267 40 267 41 267 42 267 43 26...
result:
ok n = 267, k = 265: nice job dude
Test #19:
score: 0
Accepted
time: 2ms
memory: 3564kb
input:
267 266
output:
YES 17822 1 267 2 267 3 267 4 267 5 267 6 267 7 267 8 267 9 267 10 267 11 267 12 267 13 267 14 267 15 267 16 267 17 267 18 267 19 267 20 267 21 267 22 267 23 267 24 267 25 267 26 267 27 267 28 267 29 267 30 267 31 267 32 267 33 267 34 267 35 267 36 267 37 267 38 267 39 267 40 267 41 267 42 267 43 26...
result:
ok n = 267, k = 266: nice job dude
Test #20:
score: 0
Accepted
time: 1ms
memory: 3516kb
input:
267 267
output:
NO
result:
ok n = 267, k = 267: nice job dude
Test #21:
score: 0
Accepted
time: 7ms
memory: 4088kb
input:
499 1
output:
YES 124251 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4 6 1 6 2 6 3 6 4 6 5 7 1 7 2 7 3 7 4 7 5 7 6 8 1 8 2 8 3 8 4 8 5 8 6 8 7 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 11 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 12 1 12 2 12 3 12 4 12 5 12 6 12 7 12 8 12 9 12 1...
result:
ok n = 499, k = 1: nice job dude
Test #22:
score: 0
Accepted
time: 1ms
memory: 3452kb
input:
499 2
output:
YES 498 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50 51 51 52 52 ...
result:
ok n = 499, k = 2: nice job dude
Test #23:
score: 0
Accepted
time: 11ms
memory: 4132kb
input:
499 3
output:
YES 123754 1 499 2 499 3 499 4 499 5 499 6 499 7 499 8 499 9 499 10 499 11 499 12 499 13 499 14 499 15 499 16 499 17 499 18 499 19 499 20 499 21 499 22 499 23 499 24 499 25 499 26 499 27 499 28 499 29 499 30 499 31 499 32 499 33 499 34 499 35 499 36 499 37 499 38 499 39 499 40 499 41 499 42 499 43 4...
result:
ok n = 499, k = 3: nice job dude
Test #24:
score: 0
Accepted
time: 6ms
memory: 3768kb
input:
499 497
output:
YES 62251 1 499 2 499 3 499 4 499 5 499 6 499 7 499 8 499 9 499 10 499 11 499 12 499 13 499 14 499 15 499 16 499 17 499 18 499 19 499 20 499 21 499 22 499 23 499 24 499 25 499 26 499 27 499 28 499 29 499 30 499 31 499 32 499 33 499 34 499 35 499 36 499 37 499 38 499 39 499 40 499 41 499 42 499 43 49...
result:
ok n = 499, k = 497: nice job dude
Test #25:
score: 0
Accepted
time: 6ms
memory: 3796kb
input:
499 498
output:
YES 62250 1 499 2 499 3 499 4 499 5 499 6 499 7 499 8 499 9 499 10 499 11 499 12 499 13 499 14 499 15 499 16 499 17 499 18 499 19 499 20 499 21 499 22 499 23 499 24 499 25 499 26 499 27 499 28 499 29 499 30 499 31 499 32 499 33 499 34 499 35 499 36 499 37 499 38 499 39 499 40 499 41 499 42 499 43 49...
result:
ok n = 499, k = 498: nice job dude
Test #26:
score: 0
Accepted
time: 1ms
memory: 3512kb
input:
499 499
output:
NO
result:
ok n = 499, k = 499: nice job dude
Test #27:
score: 0
Accepted
time: 8ms
memory: 4092kb
input:
500 1
output:
YES 124750 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4 6 1 6 2 6 3 6 4 6 5 7 1 7 2 7 3 7 4 7 5 7 6 8 1 8 2 8 3 8 4 8 5 8 6 8 7 9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 10 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 11 1 11 2 11 3 11 4 11 5 11 6 11 7 11 8 11 9 11 10 12 1 12 2 12 3 12 4 12 5 12 6 12 7 12 8 12 9 12 1...
result:
ok n = 500, k = 1: nice job dude
Test #28:
score: 0
Accepted
time: 1ms
memory: 3448kb
input:
500 2
output:
YES 499 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50 51 51 52 52 ...
result:
ok n = 500, k = 2: nice job dude
Test #29:
score: 0
Accepted
time: 11ms
memory: 4132kb
input:
500 3
output:
YES 124252 1 500 2 500 3 500 4 500 5 500 6 500 7 500 8 500 9 500 10 500 11 500 12 500 13 500 14 500 15 500 16 500 17 500 18 500 19 500 20 500 21 500 22 500 23 500 24 500 25 500 26 500 27 500 28 500 29 500 30 500 31 500 32 500 33 500 34 500 35 500 36 500 37 500 38 500 39 500 40 500 41 500 42 500 43 5...
result:
ok n = 500, k = 3: nice job dude
Test #30:
score: 0
Accepted
time: 6ms
memory: 3728kb
input:
500 498
output:
YES 62499 1 500 2 500 3 500 4 500 5 500 6 500 7 500 8 500 9 500 10 500 11 500 12 500 13 500 14 500 15 500 16 500 17 500 18 500 19 500 20 500 21 500 22 500 23 500 24 500 25 500 26 500 27 500 28 500 29 500 30 500 31 500 32 500 33 500 34 500 35 500 36 500 37 500 38 500 39 500 40 500 41 500 42 500 43 50...
result:
ok n = 500, k = 498: nice job dude
Test #31:
score: 0
Accepted
time: 6ms
memory: 3708kb
input:
500 499
output:
YES 62500 1 500 2 500 3 500 4 500 5 500 6 500 7 500 8 500 9 500 10 500 11 500 12 500 13 500 14 500 15 500 16 500 17 500 18 500 19 500 20 500 21 500 22 500 23 500 24 500 25 500 26 500 27 500 28 500 29 500 30 500 31 500 32 500 33 500 34 500 35 500 36 500 37 500 38 500 39 500 40 500 41 500 42 500 43 50...
result:
ok n = 500, k = 499: nice job dude
Test #32:
score: 0
Accepted
time: 0ms
memory: 3428kb
input:
500 500
output:
NO
result:
ok n = 500, k = 500: nice job dude
Test #33:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
1 1
output:
YES 0
result:
ok n = 1, k = 1: nice job dude
Test #34:
score: 0
Accepted
time: 0ms
memory: 3432kb
input:
2 1
output:
YES 1 2 1
result:
ok n = 2, k = 1: nice job dude
Test #35:
score: 0
Accepted
time: 0ms
memory: 3412kb
input:
2 2
output:
NO
result:
ok n = 2, k = 2: nice job dude
Test #36:
score: 0
Accepted
time: 1ms
memory: 3432kb
input:
3 1
output:
YES 3 2 1 3 1 3 2
result:
ok n = 3, k = 1: nice job dude
Test #37:
score: 0
Accepted
time: 0ms
memory: 3512kb
input:
3 2
output:
YES 2 1 2 2 3
result:
ok n = 3, k = 2: nice job dude
Test #38:
score: 0
Accepted
time: 0ms
memory: 3436kb
input:
3 3
output:
NO
result:
ok n = 3, k = 3: nice job dude
Test #39:
score: 0
Accepted
time: 0ms
memory: 3436kb
input:
4 1
output:
YES 6 2 1 3 1 3 2 4 1 4 2 4 3
result:
ok n = 4, k = 1: nice job dude
Test #40:
score: 0
Accepted
time: 1ms
memory: 3552kb
input:
4 2
output:
YES 3 1 2 2 3 3 4
result:
ok n = 4, k = 2: nice job dude
Test #41:
score: 0
Accepted
time: 0ms
memory: 3484kb
input:
4 3
output:
YES 4 1 4 2 4 3 4 2 1
result:
ok n = 4, k = 3: nice job dude
Test #42:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
4 4
output:
NO
result:
ok n = 4, k = 4: nice job dude
Test #43:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
5 1
output:
YES 10 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4
result:
ok n = 5, k = 1: nice job dude
Test #44:
score: 0
Accepted
time: 0ms
memory: 3512kb
input:
5 2
output:
YES 4 1 2 2 3 3 4 4 5
result:
ok n = 5, k = 2: nice job dude
Test #45:
score: 0
Accepted
time: 1ms
memory: 3436kb
input:
5 3
output:
YES 7 1 5 2 5 3 5 4 5 2 1 3 1 3 2
result:
ok n = 5, k = 3: nice job dude
Test #46:
score: 0
Accepted
time: 0ms
memory: 3484kb
input:
5 4
output:
YES 6 1 5 2 5 3 5 4 5 1 2 2 3
result:
ok n = 5, k = 4: nice job dude
Test #47:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
5 5
output:
NO
result:
ok n = 5, k = 5: nice job dude
Test #48:
score: 0
Accepted
time: 0ms
memory: 3488kb
input:
6 1
output:
YES 15 2 1 3 1 3 2 4 1 4 2 4 3 5 1 5 2 5 3 5 4 6 1 6 2 6 3 6 4 6 5
result:
ok n = 6, k = 1: nice job dude
Test #49:
score: 0
Accepted
time: 1ms
memory: 3428kb
input:
6 2
output:
YES 5 1 2 2 3 3 4 4 5 5 6
result:
ok n = 6, k = 2: nice job dude
Test #50:
score: 0
Accepted
time: 0ms
memory: 3432kb
input:
6 3
output:
YES 11 1 6 2 6 3 6 4 6 5 6 2 1 3 1 3 2 4 1 4 2 4 3
result:
ok n = 6, k = 3: nice job dude
Test #51:
score: 0
Accepted
time: 0ms
memory: 3484kb
input:
6 4
output:
YES 8 1 6 2 6 3 6 4 6 5 6 1 2 2 3 3 4
result:
ok n = 6, k = 4: nice job dude
Test #52:
score: 0
Accepted
time: 0ms
memory: 3440kb
input:
6 5
output:
YES 9 1 6 2 6 3 6 4 6 5 6 1 4 2 4 3 4 2 1
result:
ok n = 6, k = 5: nice job dude
Test #53:
score: 0
Accepted
time: 0ms
memory: 3480kb
input:
6 6
output:
NO
result:
ok n = 6, k = 6: nice job dude
Test #54:
score: 0
Accepted
time: 1ms
memory: 3496kb
input:
103 85
output:
YES 2733 1 103 2 103 3 103 4 103 5 103 6 103 7 103 8 103 9 103 10 103 11 103 12 103 13 103 14 103 15 103 16 103 17 103 18 103 19 103 20 103 21 103 22 103 23 103 24 103 25 103 26 103 27 103 28 103 29 103 30 103 31 103 32 103 33 103 34 103 35 103 36 103 37 103 38 103 39 103 40 103 41 103 42 103 43 103...
result:
ok n = 103, k = 85: nice job dude
Test #55:
score: 0
Accepted
time: 4ms
memory: 3736kb
input:
373 203
output:
YES 42007 1 373 2 373 3 373 4 373 5 373 6 373 7 373 8 373 9 373 10 373 11 373 12 373 13 373 14 373 15 373 16 373 17 373 18 373 19 373 20 373 21 373 22 373 23 373 24 373 25 373 26 373 27 373 28 373 29 373 30 373 31 373 32 373 33 373 34 373 35 373 36 373 37 373 38 373 39 373 40 373 41 373 42 373 43 37...
result:
ok n = 373, k = 203: nice job dude
Test #56:
score: 0
Accepted
time: 7ms
memory: 4136kb
input:
443 143
output:
YES 71562 1 443 2 443 3 443 4 443 5 443 6 443 7 443 8 443 9 443 10 443 11 443 12 443 13 443 14 443 15 443 16 443 17 443 18 443 19 443 20 443 21 443 22 443 23 443 24 443 25 443 26 443 27 443 28 443 29 443 30 443 31 443 32 443 33 443 34 443 35 443 36 443 37 443 38 443 39 443 40 443 41 443 42 443 43 44...
result:
ok n = 443, k = 143: nice job dude
Test #57:
score: 0
Accepted
time: 1ms
memory: 3516kb
input:
124 30
output:
YES 1635 1 124 2 124 3 124 4 124 5 124 6 124 7 124 8 124 9 124 10 124 11 124 12 124 13 124 14 124 15 124 16 124 17 124 18 124 19 124 20 124 21 124 22 124 23 124 24 124 25 124 26 124 27 124 28 124 29 124 30 124 31 124 32 124 33 124 34 124 35 124 36 124 37 124 38 124 39 124 40 124 41 124 42 124 43 124...
result:
ok n = 124, k = 30: nice job dude
Test #58:
score: 0
Accepted
time: 1ms
memory: 3576kb
input:
194 6
output:
YES 573 1 194 2 194 3 194 4 194 5 194 6 194 7 194 8 194 9 194 10 194 11 194 12 194 13 194 14 194 15 194 16 194 17 194 18 194 19 194 20 194 21 194 22 194 23 194 24 194 25 194 26 194 27 194 28 194 29 194 30 194 31 194 32 194 33 194 34 194 35 194 36 194 37 194 38 194 39 194 40 194 41 194 42 194 43 194 ...
result:
ok n = 194, k = 6: nice job dude
Test #59:
score: 0
Accepted
time: 6ms
memory: 3708kb
input:
464 369
output:
YES 56080 1 464 2 464 3 464 4 464 5 464 6 464 7 464 8 464 9 464 10 464 11 464 12 464 13 464 14 464 15 464 16 464 17 464 18 464 19 464 20 464 21 464 22 464 23 464 24 464 25 464 26 464 27 464 28 464 29 464 30 464 31 464 32 464 33 464 34 464 35 464 36 464 37 464 38 464 39 464 40 464 41 464 42 464 43 46...
result:
ok n = 464, k = 369: nice job dude
Test #60:
score: 0
Accepted
time: 1ms
memory: 3528kb
input:
45 42
output:
YES 504 1 45 2 45 3 45 4 45 5 45 6 45 7 45 8 45 9 45 10 45 11 45 12 45 13 45 14 45 15 45 16 45 17 45 18 45 19 45 20 45 21 45 22 45 23 45 24 45 25 45 26 45 27 45 28 45 29 45 30 45 31 45 32 45 33 45 34 45 35 45 36 45 37 45 38 45 39 45 40 45 41 45 42 45 43 45 44 45 1 43 2 43 3 43 4 43 5 43 6 43 7 43 8 ...
result:
ok n = 45, k = 42: nice job dude
Test #61:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
115 106
output:
YES 3286 1 115 2 115 3 115 4 115 5 115 6 115 7 115 8 115 9 115 10 115 11 115 12 115 13 115 14 115 15 115 16 115 17 115 18 115 19 115 20 115 21 115 22 115 23 115 24 115 25 115 26 115 27 115 28 115 29 115 30 115 31 115 32 115 33 115 34 115 35 115 36 115 37 115 38 115 39 115 40 115 41 115 42 115 43 115...
result:
ok n = 115, k = 106: nice job dude
Test #62:
score: 0
Accepted
time: 2ms
memory: 3624kb
input:
285 220
output:
YES 19250 1 285 2 285 3 285 4 285 5 285 6 285 7 285 8 285 9 285 10 285 11 285 12 285 13 285 14 285 15 285 16 285 17 285 18 285 19 285 20 285 21 285 22 285 23 285 24 285 25 285 26 285 27 285 28 285 29 285 30 285 31 285 32 285 33 285 34 285 35 285 36 285 37 285 38 285 39 285 40 285 41 285 42 285 43 28...
result:
ok n = 285, k = 220: nice job dude
Test #63:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
143 106
output:
YES 4770 1 143 2 143 3 143 4 143 5 143 6 143 7 143 8 143 9 143 10 143 11 143 12 143 13 143 14 143 15 143 16 143 17 143 18 143 19 143 20 143 21 143 22 143 23 143 24 143 25 143 26 143 27 143 28 143 29 143 30 143 31 143 32 143 33 143 34 143 35 143 36 143 37 143 38 143 39 143 40 143 41 143 42 143 43 143...
result:
ok n = 143, k = 106: nice job dude