結果

問題 No.888 約数の総和
ユーザー lmxyue
提出日時 2025-08-25 12:07:45
言語 Java
(openjdk 23)
結果
AC  
実行時間 91 ms / 2,000 ms
コード長 4,887 bytes
コンパイル時間 4,610 ms
コンパイル使用メモリ 81,584 KB
実行使用メモリ 44,340 KB
最終ジャッジ日時 2025-08-25 12:07:54
合計ジャッジ時間 6,803 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #

package contest190920;
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 B {
        InputStream is;
        PrintWriter out;
        String INPUT = "";
        
        void solve()
        {
                long n = nl();
                long ans = 0;
                for(long d = 1;d*d <= n;d++) {
                        if(n % d == 0) {
                                ans += d;
                                if(d*d < n)ans += n/d;
                        }
                }
                out.println(ans);
        }
        
        
        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 B().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)); }
}
0