zoukankan      html  css  js  c++  java
  • 【CodeForces】[606A]Magic Spheres

    CodeForces - 606A
    Time Limit: 2000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u


    Description

    Carl is a beginner magician. He has a blue, b violet and c orange magic spheres. In one move he can transform two spheres of the same colorinto one sphere of any other color. To make a spell that has never been seen before, he needs at least x blue, y violet and z orange spheres. Can he get them (possible, in multiple actions)?

    Input

    The first line of the input contains three integers ab and c (0 ≤ a, b, c ≤ 1 000 000) — the number of blue, violet and orange spheres that are in the magician's disposal.

    The second line of the input contains three integers, xy and z (0 ≤ x, y, z ≤ 1 000 000) — the number of blue, violet and orange spheres that he needs to get.

    Output

    If the wizard is able to obtain the required numbers of spheres, print "Yes". Otherwise, print "No".

    Sample Input

    Input
    4 4 0
    2 1 2
    
    Output
    Yes
    
    Input
    5 6 1
    2 7 2
    
    Output
    No
    
    Input
    3 3 3
    2 2 2
    
    Output
    Yes
    

    Hint

    In the first sample the wizard has 4 blue and 4 violet spheres. In his first action he can turn two blue spheres into one violet one. After that he will have 2 blue and 5 violet spheres. Then he turns 4 violet spheres into 2 orange spheres and he ends up with 2 blue, 1 violet and 2 orange spheres, which is exactly what he needs.


    初做题目的感想:【算法】算法是一种思维

    英语理解问题
    题目要求没读懂 以为是问上面的数据能否通过变换变成下面的数据
    结果是只需要大于等于下面的就好了 -.-
    所以我说我怎么一直 WA 
    英语是硬伤啊 
    然后读懂之后……
    这题好水啊……

    我说怎么一个个AC这么快


    #include<stdio.h>
    int main() {
    	int a,b,c,x,y,z;
    	while(scanf("%d %d %d",&a,&b,&c)!=EOF) {
    		scanf("%d %d %d",&x,&y,&z) ;
    		int sum1=0;
    		int sum2=0;
    		if(a>x)
    			sum1+=(a-x)/2;
    		else
    			sum2+=x-a;
    		if(b>y)
    			sum1+=(b-y)/2;
    		else
    			sum2+=y-b;
    		if(c>z)
    			sum1+=(c-z)/2;
    		else
    			sum2+=z-c;
    		if(sum1<sum2)
    			printf("No
    ");
    		else
    			printf("Yes
    ");
    	}
    	return 0;
    }

     所以决定恶补英语-.-


    题目地址:【Codeforces】[606A]Magic Spheres

  • 相关阅读:
    Redis过期key是怎么样清理的?----互联网大厂面试题
    Docker容器引擎使用教程
    区块链算法
    MYSQL 常用语句与函数命令
    漏洞利用:验证绕过,XSS利用,Cookic盗用,文件上传
    小白网工入行要具备哪些基本技能?
    VMware中乌班图安装VMtools步骤
    防火墙技术原理-思维导图
    JAVA学习第一课-手工笔记
    DOS(磁盘操作系统)基本命令-思维导图
  • 原文地址:https://www.cnblogs.com/BoilTask/p/12569912.html
Copyright © 2011-2022 走看看