304 North Cardinal St.
Dorchester Center, MA 02124

# Chef Anup CodeChef Solution

## Chef Anup CodeChef Solution in C++14

``````#include <bits/stdc++.h>
using namespace std;

int main() {
int t;
cin>>t;
while(t--)
{
int n,k;
unsigned long long  l;
cin >> n >> k >> l;
l--;
vector <int> v(n, 1);
int cnt = n;
while (l>0) {
cnt--;
v[cnt]+=l%k;
l/=k;
}
for (int i = 0;i<n;i++) {
cout << v[i] << " ";
}
cout << endl;

}
return 0;
}``````

## Chef Anup CodeChef Solution in PYTH 3

``````# cook your dish here
for _ in range(int(input())):
N, K, L = list(map(int, input().split()))
L -= 1
digits = []
while L:
digits.append(int(L % K))
L //= K
digits = digits[::-1]
digits = [1]*(N - len(digits)) + [1 + i for i in digits]
print(*digits)``````

## Chef Anup CodeChef Solution in C

``````#include <stdio.h>
#include <stdlib.h>

int main(void){
int t;
scanf("%d", &t);
while(t--){
long long int n, k, l;
scanf("%lld %lld %lld", &n, &k, &l);
long long int * ans =
(long long int *) malloc(sizeof(long long int) * n);
for(long long int i = 0; i < n; ++i){
ans[i] = l%k;
if(ans[i] == 0){
ans[i] = k;
l = l/k;
}
else{
l = l/k + 1;
}
}
for(long long int i = n - 1; i >= 0; --i)
printf("%lld ", ans[i]);
printf("\n");
free(ans);
}
return 0;
}``````

## Chef Anup CodeChef Solution in JAVA

``````/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
StringTokenizer st;

{
}

String next()
{
while (st == null || !st.hasMoreElements()) {
try {
}
catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }

long nextLong() { return Long.parseLong(next()); }

double nextDouble()
{
return Double.parseDouble(next());
}

String nextLine()
{
String str = "";
try {
if(st.hasMoreTokens()){
str = st.nextToken("\n");
}
else{
}
}
catch (IOException e) {
e.printStackTrace();
}
return str;
}
}

public static void main (String[] args) throws java.lang.Exception
{
int t = sc.nextInt();
for (int cnt=0; cnt<t; cnt++)
{
long n = sc.nextLong();
long k = sc.nextLong();
long p = sc.nextLong()-1;
for (long i=n-1; i>=0; i--)
{
long d = (long)(Math.pow(k,i));
long e = (p/d)%k;
System.out.print(e + 1 + " ");
}
System.out.println();
}
}
}``````

## Chef Anup CodeChef Solution in PYPY 3

``````def get_arr(l, k):
ans = []
while l > 0:
ans.append(l%k)
l = l//k
ans.reverse()
return [i+1 for i in ans]

def solve():
n,k,l = map(int, input().split())
if k == 1:
print(1)
else:
ans = get_arr(l-1, k)
arr = [1]*(n-len(ans)) + ans
print(*arr)

for _ in range(int(input())):
solve()``````

## Chef Anup CodeChef Solution in PYTH

``````t = int(raw_input())
for i in range(t):
st = raw_input().split()
N = int(st[0])
K = int(st[1])
L = int(st[2])-1
A = []
w = 1
while w <= L:
A.append(w)
w = w*K
# endwhile
A.reverse()
sz = len(A)
for p in range(sz):
w = A[p]
n = L/w
A[p] = n+1
L -= n*w
# endfor p
st = ''
for k in range(N-sz):
st += '1 '
# endfor k
for p in range(sz):
st += str(A[p]) + ' '
# endfor p
print st
# endfor i
``````

## Chef Anup CodeChef Solution in C#

``````using System;
using System.Linq;
using System.Text;
public class Test
{
public static void Main()
{
var sb = new StringBuilder();
while(t-- > 0){
long[] arr = Console.ReadLine().Trim().Split().Select(x => long.Parse(x)).ToArray();
long n = arr[0];
long k = arr[1];
long l = arr[2] - 1;
long[] finaldish = new long[n];

long i = 0 ;
while(l > 0){
finaldish[i] = (l % k);
l = l / k;
i++;
}
for(i = n-1 ; i >=0  ; i--){
sb.Append((finaldish[i] + 1) + " ");
}
sb.AppendLine();
}
Console.WriteLine(sb.ToString());
}
}``````

## Chef Anup CodeChef Solution in GO

``````package main

import (
"sort"
"bufio"
"os"
"fmt"
)

func readInt(bytes []byte, from int, val *int) int {
i := from
tmp := 0
for i < len(bytes) && bytes[i] != ' ' {
tmp = tmp*10 + int(bytes[i]-'0')
i++
}
*val = tmp
return i
}

func readInt64(bytes []byte, from int, val *int64) int {
i := from
tmp := int64(0)
for i < len(bytes) && bytes[i] != ' ' {
tmp = tmp*10 + int64(bytes[i]-'0')
i++
}
*val = tmp
return i
}
func readNum(scanner *bufio.Scanner) (a int) {
scanner.Scan()
return
}

func readTwoNums(scanner *bufio.Scanner) (a int, b int) {
scanner.Scan()
return
}

func readNNums(scanner *bufio.Scanner, n int) []int {
res := make([]int, n)
x := -1
scanner.Scan()
for i := 0; i < n; i++ {
}
return res
}

func main() {
scanner := bufio.NewScanner(os.Stdin)

for t > 0 {
t--
scanner.Scan()
var n, K int
var L int64
res := solve(n, K, L)
fmt.Printf("%d", res[0])
for i := 1; i < n; i++ {
fmt.Printf(" %d", res[i])
}
fmt.Println()
}
}

func solve(N int, K int, L int64) []int {
res := make([]int, N)
X := int64(K)
i := N - 1
L--
for L > 0 {
res[i] = int(L % X)
i--
L /= X
}

for i := 0; i < N; i++ {
res[i]++
}
return res
}
func solve1(N int, K int, L int64) []int {
INF := L
kn := make([]int64, N+1)

kn[0] = 1
for i := 1; i <= N; i++ {
if kn[i-1] == INF {
kn[i] = INF
} else {
kn[i] = kn[i-1] * int64(K)
if kn[i] < 0 || kn[i] > INF {
kn[i] = INF
}
}
}
L--
res := make([]int, N)
var last int
for L > 0 {
m := sort.Search(N+1, func(i int) bool {
return kn[i] > L
})

//m the length of continus K from right
//kn[m] > L, kn[m-1] <= L
m--
left := N - m - 1
for i := last; i < left; i++ {
res[i] = 1
}

x := 1
for x <= K {
y := int64(x)
if y*kn[m] > L {
break
}
x++
}
// x * kn[m] >= L
res[left] = x
L -= int64(x-1) * kn[m]
last = left + 1
}

for i := last; i < N; i++ {
res[i] = 1
}

return res
}``````
##### Chef Anup CodeChef Solution Review:

In our experience, we suggest you solve this Chef Anup CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Chef Anup CodeChef Solution.

Find on CodeChef

##### Conclusion:

I hope this Chef Anup CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Programming Language in a business context; there are no prerequisites.

Keep Learning!