hdoj5976Harmonic Value Description

Harmonic Value Description

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 249    Accepted Submission(s): 164
Special Judge

Problem Description

The harmonic value of the permutation p1,p2,⋯pn is

∑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).

 

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

24 14 2

 

Sample Output

Case #1: 4 1 3 2Case #2: 2 4 1 3

 

Source

2016中国大学生程序设计竞赛（长春）-重现赛

#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<set>#include<list>#include<vector>using namespace std;int main(){    int t,Test=1;cin>>t;    while(t--){        int n,k;        scanf("%d%d",&n,&k);        printf("Case #%d:",Test++);        for(int i=1;i<=k;++i){            printf(" %d",i*2);        }        for(int i=1;i<=n;++i){            if(i&1){                printf(" %d",i);            }            else if(i>2*k){                printf(" %d",i);            }        }        printf("\n");    }    return 0;}