codeforces 148A(Insomnia cure) Java

来源:互联网 发布:动态矩阵控制 编辑:程序博客网 时间:2024/06/05 23:53

完成工作后,秒一波水题!!!

import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.OutputStreamWriter;import java.io.PrintWriter;import java.io.StreamTokenizer;/** * 题意:输入k,l,m,n,d(d代表龙的总数)。满足k,l,m,n倍数的恐龙将被消灭。问你最多能消灭几只龙? */public class Main {    public static void main(String[] args) throws IOException {        StreamTokenizer in = new StreamTokenizer(new BufferedReader(                new InputStreamReader(System.in)));        PrintWriter out = new PrintWriter(new BufferedWriter(                new OutputStreamWriter(System.out)));        int k;        int l;        int m;        int n;        int d;   // 龙的总数        int ans; // 不会被消灭的龙的数量        while (in.nextToken() != StreamTokenizer.TT_EOF) {            k = (int) in.nval;            in.nextToken();            l = (int) in.nval;            in.nextToken();            m = (int) in.nval;            in.nextToken();            n = (int) in.nval;            in.nextToken();            d = (int) in.nval;            ans = 0;            for (int lo = 1; lo <= d; lo++) {                if (lo % k != 0 && lo % l != 0 && lo % m != 0 && lo % n != 0) {                    ans++;                }            }            out.println(d - ans);        }        out.flush();    }}
原创粉丝点击