OJ Board

Problem solved. Used arrays rather than vectors.

Hey, I implemented a solution similar to matrix-chain multiplication. Because it is an O(n^3) algorithm, and n is at most 51, I shouldn't have to worry about anything else, right? I have no idea what is wrong. Here is my code:


// Headers, etc...

#define in cin

using namespace std;

vector<int ...

This one, 3079 - Anti-prime sequences, is from the East Central (North America) regionals.

My friend and I decided to take a backtracking approach, but apparently it isn't fast enough. What is the correct algorithm, and what did we do wrong?


#include <iostream>
#include <fstream>
#include ...