OJ Board

Can someone explain to me why "CBG" is alphabetically superior to "BGC"?

Edit: Never mind, I was doing it wrong.

mf wrote:For the input "1 1", the output should be "1 1 1".

BAH! I forgot to change "n = 1" to "a = 1" when I changed the return from n to a. I knew it was something small. Thank you!

Doing one case at a time is a good thing.

Testing goes like this - your program is given on its standard input (via file redirection) a file with input data, it has to run and produce a file with output data on standard output. That file is then compared with output from a reference solution. You ...

Looks like for n=113383, the integers generated in 3n+1 sequence will overflow 32-bit integers, and this somehow leads into an infinite periodic loop.

The problem statement says "no operation overflows a 32-bit integer", so you can assume that in judge's input there will be no test cases ...

Is there a way to do it, other than going through each individual number until j?
Actually that's good enough to get accepted. The problem with your code is that it does a lot of unnecessary work on lines 41-45 at each iteration, which severely affects its runtime - makes it quadratic instead of ...

Try giving your program an input with i=1, j=1000000 - it'll take many hours to complete, which is too much. Time limit is only 3 seconds.
Is there a way to do it, other than going through each individual number until j? There must be, because if not, then I can't see how you could do it in less ...

I keep getting TL, and I don't understand why. Can someone look at my code and tell me if they see something?


#include <iostream>
#include <string>
#include <sstream>
#include <vector>

using namespace std;

int nCalc (int i, int j)
{
int n, a = 0;
vector<int> x;

do
{
int di = i;

for (n ...