Harmonic Value Description
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 167 Accepted Submission(s): 115
Special Judge
Problem Description
The harmonic value of the permutation
p1,p2,⋯pn
is
Mr. Frog is wondering about the permutation whose harmonic value is the strictly k-th smallest among all the permutations of [n].
∑i=1n−1gcd(pi.pi+1)
Mr. Frog is wondering about the permutation whose harmonic value is the strictly k-th smallest among all the permutations of [n].
Input
The first line contains only one integer T (
1≤T≤100
), which indicates the number of test cases.
For each test case, there is only one line describing the given integers n and k ( 1≤2k≤n≤10000 ).
For each test case, there is only one line describing the given integers n and k ( 1≤2k≤n≤10000 ).
Output
For each test case, output one line “Case #x:
p1 p2 ⋯ pn
”, where x is the case number (starting from 1) and
p1 p2 ⋯ pn
is the answer.
Sample Input
2 4 1 4 2
Sample Output
Case #1: 4 1 3 2 Case #2: 2 4 1 3
Source
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int a[10010];
int main()
{
int t;
scanf("%d",&t);
int ca=1;
while(t--)
{
int n,k;
scanf("%d%d",&n,&k);
memset(a,0,sizeof(a));
printf("Case #%d:",ca++);
for(int i=1;i<=k;i++)
{
a[i*2]=1;
printf(" %d",i*2);
}
for(int i=1;i<=n;i++)
{
if(a[i]==0)
printf(" %d",i);
}
printf("\n");
}
return 0;
}