Codeforces 1114AGot Any Grapes?

Posted awcxv

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Codeforces 1114AGot Any Grapes?相关的知识,希望对你有一定的参考价值。

【链接】 我是链接,点我呀:)
【题意】


水题

【题解】


哪个比较挑剔优先给他选>_<

【代码】

import java.io.*;
import java.util.*;

public class Main {
    
    static int N = (int)1e6;
    static InputReader in;
    static PrintWriter out;
        
    public static void main(String[] args) throws IOException{
        //InputStream ins = new FileInputStream("E:\rush.txt");
        InputStream ins = System.in;
        in = new InputReader(ins);
        out = new PrintWriter(System.out);
        //code start from here
        new Task().solve(in, out);
        out.close();
    }
    
    static class Task{
        public void solve(InputReader in,PrintWriter out) {
            int x,y,z;
            int a,b,c;
            x = in.nextInt();y = in.nextInt();z = in.nextInt();
            a = in.nextInt();b = in.nextInt();c = in.nextInt();
            if (x>a) {
                out.println("NO");
                return;
            }
            //x<=a;
            a-=x;
            if (y>a+b) {
                out.println("NO");
                return;
            }
            //y<=a+b
            if (z>a+b+c-y) {
                out.println("NO");
                return;
            }
            out.println("YES");
        
        }
    }

    

    static class InputReader{
        public BufferedReader br;
        public StringTokenizer tokenizer;
        
        public InputReader(InputStream ins) {
            br = new BufferedReader(new InputStreamReader(ins));
            tokenizer = null;
        }
        
        public String next(){
            while (tokenizer==null || !tokenizer.hasMoreTokens()) {
                try {
                tokenizer = new StringTokenizer(br.readLine());
                }catch(IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}

以上是关于Codeforces 1114AGot Any Grapes?的主要内容,如果未能解决你的问题,请参考以下文章

CodeForces Contest #1114: Round #538 (Div. 2)

CodeForces - 1114D Flood Fill (区间dp)

Codeforces 1114B (贪心)

Codeforces 1114E(数学+随机算法)

codeforces-1114F-线段树练习

Codeforces Round #538 (Div. 2) (CF1114)