PAT A1058 A+B in Hogwarts
Sample Input:
3.2.1 10.16.27
Sample Output:
14.1.28
-
思路1:
简单加法模拟 -
code1:
#include <stdio.h>
int Galleon[3], Sickle[3], Knut[3];
int carry; //进位
int main(){
for(int i = 0; i < 2; ++i){
scanf("%d.%d.%d", &Galleon[i], &Sickle[i], &Knut[i]);
}
Knut[2] = (Knut[0] + Knut[1]) % 29;
carry = (Knut[0] + Knut[1]) / 29;
Sickle[2] = (Sickle[0] + Sickle[1] + carry) % 17;
carry = (Sickle[0] + Sickle[1] + carry) / 17;
Galleon[2] = Galleon[0] + Galleon[1] + carry;
printf("%d.%d.%d", Galleon[2], Sickle[2], Knut[2]);
return 0;
}
-
思路2:
以最小单位为标准,统一单位求和,再转换为原单位 -
code2:
#include <stdio.h>
int main(){
// int g, s, k, sum = 0; //!!!:Wrong 1: sum 使用int会溢出
long long g, s, k, sum = 0; //全要用long long 表示不然会发生进制转换 麻烦
for(int i = 0; i < 2; ++i){
scanf("%lld.%lld.%lld", &g, &s, &k);
sum += (g*17*29 + s*29 + k);
}
printf("%lld.%lld.%lld", sum/(17*29), (sum%(17*29))/29, sum%(17*29)%29);
return 0;
}
- T2 code:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Change(ll g, ll s, ll k){
return g * 17 * 29 + s * 29 + k;
}
void Print(ll x){
printf("%lld.%lld.%lld", x / 29 / 17, x / 29 % 17, x % 29);
}
int main(){
ll ag, as, ak, bg, bs, bk;
scanf("%lld.%lld.%lld %lld.%lld.%lld", &ag, &as, &ak, &bg, &bs, &bk);
ll sum_a = Change(ag, as, ak), sum_b = Change(bg, bs, bk);
Print(sum_a + sum_b);
return 0;
}
//样例2:long long 过 10^7*29*17超int范围
- T4 code:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll Change(ll x[])
{
return x[0] * 17 * 29 + x[1] * 29 + x[2];
}
ll Sum(ll a[], ll b[])
{
return Change(a) + Change(b);
}
void ShowAns(ll n)
{
printf("%lld.%lld.%lld", n / 29 / 17, n / 29 % 17, n % 29);
}
int main()
{
ll money[2][3];
for(int i = 0; i < 2; ++i)
{
for(int j = 0; j < 3; ++j)
{
scanf("%lld%*c", &money[i][j]);
}
}
ShowAns(Sum(money[0], money[1]));
return 0;
}