OJ Board

adelar

Hi Ron,
the AC output is:

S0
11
--
S0
0
--
S0

11
S0
--
00
--
S0

SSS11
SS111
SS---
SSS11
SS11
S11
-----
10101

S = space (" ")

adelar

Hi Ron,
try this input:

Code: Select all

0 11
11 0
0 0

output:

Code: Select all

 0
11
--
 0
0
--
 0

11
 0
--
00
--
 0

adelar

Hi,
this problem accept multiple output?

thanks,

adelar

Hi 898989,
try this.
use the output:

Code: Select all

A\n\n
A\n\n
A\n

and don't:

Code: Select all

A\n\n
A\n\n
A\n\n    <---- \n  :o

perhaps work.

[/quote]

adelar

The code take PE in problem 10414

#include <iostream>
using namespace std;
int
main(){
cout << "something" << endl;
}

this is strange. Why this happens?

adelar

Hi shakil,
is missing:

Code: Select all

#include <stdlib.h>

[]'s

adelar

Thanks Jan,
only to confer...
again was AC in 5.??? seconds, and now show TLE.

this algorithm is correct?

Code: Select all

  if(even(graph) || !conected(graph))
     "some beads may be lost"
  else
      print euler path;

thanks in advance...

adelar

Hi friends,
someone have inputs and outputs AC to this problem?

thanks in advance.

adelar

Hi friends,

uzioriluzan wrote: As shahriar_manzoor intended, if there is an odd number of odd numbers, there will be no solution.
The other cases, a combination of all possibilities will do, as .. said.

this work in this problem?

thanks in advance

adelar

Thaks,

I take AC.
the output is:

Code: Select all

Today is: 31 12
 31 12 *TODAY* New Year Eve
  1  1 ******* New Year Again
  1  1 ******  New Year
  2  1 ***     Nothing

thanks in advance

adelar

Hi friends, someone have AC output to this input? 1999 A 23 12 5 Partner's birthday A 25 12 7 Christmas A 20 12 1 Unspecified Anniversary A 25 12 7 Christmas So Important A 26 12 6 Boxing Day A 26 12 6 Christmas Eve + 2 A 1 1 6 New Year A 31 12 6 New Year Eve A 1 1 7 New Year Again A 2 1 4 Nothing A...

adelar

Hello,
thanks saman_saadi and sclo

I got AC

adelar

Hi saman_saadi,
thank you by the hint

here is my code. it's use emotional blind recurrence:

Code: Select all

AC

input:

Code: Select all

output:

Code: Select all

6
62
625

you can to see my error?
thanks.

adelar

Hi,
thank you.
I have a algorithm that solve this problem, but with segmentation fault. I'm implementing with BigInt. There is other way?
thank you.

adelar

hi,
always have solution for all inputs?
thanks in advance.

OJ Board

Search found 35 matches

Re: 11403 - Binary Multiplication

Re: 11403 - Binary Multiplication

perhaps

pe and don't wa

Why CE...

TLE

932 - Checking the N-Queens Problem

Re: Thanking words!

AC

output?

AC

+/-wa

...

wa