AcWing 5307. 小苹果
原题链接
简单
作者:
白茶坔乌龙
,
2024-01-13 13:06:35
,
所有人可见
,
阅读 41
#include <iostream>
#include <cstring>
#include <vector>
#include <cmath>
#include <unordered_set>
#include <set>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 1e5 + 5;
void solve() {
int n;
cin >> n;
int t = n;
int res = 1;
while (n % 3 != 1) {
res++;
n -= (n + 2) / 3;
}
int l = 0;
while (t) {
l++;
t -= (t + 2) / 3;
}
cout << l << " " << res <<endl;
}
int main() {
// int T;cin >> T;while(T--) solve();
solve();
return 0;
}