OJ Board

You aren't taking into account sides and corners of the grid. You are accessing outside the array dimensions. For example, if there is a rock in the top left corner, you check up to see if there are scissors, you also check left...

I'm using backtracking to solve this problem and still I get TLE. For most inputs I've tried it finishes instantly, but some inputs take over a minute. I prune the search as suggested in the problem (stop at outer limits of -32000 and 32000, stop when division results in non-integer). I even keep ...

I got 80wpm then 84 wpm.

This one seems so easy, and yet I have WA for some reason. I've checked it over so many times and can't find the problem. Here is my code (sorry it's so long, but it should be straight-forward):


#include <stdio.h>
#include <stdlib.h>
#include <string.h>

main() {
char hand[13][4]; /* 13 cards ...

Thanks I found the problem. Apparently fflush() doesn't work on the judge or in Unix or something. Fixed now.

This input works.. it produces the following:
0: 0
1: 1 2
2:
3:
4:
5: 5 4 6
6:
7:
8: 8 7 9 3
9:
10: 10 11 12
11:
12:
13: 13
14: 14 17
15: 15
16: 16
17:
18: 18

This is correct is it not?

Hi I'm fairly new to this scene as I'm trying to get a team together from my University (Wilfrid Laurier in waterloo, ontario). I have been trying to solve problems from this site for about two weeks now, but seem to have some major problems.
My first question is about input and output in the ...

Thanks, that worked.

I've tested many different inputs(including the ones in the other posts on thsi board) and can't find the problem. I've double checked all my loops and they seem to be fine. This error is really stumping me. Here is my code:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX ...

My code works perfectly on my machine for all input that I've tested (big, small, different bases, negatives, zero). I use Dev-C++ so I use __int64 and %I64d on my computer and then before I submit I change to long long int and %lld. If I don't make this change, the OJ gives me compile error. But ...

I created one solution to this problem that generates TLE, so I worked out another solution, but that one generates MLE. I can't find any way to do this within the time and memory limits.
My first solution uses 2 arrays, the first to store all unique integers in the input order, the other to store ...