OJ Board

I would like to see support for other languages. I'm specifically interested in Python, but something like Perl, or Ruby, might be nice too.

All the problems I solve, I solve in C and/or C++, but sometimes it might be nice to worry more about the algorithm and less about the stuff that C/C++ force ...

sclo wrote:This problem can be solved by shortest path algorithms.

As a matter of fact, that's exactly the algorith I used.

I have a working solution in ~1.3 seconds, but someone has it in .174? Did they know judges output, or can someone help me with a faster algorithm?

My current algorithm builds a tree based on the bits in the numbers. Each node in the tree has a left (zero) and right (one) child, and a count of how ...

I thought I handled all the special cases.
#include <iostream>
using namespace std;
char lookup[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main(int argc, char *argv[])
{
unsigned long long f, t;
char num[256];
while (cin >> f >> t >> num) {
unsigned long long val = 0;
bool illegal = false ...

That little phrase "end of a blank or empty line" escaped me.
I didn't even notice that it was there for a while, and when I did, it caused a little grief. But now I'm AC!!!

The trick, for those who care, is that empty lines (lines with only spaces) should be converted to blank lines (a line with ...

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>

using namespace std;

int main(int argc, char *argv[])
{
int p, e, i;
int d;
int num = 0;
while (cin >> p >> e >> i >> d) {
if (p == e && e == i && i == d && d == -1 ...

Has anyone else noticed that the judging software seems to be running extremely slow lately, compared to normal. Even when its not busy, it says its only 16% idle.

Its been like this for at least 24 hours, maybe there is a run away process somewhere?

My first mistake was not including 1000000 in my pre calculations.

Fixed that and got AC

My first mistake was not including 1000000 in my pre calculations.

Fixed that and got AC

This does seem like an easy problem. Could it be a problem with the judges data? Are we missing something in the problem description?

Although, the spec says that there is a space before the first word part, and after the second word part on the next line.

I really wonder if the judges output data ...

Well, the algorithm I used is rather simple. I just construct a DFA tree for all "test" cases, and run the input through it. I still get .600 seconds though. Twice as long as the next person. Any idea's on how to speed it up (Not that it REALLY matters).

I wonder if my time is being used more in ...

Read carefully. I missed this the first time too.

The input has a known message, and an encoded message, seperated by a blank line...

It never says that the messages are only one line long though..
Input:
The car is blue. The car
is blue. The car is BLUE.

Wkh fdu lv eoxh. Wkh fdu
lv eoxh. Wkh ...

Lol, only 1226 more problems to solve before I'm anywhere near Adrian.
Well, I'm still proud of my 116 solved so far, and wanted to share it.

There are a few more I know I could solve, if I could understand LIS and LCS algorythms. Might just have to wait until I take some CS classes, 'cause I can't ...

I could be wrong, but I think that is 5 10ths of the time limit.
or, maybe 5 30ths? Something like that, anyway, if you notice, the "running(x)" message only has certain values for x, and if you constantly refresh, Running(x) becomes "TLE" when x gets to the limiting number (either 10 or 30, I ...

I keep getting WA, but all my test cases see to work okay.

-bash-2.05b$ cat data
1/2
18|3
18/3
4294967296|4294967295
4294967296|4294967295 / 16
4294967296|4294967295 * 1|16
4294967296|4294967295 - 1
(256*256/(256*256-3|3) - 6) + (3|4 * 4|3)
1|0
2|4 / 0
2|4 / (4 - 4)
2/4 * (1 / 0)
-bash-2.05b$ ./a ...