結果
問題 | No.276 連続する整数の和(1) |
ユーザー |
|
提出日時 | 2019-05-30 22:32:08 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 138 ms / 1,000 ms |
コード長 | 4,345 bytes |
コンパイル時間 | 2,269 ms |
コンパイル使用メモリ | 79,268 KB |
実行使用メモリ | 58,636 KB |
最終ジャッジ日時 | 2024-09-17 16:10:23 |
合計ジャッジ時間 | 4,268 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
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);long n = scanner.nextLong();if(n % 2 == 0){System.out.println(gcd(n*(n+1)/2,n));}else{System.out.println(n);}}public static void swap(long a, long b){long tmp = 0;if(a > b){tmp = a;a = b;b = tmp;}}public static class Edge{int to;int cost;Edge(int to, int cost){this.to = to;this.cost = cost;}}static class Pair implements Comparable<Pair>{int first, second;Pair(int a, int b){first = a;second = b;}@Overridepublic boolean equals(Object o){if (this == o) return true;if (!(o instanceof Pair)) return false;Pair p = (Pair) o;return first == p.first && second == p.second;}@Overridepublic int compareTo(Pair p){return first == p.first ? second - p.second : first - p.first; //firstで昇順にソート//return (first == p.first ? second - p.second : first - p.first) * -1; //firstで降順にソート//return second == p.second ? first - p.first : second - p.second;//secondで昇順にソート//return (second == p.second ? first - p.first : second - p.second)*-1;//secondで降順にソート}}//繰り返し二乗法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[] array, long value) {int low = 0;int high = array.length;int mid;while( low < high ) {mid = ((high - low) >>> 1) + low; // (high + low) / 2if( array[mid] <= value ) {low = mid + 1;} else {high = mid;}}return low;}public static final int lowerBound(final long[] arr, final long value) {int low = 0;int high = arr.length;int mid;while (low < high) {mid = ((high - low) >>> 1) + low; //(low + high) / 2 (オーバーフロー対策)if (arr[mid] < value) {low = mid + 1;} else {high = mid;}}return low;}//n,mの最大公約数public static long gcd(long n, long m){if(m > n) return gcd(m,n);if(m == 0) return n;return gcd(m, n%m);}//3要素のソートprivate class Pair2 implements Comparable<Pair2> {String s;int p;int index;public Pair2(String s, int p, int index) {this.s = s;this.p = p;this.index = index;}public int compareTo(Pair2 other) {if (s.equals(other.s)) {return other.p - this.p;}return this.s.compareTo(other.s);}}}