| 提出番号 | 1963 |
|---|---|
| 提出者 | now |
| 言語 | Java |
| 提出日時 | 2018-08-04 14:45:27 |
| 問題名 | (72)K-th DigitSum |
| 結果 | RE |
| 点数 | 0% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | RE | 0% | 0ms | 0KB |
| 2 | RE | 0% | 0ms | 0KB |
| 3 | RE | 0% | 0ms | 0KB |
| 4 | RE | 0% | 0ms | 0KB |
| 5 | RE | 0% | 0ms | 0KB |
| 6 | RE | 0% | 0ms | 0KB |
| 7 | RE | 0% | 0ms | 0KB |
| 8 | RE | 0% | 0ms | 0KB |
| 9 | RE | 0% | 0ms | 0KB |
| 10 | RE | 0% | 0ms | 0KB |
| 11 | RE | 0% | 0ms | 0KB |
| 12 | RE | 0% | 0ms | 0KB |
| 13 | RE | 0% | 0ms | 0KB |
| 14 | RE | 0% | 0ms | 0KB |
| 15 | RE | 0% | 0ms | 0KB |
| 16 | RE | 0% | 0ms | 0KB |
| 17 | RE | 0% | 0ms | 0KB |
| 18 | RE | 0% | 0ms | 0KB |
| 19 | RE | 0% | 0ms | 0KB |
| 20 | RE | 0% | 0ms | 0KB |
| 21 | RE | 0% | 0ms | 0KB |
| 22 | RE | 0% | 0ms | 0KB |
| 23 | RE | 0% | 0ms | 0KB |
| 24 | RE | 0% | 0ms | 0KB |
| 25 | RE | 0% | 0ms | 0KB |
| 26 | RE | 0% | 0ms | 0KB |
| 27 | RE | 0% | 0ms | 0KB |
| 28 | RE | 0% | 0ms | 0KB |
| 29 | RE | 0% | 0ms | 0KB |
| 30 | RE | 0% | 0ms | 0KB |
| 31 | RE | 0% | 0ms | 0KB |
| 32 | RE | 0% | 0ms | 0KB |
| 33 | RE | 0% | 0ms | 0KB |
| 34 | RE | 0% | 0ms | 0KB |
| 35 | RE | 0% | 0ms | 0KB |
| 36 | RE | 0% | 0ms | 0KB |
| 37 | RE | 0% | 0ms | 0KB |
| 38 | RE | 0% | 0ms | 0KB |
| 39 | RE | 0% | 0ms | 0KB |
| 40 | RE | 0% | 0ms | 0KB |
| 41 | RE | 0% | 0ms | 0KB |
| 42 | RE | 0% | 0ms | 0KB |
| 43 | RE | 0% | 0ms | 0KB |
| 44 | RE | 0% | 0ms | 0KB |
| 45 | RE | 0% | 0ms | 0KB |
| 46 | RE | 0% | 0ms | 0KB |
| 47 | RE | 0% | 0ms | 0KB |
| 48 | RE | 0% | 0ms | 0KB |
| 49 | RE | 0% | 0ms | 0KB |
| 50 | RE | 0% | 0ms | 0KB |
| 51 | RE | 0% | 0ms | 0KB |
import java.util.Scanner;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Input > ");
int N = scanner.nextInt();
int M = scanner.nextInt();
int num[] = new int[(int)Math.pow(10,9)];
int x =0;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (i+j ==N){
if(!Arrays.asList(num).contains(i+j)){
num[x] = i+j;
x++;
}
}
}
}
System.out.println(num[M]);
}
}