OJ Board

OK, works for me :D, thank you!

Hello chrismoh!

Well, for sample graph from IOI task, DFS will give following edges:

Orginal:
+
|
|
|
+------+
| | \
| | +
| | /
+------+

DFS:
+ (1)
|
|
|
+ (2) + (5)
| | \
| | + (6)
| |
+ (3)--+ (4)

By your algo, edge 5 have an even degree, now remove (4, 5).
Now, 3 has an even number, so ...

Mamun, thank You very much. I finnaly got AC (about 7.8 sec). :D

The problem was in 9999998. Anybody who stuck in TLE and has got fast sieve should try this input.

Thank you again!

Thank you for reply!

If I understood You, Mamun, here

if (n % 2 == 1 && isprime (n - 2))
{
printf ("%d is the sum of %d and %d.\n", n, 2, n - 2);
goto end;
}
I check wheter is number is odd, and if it is odd hen I do what You said.

i can be odd here for some even n and continues to be odd ...

My modified code:

Thank you, mamun. I fix that, but it is still TLE.

I tested it on input 99999999, it gets immediatly the result.
Sieving takes about 3-4 secs at me (2.8GHz).

Can sieve be faster?

Regards,
PY

Hello, mf!
Thank you for the reply. I fixed my main function, but it's still TLE.
I tested big integers now, it's secondary fast.
Any ideas?

Hi all!

Well, I was searching around for sieve optimisation, and i was found it here:
http://online-judge.uva.es/board/viewtopic.php?p=6457&highlight=#6457

I implemet this, but I got TLE (> 30sec). It works perfect at me.

Here is the code:

#include <cstdio>
using namespace std;

#define MAX ...

Hello everybody!

I'm stuck in 727. My program passes all sample inputs on the boards. And i dont know where is the problem. Can anybodu help me?


#include <vector>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

/// FILE* fi ...

I got AC! Thank you very much, Solaris!

Hello!

What is wrong with my code?

It passes all test data I found on this forum.

chunyi81, thank you very much, i've got AC.
I don't even think that my mistake is so obivious
Thank you once more

Hello!

I have problems with my program :). Can anybody tell me what's wrong in the code. I use algorithm from Programming Challenges.


// 10042: Smith numbers

#include <cmath>
#include <iostream>
using namespace std;

typedef unsigned long inte;

inte sum (inte n)
{
inte r = 0;
while (n ...

Hello there.

Well, i have problem with 10530 (alwats WA). I test the program with all sample inputs here, but it doesn't work. Can anybody help me?

There is a code in cpp:
#include <cstdio>
#include <cstring>
using namespace std;

int main (void)
{
int number, h = 11, l = 0;

char word[20 ...