1058. A+B in Hogwarts (20) -- 数据范围问题

题目地址：http://www.patest.cn/contests/pat-a-practise/1058

/*
int ,long , long long类型的范围

unsigned   int   0～4294967295   
int   2147483648～2147483647 
unsigned long 0～4294967295
long   2147483648～2147483647
long long的最大值：9223372036854775807
long long的最小值：-9223372036854775808
unsigned long long的最大值：18446744073709551615

__int64的最大值：9223372036854775807
__int64的最小值：-9223372036854775808
unsigned __int64的最大值：18446744073709551615
*/
#include <stdio.h> 

long long total(int a, int b ,int c)
{
    return (long long)a*17*29 + b * 29 + c;
}
int main()  
{  
    //freopen("in.txt","r",stdin);
    //Galleon.Sickle.Knut 17 29
    int g1,s1,k1;
    int g2,s2,k2;
    scanf("%d.%d.%d" , &g1, &s1, &k1);
    scanf("%d.%d.%d" , &g2, &s2, &k2);
    long long sum = total(g1,s1,k1) + total(g2,s2,k2);
    int g = sum / (17 * 29);
    int s = sum / 29 - g*17;
    int k = sum % 29 ;
    printf("%d.%d.%d\n" , g, s, k);
    return 0;  
}