結果

問題 No.128 お年玉(1)
ユーザー threepipes_s
提出日時 2015-01-16 23:31:10
言語 Java
(openjdk 23)
結果
AC  
実行時間 52 ms / 5,000 ms
コード長 3,116 bytes
コンパイル時間 2,307 ms
コンパイル使用メモリ 79,216 KB
実行使用メモリ 37,172 KB
最終ジャッジ日時 2024-10-01 09:43:35
合計ジャッジ時間 4,356 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.BitSet;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.TreeSet;
public class Main {
    public static void main(String[] args) throws NumberFormatException, IOException{
        ContestScanner in = new ContestScanner();
        long n = in.nextLong();
        long m = in.nextLong();
        long ans = n/m/1000L;
        System.out.println(ans*1000L);
    }
}
class MyComp implements Comparator<int[]>{
    public int compare(int[] a, int[] b) {
        return a[0] - b[0];
    }
}
//
//class Reverse implements Comparator<Integer>{
//  public int compare(Integer arg0, Integer arg1) {
//      return arg1 - arg0;
//  }
//}
class Node implements Comparable<Node>{
    int id;
    int qNum;
    int xor;
    List<Node> edge = new ArrayList<Node>();
    public Node(int id, int q, int xor){
        this.id = id;
        qNum = q;
        this.xor = xor;
    }
    public void createEdge(Node node){
        edge.add(node);
    }
    
    @Override
    public int compareTo(Node n) {
        return n.qNum - qNum;
    }
}
class MyMath{
    public final static double PIhalf = Math.PI/2.0;
    public static double pAngle(double x, double y){
        // ベクトル(1, 0)と(x, y)とのなす角を返す(rad:0 to 2pi)
        if(x == 0){
            if(y == 0){
                System.err.println("pAngle error: zero vector.");
                return 0;
            }else if(y < 0){
                return PIhalf*3.0;
            }else{
                return PIhalf;
            }
        }
        double rad = Math.atan(y/x);
        if(rad < 0){
            rad += Math.PI*2.0;
        }
        return rad;
    }
    public static long fact(long n){
        long res = 1;
        while(n > 0){
            res *= n--;
        }
        return res;
    }
    public static long[][] pascalT(int n){
        long[][] tri = new long[n][];
        for(int i=0; i<n; i++){
            tri[i] = new long[i+1];
            for(int j=0; j<i+1; j++){
                if(j == 0 || j == i){
                    tri[i][j] = 1;
                }else{
                    tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
                }
            }
        }
        return tri;
    }
    // 最大公約数
    static int gcd(int a, int b){
        return b == 0 ? a : gcd(b, a % b);
    }
    // 最小公倍数
    static int lcm(int a, int b){
        return a * b / gcd(a, b);
    }
}
class ContestScanner{
    private BufferedReader reader;
    private String[] line;
    private int idx;
    public ContestScanner() throws FileNotFoundException{
        reader = new BufferedReader(new InputStreamReader(System.in));
    }
    public ContestScanner(String filename) throws FileNotFoundException{
        reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));
    }
    
    public String nextToken() throws IOException{
        if(line == null || line.length <= idx){
            line = reader.readLine().trim().split(" ");
            idx = 0;
        }
        return line[idx++];
    }
    public long nextLong() throws IOException, NumberFormatException{
        return Long.parseLong(nextToken());
    }
    public int nextInt() throws NumberFormatException, IOException{
        return (int)nextLong();
    }
    public double nextDouble() throws NumberFormatException, IOException{
        return Double.parseDouble(nextToken());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0