zoukankan      html  css  js  c++  java
  • 1058. A+B in Hogwarts (20)

    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

    #include<iostream>
    #include<cstdio>
    using namespace std;
    int main(){
    	int Galleon1,sickle1,knut1;
    	int g_sum=0,s_sum=0,k_sum=0;
    	scanf("%d.%d.%d %d.%d.%d",&Galleon1,&sickle1,&knut1,&g_sum,&s_sum,&k_sum);
    	g_sum+=Galleon1;
    	s_sum+=sickle1;
    	k_sum+=knut1;
    	int flag = k_sum/29;
    	k_sum = k_sum%29;
    	s_sum+=flag;
    	flag=s_sum/17;
    	s_sum=s_sum%17;
    	g_sum+=flag;
    	printf("%d.%d.%d
    ",g_sum,s_sum,k_sum);
    	return 0;
    }
    

      

  • 相关阅读:
    文件传输-一个大文件传输
    日志模块-logging模块
    加密模块hashlib
    面向对象进阶-反射
    面向对象
    模块和包
    作业-学生管理系统
    Java 链表反转
    Haoop MapReduce 的Partition和reduce端的二次排序
    Hadoop 笔记1 (原理和HDFS分布式搭建)
  • 原文地址:https://www.cnblogs.com/grglym/p/7725203.html
Copyright © 2011-2022 走看看