zoukankan      html  css  js  c++  java
  • Code Forces 652A Gabriel and Caterpillar

    A. Gabriel and Caterpillar
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    The 9-th grade student Gabriel noticed a caterpillar on a tree when walking around in a forest after the classes. The caterpillar was on the height h1 cm from the ground. On the height h2 cm (h2 > h1) on the same tree hung an apple and the caterpillar was crawling to the apple.

    Gabriel is interested when the caterpillar gets the apple. He noted that the caterpillar goes up by a cm per hour by day and slips down by b cm per hour by night.

    In how many days Gabriel should return to the forest to see the caterpillar get the apple. You can consider that the day starts at 10 am and finishes at 10 pm. Gabriel's classes finish at 2 pm. You can consider that Gabriel noticed the caterpillar just after the classes at 2 pm.

    Note that the forest is magic so the caterpillar can slip down under the ground and then lift to the apple.

    Input

    The first line contains two integers h1, h2 (1 ≤ h1 < h2 ≤ 105) — the heights of the position of the caterpillar and the apple in centimeters.

    The second line contains two integers a, b (1 ≤ a, b ≤ 105) — the distance the caterpillar goes up by day and slips down by night, in centimeters per hour.

    Output

    Print the only integer k — the number of days Gabriel should wait to return to the forest and see the caterpillar getting the apple.

    If the caterpillar can't get the apple print the only integer  - 1.

    Examples
    input
    10 30
    2 1
    
    output
    1
    
    input
    10 13
    1 1
    
    output
    0
    
    input
    10 19
    1 2
    
    output
    -1
    
    input
    1 50
    5 4
    
    output
    1
    
    Note

    In the first example at 10 pm of the first day the caterpillar gets the height 26. At 10 am of the next day it slips down to the height 14. And finally at 6 pm of the same day the caterpillar gets the apple.

    Note that in the last example the caterpillar was slipping down under the ground and getting the apple on the next day.


    水题,模拟即可

    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <math.h>
    #include <stdio.h>
    
    using namespace std;
    int h1,h2;
    int a,b;
    int ans=0;
    int main()
    {
        scanf("%d%d",&h1,&h2);
        scanf("%d%d",&a,&b);
        h1+=a*8;
        if(h1>=h2)
            printf("0
    ");
        else if(h1<h2&&b>=a)
            printf("-1
    ");
        else if(h1<h2&&b<a)
        {
            int num1=(h2-h1)%((a-b)*12);
            if(num1==0)
                printf("%d
    ",(h2-h1)/((a-b)*12));
            else
                printf("%d
    ",(h2-h1)/((a-b)*12)+1);
        }
        return 0;
    }
    


  • 相关阅读:
    java 随机流
    java 缓冲流
    java 文件字符输入、输出流
    【JMeter4.0】之 “jdk1.8、JMeter4.0” 安装与配置以及JMeter永久汉化和更改界面背景、并附加附录:个人学习总结
    【Selenium + Python】自动化测试之发送邮件正文以及附件同时发送
    【Mysql】之视图操作
    【Mysql】Navicat For Mysql快捷键
    【Axure插件】之浏览器打开失败
    【Mysql】之基础sql语句模板
    C语言中malloc、free和new、delete的用法和区别
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228748.html
Copyright © 2011-2022 走看看