結果
問題 | No.118 門松列(2) |
ユーザー | t8m8⛄️ |
提出日時 | 2015-03-12 10:24:24 |
言語 | Java21 (openjdk 21) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,670 bytes |
コンパイル時間 | 3,640 ms |
コンパイル使用メモリ | 79,268 KB |
実行使用メモリ | 50,508 KB |
最終ジャッジ日時 | 2024-06-24 17:25:06 |
合計ジャッジ時間 | 6,674 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 94 ms
38,380 KB |
testcase_02 | AC | 93 ms
38,372 KB |
testcase_03 | AC | 92 ms
38,456 KB |
testcase_04 | AC | 96 ms
38,460 KB |
testcase_05 | AC | 93 ms
38,472 KB |
testcase_06 | AC | 58 ms
36,816 KB |
testcase_07 | AC | 60 ms
37,012 KB |
testcase_08 | AC | 59 ms
36,600 KB |
testcase_09 | AC | 92 ms
38,364 KB |
testcase_10 | AC | 84 ms
38,496 KB |
testcase_11 | AC | 82 ms
38,452 KB |
testcase_12 | AC | 69 ms
37,348 KB |
testcase_13 | AC | 67 ms
37,820 KB |
testcase_14 | AC | 93 ms
38,352 KB |
testcase_15 | AC | 61 ms
37,116 KB |
testcase_16 | AC | 87 ms
38,400 KB |
testcase_17 | AC | 68 ms
37,224 KB |
testcase_18 | AC | 84 ms
38,472 KB |
testcase_19 | AC | 85 ms
38,384 KB |
testcase_20 | AC | 87 ms
38,580 KB |
testcase_21 | AC | 91 ms
38,376 KB |
testcase_22 | AC | 85 ms
38,324 KB |
testcase_23 | AC | 90 ms
38,512 KB |
testcase_24 | AC | 83 ms
38,216 KB |
testcase_25 | AC | 85 ms
38,096 KB |
ソースコード
//No.118 門松列(2) import java.util.*; import java.io.*; import java.math.*; import static java.util.Arrays.*; import static java.lang.Math.*; public class No118 { static final InputStream in = System.in; static final PrintWriter out = new PrintWriter(System.out,false); static final int MOD = 1000000007; static void solve(){ int n = nextInt(); int[] a = new int[101]; for (int i=0; i<n; i++) a[nextInt()]++; long ans = 0; for (int i=1; i<=100; i++) for (int j=i+1; j<=100; j++) for (int k=j+1; k<=100; k++) ans = (ans + a[i]*a[j]%MOD*a[k])%MOD; out.println(ans); } public static void main(String[] args) throws Exception { long start = System.currentTimeMillis(); solve(); out.flush(); long end = System.currentTimeMillis(); //trace(end-start + "ms"); in.close(); } static void trace(Object... o) { System.out.println(deepToString(o));} static final byte[] buf = new byte[1024]; static int ptr = 0; static int buflen = 0; static boolean hasNextByte() { if (ptr < buflen) return true; ptr = 0; try{ buflen = in.read(buf); }catch (IOException e) {e.printStackTrace();} if (buflen <= 0) return false; return true; } static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;} static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;} static boolean hasNext() {skip(); return hasNextByte();} static 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(); } static long nextLong() { if (!hasNext()) throw new NoSuchElementException(); boolean minus = false; long num = readByte(); if(num == '-'){ num = 0; minus = true; }else if (num < '0' || '9' < num){ throw new NumberFormatException(); }else{ num -= '0'; } while(true){ int b = readByte(); if('0' <= b && b <= '9') num = num * 10 + (b - '0'); else if(b == -1 || !isPrintableChar(b)) return minus ? -num : num; else throw new NoSuchElementException(); } } static int nextInt() { long num = nextLong(); if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num) throw new NumberFormatException(); return (int)num; } static double nextDouble() { return Double.parseDouble(next()); } static char nextChar() { if (!hasNext()) throw new NoSuchElementException(); return (char)readByte(); } static String nextLine() { while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++; if (!hasNextByte()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (b != '\n' && b != '\r') { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } static int[] nextArrayInt(int n) { int[] a = new int[n]; for (int i=0; i<n; i++) a[i] = nextInt(); return a; } }