結果

問題 No.125 悪の花弁
ユーザー ぴろずぴろず
提出日時 2015-01-12 00:30:25
言語 Java21
(openjdk 21)
結果
AC  
実行時間 954 ms / 5,000 ms
コード長 5,023 bytes
コンパイル時間 2,670 ms
コンパイル使用メモリ 74,628 KB
実行使用メモリ 70,960 KB
最終ジャッジ日時 2023-09-04 04:46:30
合計ジャッジ時間 9,380 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 803 ms
69,748 KB
testcase_01 AC 849 ms
70,792 KB
testcase_02 AC 926 ms
70,960 KB
testcase_03 AC 954 ms
70,840 KB
testcase_04 AC 872 ms
69,768 KB
testcase_05 AC 875 ms
69,748 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no125;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static long MOD = 1000000007;
	public static void main(String[] args) {
		long[] fact = new long[1000001];
		long[] factinv = new long[1000001];
		fact[0] = 1;
		for(int i=1;i<=1000000;i++) {
			fact[i] = (i * fact[i-1]) % MOD;
			factinv[i] = modInv(fact[i], MOD);
		}

		IO io = new IO();
		int k = io.nextInt();
		int[] c = new int[k];
		int s = 0;
		for(int i=0;i<k;i++) {
			c[i] = io.nextInt();
			s += c[i];
		}
		int[] num = new int[s+1];
		for(int i=1;i<=s;i++) {
			num[(int) gcd(i,s)]++;
		}
		long ans = 0;
		for(int l=1;l<=s;l++) {
			if (num[l] == 0) {
				continue;
			}
			boolean flag = true;
			for(int i=0;i<k;i++) {
				if (c[i] % (s/l) != 0) {
					flag = false;
					break;
				}
			}
			if (flag) {
				long x = (fact[l] * num[l]) % MOD;
				for(int i=0;i<k;i++) {
					x = (x * factinv[c[i]/(s/l)]) % MOD;
				}
				ans = (ans + x) % MOD;
			}
		}
		ans = (ans * modInv(s, MOD)) % MOD;
		System.out.println(ans);
	}

	public static long gcd(long a,long b) {
		while(b!=0) {
			long r = a%b;
			a = b;
			b = r;
		}
		return a;
	}
	public static long modpow(long x,long n,long mod) {
		long res = 1;
		while(n > 0) {
			if ((n & 1) > 0) {
				res = (res * x) % mod;
			}
			x = (x * x) % mod;
			n/=2;
		}
		return res;
	}
	public static long modInv(long x,long modP) {
		return modpow(x, modP-2, modP);
	}
}
class IO {
	private final InputStream in;
	final PrintWriter out = new PrintWriter(System.out);
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { this.in = source;}
	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 static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
	private void skipNewLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++;}
	public boolean hasNext() { skipUnprintable(); return hasNextByte();}
	public boolean hasNextLine() { skipNewLine(); 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 char[] nextCharArray(int len) {
		char[] s = new char[len];
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] arrayInt(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] arrayLong(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] arrayDouble(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void arrayInt(int[]... a) {for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] matrixInt(int n,int m) { int[][] a = new int[n][m]; for(int i=0;i<n;i++) a[i] = arrayInt(m); return a;}
	public char[][] charMap(int n,int m) { char[][] a = new char[n][m]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
}
0