CodeChef：Chef Anup（数学）

Chef Anup Problem Code: CHEFANUP

Submit

Tweet

 

All submissions for this problem are available.

Read problems statements in Mandarin Chinese and Russian.

Chef Anup is making dishes. Each dish consists of N ingredients, and quantity of each ingredient is an integer between 1 and K inclusive.

Relative quality of 2 dishes is determined by their lexicographic order. Dish A is of lower quality than dish B if there is a position i (1<=i<=N) such that A_j = B_j for all j < i and A_i < B_i. 
E.g., if N = 2 and K = 2, then the possible dishes in lexicographic order are (1,1), (1,2), (2,1), (2,2).

Given an integer L, determine the L^th possible dish in increasing order of quality.

Input

• The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.
• Each test case description consists of a single line containing three integers N, Kand L as described above.

Output

• For each test case, print N space-separated integers in a single line describing the quantities of the ingredients for the L^th dish.

Constraints

• 1 ≤ T ≤ 10
• For 20 points : N = 3, 2 ≤ K ≤ 10², 1 ≤ L ≤ 10⁶
• For 30 points : 1 ≤ N ≤ 10², 2 ≤ K ≤ 10², 1 ≤ L ≤ 10⁴
• For 50 points : 1 ≤ N ≤ 10³, 2 ≤ K ≤ 10³, 1 ≤ L ≤ 10¹⁸
• L will not exceed the total number of possible dishes.

Example

Input:
4
3 3 1
3 3 2
3 3 3
3 3 4

Output:
1 1 1
1 1 2
1 1 3
1 2 1

Explanation

First 4 dishes in order have ingredients (1,1,1), (1,1,2), (1,1,3), and (1,2,1).

Input:
4
4 3 1
4 3 2
4 3 3
4 3 4

Output:
1 1 1 1
1 1 1 2
1 1 1 3
1 1 2 1

Explanation

First 4 dishes in order have ingredients (1,1,1,1), (1,1,1,2), (1,1,1,3), and (1,1,2,1).

题意：给出N,K,L，求出长度为N的K进制中第L小的数字，L保证不超过N长度。

思路：从低位开始推。

# include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int a[1003];
int main()
{
    int t, n, k;
    LL l;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%lld",&n,&k,&l);
        --l;
        for(int i=0; i<n; ++i) a[i] = 0;
        for(int i=0; i<n; ++i)
        {
            a[i] = l%k;
            l /= k;
        }
        for(int i=n-1; i>=0; --i)
            printf("%d ",a[i]+1);
        puts("\n");
    }
    return 0;
}