[백준][Java] 1009번 분산처리 (구현)

[백준][Java] 1009번 분산처리 (구현)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.ArrayList; import java.util.List; public class Main { private static BufferedReader br = new BufferedReader( new InputStreamReader( System . in )); private static BufferedWriter bw = new BufferedWriter( new OutputStreamWriter( System . out )); public static void main( String [] args) throws IOException{ int T = stoi(br.readLine()); for ( int i = 0 ; i < T; i + + ) { String [] str = br.readLine(). split ( " " ); List < Integer > list = new ArrayList < > (); int a = (stoi(str[ 0 ])% 10 = = 0 )? 10 : stoi(str[ 0 ])% 10 ; int b = stoi(str[ 1 ]); int candi = a; while ( true ) { if (list.contains(candi)) break ; else { list. add (candi); candi = (candi * a)% 10 ; } } int idx = (b%list.size() = = 0 )? list.size() - 1 :b%list.size() - 1 ; int res = (list.get(idx)% 10 = = 0 )? 10 : list.get(idx)% 10 ; bw.write(res + "

" ); } // bw.write(""); bw.flush(); bw.close(); } private static int stoi( String input) { return Integer. parseInt (input); } } Colored by Color Scripter

from http://aig2029.tistory.com/315 by ccl(A) rewrite - 2021-10-02 13:01:11