結果

問題 No.830 日本人の9割は90%
ユーザー kqleid
提出日時 2019-07-20 01:05:35
言語 Java
(openjdk 23)
結果
AC  
実行時間 58 ms / 2,000 ms
コード長 2,949 bytes
コンパイル時間 3,009 ms
コンパイル使用メモリ 79,628 KB
実行使用メモリ 37,160 KB
最終ジャッジ日時 2024-12-26 08:45:07
合計ジャッジ時間 4,375 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    static final int MOD = (int)1e9+7;
    public static void main(String[] args){
        FastScanner sc = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        solve(sc,out);
        out.flush();
    }
    public static void solve(FastScanner sc, PrintWriter out) {
        int n = sc.nextInt();
        out.println(n*10);
    }
    public static long gcd(long a, long b) {
        if(a < b) return gcd(b, a);
        if(b == 0) return a;
        return gcd(b, a % b);
    }
    public static long lcm(long a, long b) {
        return a / gcd(a, b) * b;
    }
    public static long factorial(int n) {
        long a;
        if(n > 0) {
            a = n * factorial(n - 1);
        }else{
            a = 1;
        }
        return a;
    }
}
class Pair<K, V> extends AbstractMap.SimpleEntry<K, V> {
    public Pair(K key, V value) {
        super(key, value);
    }
    public Pair<V, K> swap() {
        return new Pair<V, K>(getValue(), getKey());
    }
 }
class UnionFind {
    int[] par;
    public UnionFind(int n) {
        par = new int[n];
        Arrays.fill(par, -1);
    }
    int root(int x) {
        if(par[x] < 0) return x;
        return par[x] = root(par[x]);
    }
    boolean unite(int x,int y) {
        x = root(x);
        y = root(y);
        if(x == y) return false;
        if(size(x) < size(y)) {
            int tmp = x;
            x = y;
            y = tmp;
        }
        par[x] += par[y];
        par[y] = x;
        return true;
    }
    boolean same(int x,int y) {
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
    int size(int a) {
        return -par[root(a)];
    }
}
class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;
    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }
    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }
    public long nextLong() {
        return Long.parseLong(next());
    }
    public int nextInt() {
        return Integer.parseInt(next());
    }
    public double nextDouble() {
         return Double.parseDouble(next());
     }
    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }
    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0