OJ Board

One of my friends is building a online judge himself. I asked if he could add Pascal to his accepted languages. He then ask me what compiler and version to use and what parameters settings should be added? I would prefer his judge to be as close to your judge as possible. So, if it is possible, can ...

It's been over 2 months now. Is my problem unsolvable? Or did you just overlooked my last message? If it is possible, would you still check and see if you can migrate my submission from the old juge for me?

It is 62927. Thank you!

I tried to migrate my submission from the old judge today. I followed the 'migrate submissions' link and was told 99 24 hour judge submissions was migrated. However, when I checked my stats, only 1 out of the 99 submissions was migrated.

my stats page:
http://icpcres.ecs.baylor.edu/onlinejudge ...

I've got a lot of WAs, could someone give me some test data please?

I found the same thing since 2008/4/21. I Thought the server was down or something. A few days later, I installed Fire Fox and access the server with it perfectly fine. Hence I install Fire Fox on every computer I use.

I was suspecting the same thing, but the problem states that 0<length(L)<10000, which should not be big enough to make s into a negative value. I am still confused.

Never mind, I forgot to put a blank line between two cases.

For the first and last line of "___________", you should not output anything. But your code ouputs '\0' for those lines of input.

Amr Saqr,

I don't know why you got TLE, but your code got AC with 0.040s after the following block is deleted.

if (flag)
{
check="";
for (int s=input.size()-1;s>=input.size()-root;s--)
for (int t=s;t>=0;t-=root)
check+=input[t];
if (input!=check)
flag=false;
}

I used Angga's algo but got WA. Can anyone tell me what went wrong with my code? Or give me some critical input to test. Thanks a lot!

Thanks a lot! This error is kind of hard to spot for a Pascal programmer like me.

Here's my code for "p565: Pizza Anyone?"

#include <iostream>
using namespace std;

int main() {
char ch;
int n, req[1][12], i, sat, j, tp;

// code deleted after AC

req[0][n] = req[1][n] = 0; // value of n is changed unexpectedly here.

// code deleted after AC
}
}

When I ran it in ...

Pascal's got fewer I/O function than C. Restricting the use of seekeof and seekeoln make it even fewer for Pascal programmers. Like in 825, it would be very handy if we can skip the spaces at the end of the line using seekeoln. Is it possible to lift this restriction?