結果
問題 | No.888 約数の総和 |
ユーザー | Oland |
提出日時 | 2019-09-20 21:30:19 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 73 ms / 2,000 ms |
コード長 | 6,131 bytes |
コンパイル時間 | 2,226 ms |
コンパイル使用メモリ | 78,096 KB |
実行使用メモリ | 37,740 KB |
最終ジャッジ日時 | 2024-09-14 16:26:38 |
合計ジャッジ時間 | 5,215 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,928 KB |
testcase_01 | AC | 52 ms
36,880 KB |
testcase_02 | AC | 52 ms
36,660 KB |
testcase_03 | AC | 53 ms
36,928 KB |
testcase_04 | AC | 52 ms
36,660 KB |
testcase_05 | AC | 52 ms
36,508 KB |
testcase_06 | AC | 53 ms
36,948 KB |
testcase_07 | AC | 52 ms
37,076 KB |
testcase_08 | AC | 52 ms
36,804 KB |
testcase_09 | AC | 51 ms
36,928 KB |
testcase_10 | AC | 51 ms
36,884 KB |
testcase_11 | AC | 52 ms
36,696 KB |
testcase_12 | AC | 53 ms
37,044 KB |
testcase_13 | AC | 53 ms
36,572 KB |
testcase_14 | AC | 54 ms
36,836 KB |
testcase_15 | AC | 52 ms
36,632 KB |
testcase_16 | AC | 52 ms
37,020 KB |
testcase_17 | AC | 53 ms
37,072 KB |
testcase_18 | AC | 73 ms
37,728 KB |
testcase_19 | AC | 71 ms
37,728 KB |
testcase_20 | AC | 67 ms
37,428 KB |
testcase_21 | AC | 73 ms
37,532 KB |
testcase_22 | AC | 72 ms
37,740 KB |
testcase_23 | AC | 53 ms
37,044 KB |
testcase_24 | AC | 65 ms
37,660 KB |
testcase_25 | AC | 65 ms
37,644 KB |
testcase_26 | AC | 69 ms
37,660 KB |
testcase_27 | AC | 71 ms
37,568 KB |
testcase_28 | AC | 70 ms
37,488 KB |
testcase_29 | AC | 73 ms
37,648 KB |
testcase_30 | AC | 73 ms
37,532 KB |
testcase_31 | AC | 72 ms
37,572 KB |
testcase_32 | AC | 73 ms
37,548 KB |
ソースコード
import java.io.*; import java.util.*; @SuppressWarnings("unused") public class Main { private FastScanner in = new FastScanner(System.in); private PrintWriter out = new PrintWriter(System.out); final int MOD = (int)1e9+7; long ceil(long a, long b){return (a + b - 1) / b;} void solve() throws Exception{ long n = in.nextLong(), sum = 0; for(long i = 1; i * i <= n; i++){ if(n % i == 0) { if (i * i == n) sum += i; else sum += i + n / i; } } out.println(sum); } //end solve public static void main(String[] args) throws Exception { new Main().m(); } private void m() throws Exception { solve(); out.flush(); } static class FastScanner { Reader input; FastScanner() {this(System.in);} FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));} int nextInt() {return (int) nextLong();} long nextLong() { try { int sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } long ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) return ret * sign; ret *= 10; ret += b - '0'; } } catch (IOException e) { e.printStackTrace(); return -1; } } double nextDouble() { try { double sign = 1; int b = input.read(); while ((b < '0' || '9' < b) && b != '-' && b != '+') { b = input.read(); } if (b == '-') { sign = -1; b = input.read(); } else if (b == '+') { b = input.read(); } double ret = b - '0'; while (true) { b = input.read(); if (b < '0' || '9' < b) break; ret *= 10; ret += b - '0'; } if (b != '.') return sign * ret; double div = 1; b = input.read(); while ('0' <= b && b <= '9') { ret *= 10; ret += b - '0'; div *= 10; b = input.read(); } return sign * ret / div; } catch (IOException e) { e.printStackTrace(); return Double.NaN; } } char nextChar() { try { int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } return (char) b; } catch (IOException e) { e.printStackTrace(); return 0; } } String nextStr() { try { StringBuilder sb = new StringBuilder(); int b = input.read(); while (Character.isWhitespace(b)) { b = input.read(); } while (b != -1 && !Character.isWhitespace(b)) { sb.append((char) b); b = input.read(); } return sb.toString(); } catch (IOException e) { e.printStackTrace(); return ""; } } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public int[] nextIntArray1Index(int n) { int[] res = new int[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextInt(); } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public long[] nextLongArray1Index(int n) { long[] res = new long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } public double[] nextDoubleArray(int n) { double[] res = new double[n]; for (int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; } public Long[] nextWrapperLongArray(int n) { Long[] res = new Long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public Long[] nextWrapperLongArrayDec(int n) { Long[] res = new Long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public Long[] nextWrapperLongArray1Index(int n) { Long[] res = new Long[n + 1]; for (int i = 0; i < n; i++) { res[i + 1] = nextLong(); } return res; } } }