• AtCoder Beginner Contest 113 A


    A - Discount Fare


    Time limit : 2sec / Memory limit : 1024MB

    Score: 100 points

    Problem Statement

    There is a train going from Station A to Station B that costs X yen (the currency of Japan).

    Also, there is a bus going from Station B to Station C that costs Y yen.

    Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.

    How much does it cost to travel from Station A to Station C if she uses this ticket?

    Constraints

    • 1≤X,Y≤100
    • Y is an even number.
    • All values in input are integers.

    Input

    Input is given from Standard Input in the following format:

    X Y
    

    Output

    If it costs x yen to travel from Station A to Station C, print x.


    Sample Input 1

    Copy
    81 58
    

    Sample Output 1

    Copy
    110
    
    • The train fare is 81 yen.
    • The train fare is 58 ⁄ 2=29 yen with the 50% discount.

    Thus, it costs 110 yen to travel from Station A to Station C.


    Sample Input 2

    Copy
    4 54
    

    Sample Output 2

    Copy
    31

    #include <iostream>
    #include <algorithm>
    #include <cstring>
    #include <cstdio>
    #include <vector>
    #include <queue>
    #include <stack>
    #include <cstdlib>
    #include <iomanip>
    #include <cmath>
    #include <cassert>
    #include <ctime>
    #include <cstdlib>
    #include <map>
    #include <set>
    using namespace std;
    #pragma comment(linker, "/stck:1024000000,1024000000")
    #define lowbit(x) (x&(-x))
    #define max(x,y) (x>=y?x:y)
    #define min(x,y) (x<=y?x:y)
    #define MAX 100000000000000000
    #define MOD 1000000007
    #define pi acos(-1.0)
    #define ei exp(1)
    #define PI 3.1415926535897932384626433832
    #define ios() ios::sync_with_stdio(true)
    #define INF 1044266558
    #define mem(a) (memset(a,0,sizeof(a)))
    int main()
    {
        int x,y;
        cin>>x>>y;
        cout<<x+y/2<<endl;
        return 0;
    }
  • 相关阅读:
    Spring面试,IoC和AOP的理解
    WEB打印(jsp版)
    Spring事务管理机制的实现原理-动态代理
    spring面试题
    oracle PLSQL基础学习
    oracle创建表空间
    WM_CONCAT字符超过4000的处理办法
    Oracle 数据泵使用详解
    Oracle 数据泵详解
    linux下启动oracle
  • 原文地址:https://www.cnblogs.com/yinghualuowu/p/9906666.html
Copyright © 2020-2023  润新知