OJ Board

Hi, i trying to solve this problem by a brute force implementation, I use binary trees via struct, but I got a RTE signal 11. The input line buffer is large enough but I dont know where the problem is. Someone may help me?

I really appreciate any input to replicate the error.


#include <stdlib.h ...

hi it's the problem ourboros snake,

i saw as a simple bit manipulation problem but uva don't thing equal.
this is my code :

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

#define ulong unsigned long long

/* 10040 */
ulong doit(int n,int k){
ulong ret=0;
ulong mask=0x01;
ulong masks=0x00;
ulong ...

Hi, I need help
i try to solve Peter's calculator (198), but i receive a compiler error.

Here are the compiler error messages:

gcj: Internal compiler error: program jc1 got fatal signal 11

i compile in linux red hat 9, and no problems

the code is this:

import java.io.*;
import java.util ...