CCC '17 J2 - Shifty Sum - DMOJ: Modern Online Judge

CCC '17 J2 - Shifty Sum

Points: 3 (partial)

Time limit: 1.0s

Memory limit: 256M

Problem type

Canadian Computing Competition: 2017 Stage 1, Junior #2

Suppose we have a number like $12$ ~12~. Let's define shifting a number to mean adding a zero at the end. For example, if we shift that number once, we get the number $120$ ~120~. If we shift the number again we get the number $1200$ ~1200~. We can shift the number as many times as we want.

In this problem you will be calculating a shifty sum, which is the sum of a number and the numbers we get by shifting. Specifically, you will be given the starting number $N$ ~N~ and a non-negative integer $k$ ~k~. You must add together $N$ ~N~ and all the numbers you get by shifting a total of $k$ ~k~ times.

For example, the shifty sum when $N$ ~N~ is $12$ ~12~ and $k$ ~k~ is $1$ ~1~ is: $12 + 120 = 132$ ~12 + 120 = 132~. As another example, the shifty sum when $N$ ~N~ is $12$ ~12~ and $k$ ~k~ is $3$ ~3~ is $12 + 120 + 1\,200 + 12\,000 = 13\,332$ ~12 + 120 + 1\,200 + 12\,000 = 13\,332~.

Input Specification

The first line of input contains the number $N$ ~N~ $(1 \leq N \leq 10\,000)$ ~(1 \leq N \leq 10\,000)~. The second line of input contains $k$ ~k~, the number of times to shift $N$ ~N~ $(0 \leq k \leq 5)$ ~(0 \leq k \leq 5)~.

Output Specification

Output the integer which is the shifty sum of $N$ ~N~ by $k$ ~k~.

Sample Input

12
3

Sample Output

Comments

-6

Ice978asfd98032i commented on Jan. 31, 2025, 2:22 a.m.

W

This comment is hidden due to too much negative feedback. Show it anyway.

-5

Ethan_123450 commented on Jan. 28, 2025, 12:07 a.m.

yay I got it right

This comment is hidden due to too much negative feedback. Show it anyway.

-3

MichaelZhou2012 commented on Jan. 17, 2025, 3:51 p.m.

the logic is very simply, but you need to be careful when adding them!

-14

MichaelZhou2012 commented on Jan. 17, 2025, 3:34 p.m.

fuc dan shi! shi this problem!

This comment is hidden due to too much negative feedback. Show it anyway.

-2

mucube0 commented on Jan. 29, 2024, 10:37 p.m.

I solved this one by converting a string of all ones to an int.....

-1

dhruvkangaroo commented on Dec. 18, 2024, 7:03 p.m.

I solved it by getting the sum of a list

-186

issamzar commented on March 10, 2017, 8:32 p.m.

i made is right and they tell me : You have been declared persona non grata for this problem. You are permanently barred from submitting this problem. btw the solution is on language D and i'm using python.

This comment is hidden due to too much negative feedback. Show it anyway.

185

Xyene commented on March 10, 2017, 8:59 p.m.

Yes, because you submitted an editorial solution to a lot of problems without solving them yourself before. Each editorial is accompanied by a large warning that copy/pasting editorials can lead to bans on submitting a problem, so is it a surprise that you got banned doing so?

I've unbanned you from this problem, but this isn't something that'll happen again.