CodeChef:Chef Anup(数学)

Chef Anup Problem Code: CHEFANUP
Submit

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 Aj = Bj for all j < i and Ai < Bi
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 Lth 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 NKand 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 Lth dish.

Constraints

  • 1 ≤ T ≤ 10
  • For 20 points : N = 32 ≤ K ≤ 1021 ≤ L ≤ 106
  • For 30 points : 1 ≤ N ≤ 1022 ≤ K ≤ 1021 ≤ L ≤ 104
  • For 50 points : 1 ≤ N ≤ 1032 ≤ K ≤ 1031 ≤ L ≤ 1018
  • 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;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值