結果

問題 No.1343 Dividing Digit
ユーザー watarimaycry2watarimaycry2
提出日時 2021-01-16 15:08:45
言語 Java21
(openjdk 21)
結果
AC  
実行時間 240 ms / 2,000 ms
コード長 3,585 bytes
コンパイル時間 2,761 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 61,344 KB
最終ジャッジ日時 2023-08-18 12:27:58
合計ジャッジ時間 7,911 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
49,440 KB
testcase_01 AC 38 ms
49,456 KB
testcase_02 AC 39 ms
49,272 KB
testcase_03 AC 228 ms
60,812 KB
testcase_04 AC 80 ms
52,460 KB
testcase_05 AC 125 ms
55,144 KB
testcase_06 AC 98 ms
54,616 KB
testcase_07 AC 147 ms
56,016 KB
testcase_08 AC 213 ms
60,640 KB
testcase_09 AC 219 ms
60,880 KB
testcase_10 AC 87 ms
52,856 KB
testcase_11 AC 137 ms
55,480 KB
testcase_12 AC 213 ms
60,608 KB
testcase_13 AC 198 ms
56,468 KB
testcase_14 AC 98 ms
52,348 KB
testcase_15 AC 154 ms
56,072 KB
testcase_16 AC 105 ms
50,892 KB
testcase_17 AC 216 ms
61,344 KB
testcase_18 AC 236 ms
60,860 KB
testcase_19 AC 199 ms
56,072 KB
testcase_20 AC 170 ms
58,764 KB
testcase_21 AC 217 ms
60,692 KB
testcase_22 AC 225 ms
60,708 KB
testcase_23 AC 240 ms
60,584 KB
testcase_24 AC 213 ms
60,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 join
		String 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 split
		String 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 function
		int 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 start

static 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
}
0