[アルゴリズム]白俊14682号-Shifty Sum

質問リンク:https://www.acmicpc.net/problem/14682
質問する
Suppose we have a number like 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. If we shift the number again we get the number 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 and a non-negative integer k. You must add together N and all the numbers you get by shifting a total of k times.
For example, the shifty sum when N is 12 and k is 1 is: 12 + 120 = 132. As another example, the shifty sum when N is 12 and k is 3 is 12 + 120 + 1200 + 12000 = 13332.
入力
The first line of input contains the number N (1 ≤ N ≤ 10000). The second line of input contains k, the number of times to shift N (0 ≤ k ≤ 5).
しゅつりょく
Output the integer which is the shifty sum of N by k.
のり付け
null
コード#コード#

import java.util.*;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int num = sc.nextInt();
		int cnt = sc.nextInt();
		int a = num;
		int sum = 0;
		for(int i=0;i<cnt;i++)
		{
			sum += (a *= 10);
		}
		System.out.println(sum+num);
    }
}