-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path4366.cpp
90 lines (87 loc) · 1.26 KB
/
4366.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
// 4366. 정식이의 은행업무
// 2019.07.08
#include<iostream>
#include<string>
using namespace std;
long long ans;
int main()
{
int t;
cin >> t;
for (int testCase = 1; testCase <= t; testCase++)
{
string a;
string b;
cin >> a >> b;
ans = 0;
long long aa = 0;
int cnt = 1;
// 2진수
for (int i = a.size() - 1; i >= 0; i--)
{
if (a[i] == '1')
{
aa += cnt;
}
cnt *= 2;
}
long long bb = 0;
// 3진수
cnt = 1;
for (int i = b.size() - 1; i >= 0; i--)
{
if (b[i] == '1')
{
bb += cnt;
}
else if (b[i] == '2')
{
bb += cnt * 2;
}
cnt *= 3;
}
int flag = 0;
for (int i = a.size() - 1; i >= 0; i--)
{
if (flag)
{
break;
}
long long tmpA = aa;
int k = 1 << (a.size() - i - 1);
if (a[i] == '1')
{
tmpA -= k;
}
else
{
tmpA += k;
}
cnt = 1;
for (int j = b.size() - 1; j >= 0; j--)
{
if (flag)
{
break;
}
long long tmpB = bb;
int k = b[j] - '0';
tmpB -= k * cnt;
for (int x = 0; x < 3; x++)
{
int tmp = tmpB;
tmp += x * cnt;
if (tmpA == tmp)
{
ans = tmpA;
flag = true;
break;
}
}
cnt *= 3;
}
}
cout << "#" << testCase << " " << ans << endl;
}
return 0;
}