結果
問題 | No.1343 Dividing Digit |
ユーザー |
![]() |
提出日時 | 2021-01-16 15:08:45 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 252 ms / 2,000 ms |
コード長 | 3,585 bytes |
コンパイル時間 | 3,951 ms |
コンパイル使用メモリ | 80,792 KB |
実行使用メモリ | 50,080 KB |
最終ジャッジ日時 | 2024-11-27 17:30:27 |
合計ジャッジ時間 | 7,360 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
import java.util.*; import java.io.*; import java.math.*;public class Main{//Don't have to see. start------------------------------------------static class InputIterator{ArrayList<String> inputLine = new ArrayList<>(1024);int index = 0; int max; String read;InputIterator(){BufferedReader br = new BufferedReader(new InputStreamReader(System.in));try{while((read = br.readLine()) != null){inputLine.addAll(Arrays.asList(read.split(" ")));}}catch(IOException e){}max = inputLine.size();}boolean hasNext(){return (index < max);}String next(){if(hasNext()){return inputLine.get(index++);}else{throw new IndexOutOfBoundsException("There is no more input");}}}static HashMap<Integer, String> CONVSTR = new HashMap<>();static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.static PrintWriter out = new PrintWriter(System.out);static void flush(){out.flush();}static void myout(Object t){out.println(t);}static void myerr(Object t){System.err.print("debug:");System.err.println(t);}static String next(){return ii.next();}static boolean hasNext(){return ii.hasNext();}static int nextInt(){return Integer.parseInt(next());}static long nextLong(){return Long.parseLong(next());}static double nextDouble(){return Double.parseDouble(next());}static ArrayList<String> nextCharArray(){return myconv(next(), 0);}static ArrayList<String> nextStrArray(int size){ArrayList<String> ret = new ArrayList<>(size);for(int i = 0; i < size; i++){ret.add(next());}return ret;}static ArrayList<Integer> nextIntArray(int size){ArrayList<Integer> ret = new ArrayList<>(size);for(int i = 0; i < size; i++){ret.add(Integer.parseInt(next()));}return ret;}static ArrayList<Long> nextLongArray(int size){ArrayList<Long> ret = new ArrayList<>(size);for(int i = 0; i < size; i++){ret.add(Long.parseLong(next()));}return ret;}@SuppressWarnings("unchecked")static String myconv(Object list, int no){//only joinString joinString = CONVSTR.get(no);if(list instanceof String[]){return String.join(joinString, (String[])list);}else if(list instanceof ArrayList){return String.join(joinString, (ArrayList)list);}else{throw new ClassCastException("Don't join");}}static ArrayList<String> myconv(String str, int no){//only splitString splitString = CONVSTR.get(no);return new ArrayList<String>(Arrays.asList(str.split(splitString)));}public static void main(String[] args){CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");solve();flush();}//Don't have to see. end------------------------------------------static void solve(){//Here is the main functionint N = nextInt();int K = nextInt();ArrayList<Integer> list = nextIntArray(N);long output = 0;int mod = 0;for(int i = 0; i < N; i++){mod += list.get(i);}Collections.reverse(list);for(int i = 0; i < N; i++){output += list.get(i) * originPow(K, i, mod);output %= mod;}myout(output);}//Method addition frame startstatic long originPow(long x, long n) {return originPow(x,n,-1);}static long originPow(long x, long n, long m) {long ans = 1;while (n > 0) {if ((n & 1) == 1){ans = ans * x;if(m != -1){ans %= m;}}x = x * x;if(m != -1){x %= m;}n >>= 1;}return ans;}//Method addition frame end}