Submission details
Task:Forth
Sender:Laakeri
Submission time:2025-10-18 01:23:53 +0300
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED100
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails

Code

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;

int check(vector<string> ans, int x){
	assert(ans.size()>=1);
	vector<int> s={1};
	for (string t : ans){
		if (t=="DUP"){
			assert(s.size()>=1);
			s.push_back(s.back());
		} else if (t=="+"){
			assert(s.size()>=2);
			int su=s.back()+s[(int)s.size()-2];
			s.pop_back();
			s.pop_back();
			s.push_back(su);
		} else if (t=="DROP"){
			s.pop_back();
		} else {
			assert(0);
		}
	}
	return s.size() == 1 && s.back()==x;
}

void solve(){
	int x;
	cin>>x;
	vector<int> s = {1};
	vector<string> ans;

	int ss=1;
	int su=1;
	int ba=1;
	for (int i=0;i<23;i++){
		if (su == x) break;
		assert(su<x);
		if ((1<<i) & x){
			ans.push_back("DUP");
			su+=ba;
			ss++;
			if (su==x) break;
			ans.push_back("DUP");
			su+=ba;
			ss++;
			if (su==x) break;
			ans.push_back("+");
			ba*=2;
			ss--;
		} else {
			ans.push_back("DUP");
			su+=ba;
			ss++;
			if (su==x) break;
			ans.push_back("+");
			ba*=2;
			ss--;
		}
	}
	assert(su==x);
	while (ss>1){
		ans.push_back("+");
		ss--;
	}
	if (x==1){
		ans.push_back("DUP");
		ans.push_back("DROP");
	}
	assert(check(ans,x));
	cout<<ans.size()<<endl;
	for (auto t : ans){
		cout<<t<<" ";
	}
	cout<<endl;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	solve();
}

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
2
DUP
DROP

user output
2
DUP DROP 

Test 2

Verdict: ACCEPTED

input
2

correct output
2
DUP
+

user output
2
DUP + 

Test 3

Verdict: ACCEPTED

input
3

correct output
4
DUP
DUP
+
+

user output
4
DUP DUP + + 

Test 4

Verdict: ACCEPTED

input
4

correct output
6
DUP
DUP
DUP
+
...

user output
4
DUP + DUP + 

Test 5

Verdict: ACCEPTED

input
5

correct output
8
DUP
DUP
DUP
DUP
...

user output
6
DUP DUP + DUP + + 

Test 6

Verdict: ACCEPTED

input
10

correct output
18
DUP
DUP
DUP
DUP
...

user output
8
DUP + DUP DUP + DUP + + 

Test 7

Verdict: ACCEPTED

input
42

correct output
82
DUP
DUP
DUP
DUP
...

user output
14
DUP + DUP DUP + DUP + DUP DUP ...

Test 8

Verdict: ACCEPTED

input
64

correct output
126
DUP
DUP
DUP
DUP
...

user output
12
DUP + DUP + DUP + DUP + DUP + ...

Test 9

Verdict: ACCEPTED

input
90

correct output
178
DUP
DUP
DUP
DUP
...

user output
18
DUP + DUP DUP + DUP + DUP DUP ...

Test 10

Verdict: ACCEPTED

input
98

correct output
194
DUP
DUP
DUP
DUP
...

user output
16
DUP + DUP DUP + DUP + DUP + DU...

Test 11

Verdict: ACCEPTED

input
99

correct output
196
DUP
DUP
DUP
DUP
...

user output
18
DUP DUP + DUP DUP + DUP + DUP ...

Test 12

Verdict: ACCEPTED

input
100

correct output
198
DUP
DUP
DUP
DUP
...

user output
16
DUP + DUP + DUP DUP + DUP + DU...

Test 13

Verdict: ACCEPTED

input
95

correct output
188
DUP
DUP
DUP
DUP
...

user output
22
DUP DUP + DUP DUP + DUP DUP + ...