OJ Board

It is not that x^0 + 1 = 1 + 1 = 1.

Try to div by x^0 + 1:

x^2 - x^2
-------------------
x^2 + 2x + 4 : x^0 + 1
-x^2 - x^2
-------------------
-x^2 + 2x + 4
+x^2 + x^2
-------------------
x^2 + 2x + 4

you got a neverending loop.

Ok, I defined my own max and switched to cstdio and I got it

dev-cpp.

since when or is undeclered ?

which header i have to include to get max in gcc then?

Could someone compile it using gcc and show me what is wrong (since it works in dev-cpp).

#include <cstdlib>
#include <iostream>

using namespace std;

typedef struct {
int len;
char digits[100];
} bint;

bint *results[251];

void init_bint(bint *b)
{
for( int i = 0; i < 100; i++ )
b->digits[i ...

I guess too many for and while ;P

I made it this way:

1. get primes into array
2. if n lower then 5 - not sum
3. if n is odd
3.1 if n-2 is prime - sum of 2 and n-2
3.2 else not sum
4. if n is even get half of it and serach for first prime bigger and lower then n/2
4.1 if sum of them is n - sum of ...

Could anyone take a look and tell me why I got CE? (it works on my computer)

// cut...

Ok, I made it using other way

#include <cstdlib>
#include <iostream>
#include <list>

using namespace std;

int main(int argc, char *argv[])
{
int n, m, l, r, d, w, c = 0, x = 0;
list<int> lista;

while( cin >> n >> m ) {
if( n == 0 and m == 0 )
break;


int *students[n+1];
int religions[n+1], temp[n+1];
c++; d = 1 ...