Submission #57990215

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int INF = 1e18;

int power(int a, int b) {
	if(b == 0) {
		return 1;
	}
	if(b == 1) {
		return a;
	}
	int x = power(a, b / 2);
	x *= x;
	if(b & 1) {
		x *= a;
	}
	return x;
}

void Solve() 
{
	int m;
	cin >> m;
	vector<int> ans;
	for(int i = 10; i >= 0; i--) {
		while(power(3LL, i) <= m) {
			m -= power(3LL, i);
			ans.push_back(i);
		}
	}
	cout << ans.size() << "\n";
	for(int i: ans) {
		cout << i << " ";
	}
	cout << "\n";
}

int32_t main() 
{
	auto begin = std::chrono::high_resolution_clock::now();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	// cin >> t;
	for(int i = 1; i <= t; i++) 
	{
		//cout << "Case #" << i << ": ";
		Solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    //cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
	return 0;
}

Submission Info

Judge Result