zoukankan      html  css  js  c++  java
  • A1058. A+B in Hogwarts

    If you are a fan of Harry Potter, you would know the world of magic has its own currency system -- as Hagrid explained it to Harry, "Seventeen silver Sickles to a Galleon and twenty-nine Knuts to a Sickle, it's easy enough." Your job is to write a program to compute A+B where A and B are given in the standard form of "Galleon.Sickle.Knut" (Galleon is an integer in [0, 107], Sickle is an integer in [0, 17), and Knut is an integer in [0, 29)).

    Input Specification:

    Each input file contains one test case which occupies a line with A and B in the standard form, separated by one space.

    Output Specification:

    For each test case you should output the sum of A and B in one line, with the same format as the input.

    Sample Input:

    3.2.1 10.16.27
    

    Sample Output:

    14.1.28

     1 #include<cstdio>
     2 #include<iostream>
     3 using namespace std;
     4 int main(){
     5     long long A[3], B[3] ,c, c1, c2, c3;
     6     scanf("%lld.%lld.%lld %lld.%lld.%lld", &A[2], &A[1], &A[0], &B[2], &B[1], &B[0]);
     7     c = A[2] * 17 * 29 + A[1] * 29 + A[0] + B[2] * 17 * 29 + B[1] * 29 + B[0];
     8     c1 = c / 17 / 29;
     9     c2 = (c / 29) % 17;
    10     c3 = c % 29;
    11     printf("%lld.%lld.%lld", c1, c2, c3);
    12     cin >> c;
    13     return 0;
    14 }
    View Code

    1、十分简单的进制转换题,两种方法,统一换算成最低位的单位求和,再换算。或者按照加法进位来做。注意最高位的取值达到了10^7,若用第一种方法,可能要使用long long存储。

    2、long long 型在输入和输出时为%lld。

  • 相关阅读:
    前端全链路优化总结
    到底使用字符数组还是字符串常量
    指针的误区
    指针
    函数使用初体验
    C语言函数使用小试牛
    十年研发经验工程师的嵌入式学习书籍大推荐与学习进阶路线
    TCP/IP协议前期的一知半解
    Ubuntu 16.04 LTS安装sogou输入法详解
    1/0信封——数据链路层,ARP及RARP
  • 原文地址:https://www.cnblogs.com/zhuqiwei-blog/p/8439243.html
Copyright © 2011-2022 走看看