OJ Board

I believe my code is working according what he said too. But I'll check again just in case. Thank you for your contribution!

Hello there,

I've come to a solution on the Ceasar's Cypher Problem and I keep getting WAs. I took care of the litle trick you guys mentioned so now in my solution, when there are linewraps I omit the leading blanks and in each line the 61st character is being wrapped. The 60th of each line is ...

Well you can see it as a tree but I believe that the total height is formed by both internal and external nodes.

Anyhow by having a glance at your code I could't understand what you're doing!

Would you mind extending in natural language?

Be well

I seem to get RTE too. Here is my code so if anybody sees something wrong, let me know guys!

Thanks in advance!


#include <stdlib.h>
#include <iostream.h>
#include <math.h>

int main()
{

unsigned int initialCatsHeight;
unsigned int nofWorkingCats;

int upperLimit = 200;
int allInputs[1000 ...