zoukankan      html  css  js  c++  java
  • HDU

     

    Description

    There must be many A + B problems in our HDOJ , now a new one is coming. 
    Give you two hexadecimal integers , your task is to calculate the sum of them,and print it in hexadecimal too. 
    Easy ? AC it !
     

    Input

    The input contains several test cases, please process to the end of the file. 
    Each case consists of two hexadecimal integers A and B in a line seperated by a blank. 
    The length of A and B is less than 15.
     

    Output

    For each test case,print the sum of A and B in hexadecimal in one line. 
     

    Sample Input

    +A -A +1A 12 1A -9 -1A -12 1A -AA
     

    Sample Output

    0 2C 11 -2C -90
     



    #include <cstdio>
    #include <cmath>
    #include <cstdlib>
    
    int main()
    {
        long long int x, y;
        while(~scanf("%llx %llx", &x, &y)){
            if(x+y < 0) printf("-%llX
    ", -(x+y));
            else printf("%llX
    ", x+y);
        }
        return 0;
    }


  • 相关阅读:
    Out of Hay POJ
    Sum Problem hdu 1001
    N! hdu 1042
    线性表的链式表示和实现(插入删除建空合并)
    NYOJ 1007
    NYOJ 954
    NYOJ 998
    NYOJ 455
    NYOJ 975
    数据结构复习0---线性表
  • 原文地址:https://www.cnblogs.com/kunsoft/p/5312755.html
Copyright © 2011-2022 走看看