結果
問題 | No.546 オンリー・ワン |
ユーザー | uwi |
提出日時 | 2017-07-14 22:37:41 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 63 ms / 2,000 ms |
コード長 | 3,910 bytes |
コンパイル時間 | 3,620 ms |
コンパイル使用メモリ | 81,396 KB |
実行使用メモリ | 37,164 KB |
最終ジャッジ日時 | 2024-10-07 23:14:55 |
合計ジャッジ時間 | 5,077 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 7 |
ソースコード
package contest170714;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;public class E {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni();int l = ni();int h = ni();int[] c = na(n);out.println(count(h, c) - count(l-1, c));}long count(int h, int[] c){long ans = 0;for(int i = 0;i < c.length;i++){int[] hey = new int[c.length-1];int p = 0;for(int j = 0;j < c.length;j++){if(i == j)continue;hey[p++] = c[j] / gcd(c[i], c[j]);}long hh = h / c[i];outer:for(int k = 0;k < 1<<p;k++){long g = 1;for(int u = 0;u < p;u++){if(k<<~u<0){g = g / gcd(g, hey[u]) * hey[u];if(g >= 1000000007)continue outer;}}ans += Integer.bitCount(k)%2 == 0 ? hh / g : -hh / g;}}return ans;}public static long gcd(long a, long b) {while (b > 0) {long c = a;a = b;b = c % b;}return a;}public static int gcd(int a, int b) {while (b > 0) {int c = a;a = b;b = c % b;}return a;}void run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){// @Override// public void run() {// long s = System.currentTimeMillis();// solve();// out.flush();// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");// }// };// t.start();// t.join();}public static void main(String[] args) throws Exception { new E().run(); }private byte[] inbuf = new byte[1024];public int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private long[] nal(int n){long[] a = new long[n];for(int i = 0;i < n;i++)a[i] = nl();return a;}private char[][] nm(int n, int m) {char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[][] nmi(int n, int m) {int[][] map = new int[n][];for(int i = 0;i < n;i++)map[i] = na(m);return map;}private int ni() { return (int)nl(); }private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}