結果
問題 | No.810 割った余りの個数 |
ユーザー |
|
提出日時 | 2019-04-12 23:33:35 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 3,925 bytes |
コンパイル時間 | 2,617 ms |
コンパイル使用メモリ | 77,208 KB |
実行使用メモリ | 48,028 KB |
最終ジャッジ日時 | 2024-09-15 06:22:09 |
合計ジャッジ時間 | 7,714 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
import java.util.*;public class Main {static int mod = 1000000007;static int size = 200000;static long[] fac = new long[size];static long[] finv = new long[size];static long[] inv = new long[size];static int INF = Integer.MAX_VALUE;public static void main(String[] args){Scanner scanner = new Scanner(System.in);int l = scanner.nextInt();int r = scanner.nextInt();int m = scanner.nextInt();if(r-l < m){System.out.println(r-l+1);}else{System.out.println(m);}}static class Pair implements Comparable<Pair>{int x, y;Pair(int a, int b){x = a;y = b;}@Overridepublic boolean equals(Object o){if (this == o) return true;if (!(o instanceof Pair)) return false;Pair p = (Pair) o;return x == p.x && y == p.y;}@Overridepublic int compareTo(Pair p){return x == p.x ? y - p.y : x - p.x; //xで昇順にソート//return (x == p.x ? y - p.y : x - p.x) * -1; //xで降順にソート//return y == p.y ? x - p.x : y - p.y;//yで昇順にソート//return (y == p.y ? x - p.x : y - p.y)*-1;//yで降順にソート}}static class Edge implements Comparable<Edge>{int from;int to;int cost;Edge(int from, int to,int cost){this.from = from;this.to = to;this.cost = cost;}public int compareTo(Edge e) {return this.cost - e.cost;}}//繰り返し二乗法public static long pow(long x, long n){long ans = 1;while(n > 0){if((n & 1) == 1){ans = ans * x;ans %= mod;}x = x * x % mod;n >>= 1;}return ans;}//fac, inv, finvテーブルの初期化、これ使う場合はinitComb()で初期化必要public static void initComb(){fac[0] = finv[0] = inv[0] = fac[1] = finv[1] = inv[1] = 1;for (int i = 2; i < size; ++i) {fac[i] = fac[i - 1] * i % mod;inv[i] = mod - (mod / i) * inv[(int) (mod % i)] % mod;finv[i] = finv[i - 1] * inv[i] % mod;}}//nCk % modpublic static long comb(int n, int k){return fac[n] * finv[k] % mod * finv[n - k] % mod;}//n! % modpublic static long fact(int n){return fac[n];}//(n!)^-1 with % modpublic static long finv(int n){return finv[n];}static class UnionFind {int[] parent;public UnionFind(int size) {parent = new int[size];Arrays.fill(parent, -1);}public boolean unite(int x, int y) {x = root(x);y = root(y);if (x != y) {if (parent[y] < parent[x]) {int tmp = y;y = x;x = tmp;}parent[x] += parent[y];parent[y] = x;return true;}return false;}public boolean same(int x, int y) {return root(x) == root(y);}public int root(int x) {return parent[x] < 0 ? x : (parent[x] = root(parent[x]));}public int size(int x) {return -parent[root(x)];}}public static int upperBound(long[] a,long val){return upperBound(a,0,a.length,val);}public static int upperBound(long[] a,int l,int r,long val){if(r-l==1){if(a[l]>val) return l;return r;}int mid=(l+r)/2;if(a[mid]>val){return upperBound(a,l,mid,val);}else{return upperBound(a,mid,r,val);}}public static int lowerBound(long[] a,long val){return lowerBound(a,0,a.length,val);}public static int lowerBound(long[] a,int l,int r,long val){if(r-l==1){if(a[l]<val) return r;return l;}int mid=(l+r)/2;if(a[mid]<val){return lowerBound(a,mid,r,val);}else{return lowerBound(a,l,mid,val);}}//n,mの最大公約数public static int gcd(int n, int m){if(m > n) return gcd(m,n);if(m == 0) return n;return gcd(m, n%m);}}