#101332 (Java21) No.16 累乗の加算

• 問題: No.16 累乗の加算
• ユーザー: nCk_cv
• 提出日時: 2016-07-02 23:58:57
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 46 ms / 5,000 ms
• コード長: 3,530 bytes
• コンパイル時間: 2,166 ms
• コンパイル使用メモリ: 74,104 KB
• 実行使用メモリ: 49,800 KB
• 最終ジャッジ日時: 2023-09-08 12:00:18
• 合計ジャッジ時間: 3,653 ms
• ジャッジサーバーID （参考情報）: judge14 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	43 ms; 49,388 KB
testcase_01	AC	43 ms; 49,332 KB
testcase_02	AC	45 ms; 49,380 KB
testcase_03	AC	44 ms; 49,608 KB
testcase_04	AC	44 ms; 49,380 KB
testcase_05	AC	44 ms; 49,800 KB
testcase_06	AC	44 ms; 49,516 KB
testcase_07	AC	44 ms; 49,292 KB
testcase_08	AC	45 ms; 49,388 KB
testcase_09	AC	45 ms; 49,316 KB
testcase_10	AC	46 ms; 49,388 KB
testcase_11	AC	44 ms; 49,088 KB
testcase_12	AC	46 ms; 49,208 KB
testcase_13	AC	45 ms; 49,464 KB

ソースコード

import java.io.*;
import java.math.*;
import java.util.*;


class Main {
	static int[] vy = {1,0,-1,0};
	static int[] vx = {0,1,0,-1};
	static long mod = 1000000007;
	public static void main(String[] args) {	
		FastScanner sc = new FastScanner();
		//Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int x = sc.nextInt();
		int n = sc.nextInt();
		int[] a = new int[n];
		for(int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
		}
		int mod = 1000003;
		long sum = 0;
		for(int i = 0; i < n; i++) {
			sum = (sum + pow(x,a[i],mod)) % mod;
		}
		System.out.println(sum);
	}
	static long pow(long x, long n, long mod) {
		if(n == 0) return 1;
		if(n == 1) return x % mod;
		if(n % 2 == 0) {
			long ret = pow(x,n/2,mod);
			return (ret * ret) % mod;
		}
		if(n % 2 == 1) {
			return (x * pow(x,n-1,mod)) % mod;
		}
		return 0;
	}
	
	static class FastScanner {
	    private final InputStream in = System.in;
	    private final byte[] buffer = new byte[1024];
	    private int ptr = 0;
	    private int buflen = 0;
	    private boolean hasNextByte() {
	        if (ptr < buflen) {
	            return true;
	        }else{
	            ptr = 0;
	            try {
	                buflen = in.read(buffer);
	            } catch (IOException e) {
	                e.printStackTrace();
	            }
	            if (buflen <= 0) {
	                return false;
	            }
	        }
	        return true;
	    }
	    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
	    public String next() {
	        if (!hasNext()) throw new NoSuchElementException();
	        StringBuilder sb = new StringBuilder();
	        int b = readByte();
	        while(isPrintableChar(b)) {
	            sb.appendCodePoint(b);
	            b = readByte();
	        }
	        return sb.toString();
	    }
	    public long nextLong() {
	        if (!hasNext()) throw new NoSuchElementException();
	        long n = 0;
	        boolean minus = false;
	        int b = readByte();
	        if (b == '-') {
	            minus = true;
	            b = readByte();
	        }
	        if (b < '0' || '9' < b) {
	            throw new NumberFormatException();
	        }
	        while(true){
	            if ('0' <= b && b <= '9') {
	                n *= 10;
	                n += b - '0';
	            }else if(b == -1 || !isPrintableChar(b)){
	                return minus ? -n : n;
	            }else{
	                throw new NumberFormatException();
	            }
	            b = readByte();
	        }
	    }
	    public int nextInt() {
	        if (!hasNext()) throw new NoSuchElementException();
	        int n = 0;
	        boolean minus = false;
	        int b = readByte();
	        if (b == '-') {
	            minus = true;
	            b = readByte();
	        }
	        if (b < '0' || '9' < b) {
	            throw new NumberFormatException();
	        }
	        while(true){
	            if ('0' <= b && b <= '9') {
	                n *= 10;
	                n += b - '0';
	            }else if(b == -1 || !isPrintableChar(b)){
	                return minus ? -n : n;
	            }else{
	                throw new NumberFormatException();
	            }
	            b = readByte();
	        }
	    }
	}
}