| Task: | Forth |
| Sender: | Grez |
| Submission time: | 2025-10-17 21:53:28 +0300 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | details |
| #2 | WRONG ANSWER | 0.00 s | details |
| #3 | WRONG ANSWER | 0.00 s | details |
| #4 | WRONG ANSWER | 0.00 s | details |
| #5 | WRONG ANSWER | 0.00 s | details |
| #6 | WRONG ANSWER | 0.00 s | details |
| #7 | WRONG ANSWER | 0.00 s | details |
| #8 | WRONG ANSWER | 0.00 s | details |
| #9 | WRONG ANSWER | 0.00 s | details |
| #10 | WRONG ANSWER | 0.00 s | details |
| #11 | WRONG ANSWER | 0.00 s | details |
| #12 | WRONG ANSWER | 0.00 s | details |
| #13 | WRONG ANSWER | 0.00 s | details |
Code
#include <iostream>
using namespace std;
int bitwidth(int x) {
int r = 0;
while (x >>= 1) { r++; }
return r;
}
int main() {
int num;
cin >> num;
int bits = __builtin_popcount(num);
int width = bitwidth(num);
cout << width * 2 + bits * 2 - 2 << endl;
int b=1;
while ((b+b)<=num) {
if (b & num) cout << "dup ";
cout << "dup + ";
b<<=1;
}
while (bits>1) {
cout << "+ ";
bits--;
}
cout << endl;
return 0;
}
Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 1 |
| correct output |
|---|
| 2 DUP DROP |
| user output |
|---|
| 0 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 2 |
| correct output |
|---|
| 2 DUP + |
| user output |
|---|
| 2 dup + |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 |
| correct output |
|---|
| 4 DUP DUP + + |
| user output |
|---|
| 4 dup dup + + |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 4 |
| correct output |
|---|
| 6 DUP DUP DUP + ... |
| user output |
|---|
| 4 dup + dup + |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 5 |
| correct output |
|---|
| 8 DUP DUP DUP DUP ... |
| user output |
|---|
| 6 dup dup + dup + + |
Test 6
Verdict: WRONG ANSWER
| input |
|---|
| 10 |
| correct output |
|---|
| 18 DUP DUP DUP DUP ... |
| user output |
|---|
| 8 dup + dup dup + dup + + |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 42 |
| correct output |
|---|
| 82 DUP DUP DUP DUP ... |
| user output |
|---|
| 14 dup + dup dup + dup + dup dup ... |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 64 |
| correct output |
|---|
| 126 DUP DUP DUP DUP ... |
| user output |
|---|
| 12 dup + dup + dup + dup + dup + ... |
Test 9
Verdict: WRONG ANSWER
| input |
|---|
| 90 |
| correct output |
|---|
| 178 DUP DUP DUP DUP ... |
| user output |
|---|
| 18 dup + dup dup + dup + dup dup ... |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 98 |
| correct output |
|---|
| 194 DUP DUP DUP DUP ... |
| user output |
|---|
| 16 dup + dup dup + dup + dup + du... |
Test 11
Verdict: WRONG ANSWER
| input |
|---|
| 99 |
| correct output |
|---|
| 196 DUP DUP DUP DUP ... |
| user output |
|---|
| 18 dup dup + dup dup + dup + dup ... |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 100 |
| correct output |
|---|
| 198 DUP DUP DUP DUP ... |
| user output |
|---|
| 16 dup + dup + dup dup + dup + du... |
Test 13
Verdict: WRONG ANSWER
| input |
|---|
| 95 |
| correct output |
|---|
| 188 DUP DUP DUP DUP ... |
| user output |
|---|
| 22 dup dup + dup dup + dup dup + ... |
