OJ Board

Brute force won't work on this. You need to employ some dynamic programming to solve this efficiently. That means you should create an array and store some already solved results. Then when update the ackerman function to do the ackfunct and then check the result to see if it is in the array. If it ...

That C code cannot possibly represent the C++ solution that was accepted. There is not one shred of dynamic programming there which is a key component to solving this problem. That looks like the brute force method which doesn't work in C or C++. Can I see the C++ code you submitted?

Per the above reply that is correct. Specify C++ in your header or get in the habit of using /* xxx */ comment style. I typically use the /* ...
style in both this and work so that when I work on both C and C++ programs I don't run into that problem (this has happened where I work sometimes where ...

[cpp]
/* @JUDGE_ID: 23756AW 400 C++ "IO Manipulators and Sorted Vector" */

/*
PROBLEM_ID: 400
SYNOPSIS:
This program has two real traps.
The first is that the last column in a row is equal the maximum
filename length. All the other preceding columns in the row are equal
to the maximum ...

Don't forget that if the blocks ocurr in the same stack that you ignore that command.