OJ Board

I am really ashamed that I didn't find this. I already solved similar problems, so this should have been easy for me I'm ashamed I didn't think about it in contest time when I knew that Xn = pXn-1 + qXn-2. i am ashamed too, but just the opposite reason you are. i could NEVER solve this problem if y...

1 vtz ud xnm xugm itr pyy jttk gmv xt otgm xt xnm puk ti xnm fprxq xnm ceuob lrtzv ita hegfd tsmr xnm ypwq ktj frtjrpgguvj otvxmdxd prm iev prmvx xnmq awerwaerwrwa now is the time for all good men to come to the aid of the party the quick brown fox jumps over the lazy dog programming contests are f...

david,
you can check this input:

input wrote: 8
5 3
8 8

output wrote: 0 1

but your code outputs "failed" for this input.

check this input and output:

input wrote: 5 9
1 10
0 0

output wrote: 2 -1 1
1 0 1

i think these case you just swap x and y. but doing these, does the given equation ax+by=d satisfY?

i precalcuate the prime but did not precalculate the charmical number . i check every time. it is Accepted but it takes large time 1.450 sec. when i got n , i check whether it is prime or not. next check from 2 to n-1 if i got any other answer than a^n mod n= a, i break the loop. to calculate a^n mo...

sohel,
i Accepted this problem. But my program runs not so fast.

any way, i think you determine all path. You don't have to do that if you use shortest path algorithm. This can minimize your time enough.

check for this input and output:
input:

1
2
ab
abc

output:

• 3
  ab
  abc

CDiMa, i am very very interested about your Algorithm. would you please explain it more clearly. i can't recover your hints :oops: i have hardly managed to Accpeted this code within timelimit. My Accepted code run more than 6sec :roll: i have no knowledge how the other people solved this prolbem in ...

oh i forgot to say other things.

The initaial position of two people is adjecent of all the input data. ( i don't know if they are in same initial position or not. but i consider that case in my code. )

HI , RuiFerreira,

There is no test case such k=0;
and your outpur for your input mentioned earliar is same as my Accpeted code's output.


PS: i like your web site to compare two user . It's really nice

It is very annoying about the behavior of the judge for this problem 164. i got many WA and after that i have to read the board to do The backtracking as C-D-I and got ACC. isn't it silly? i just change some if-else statement's order. and also C-D-I is ordered when i backtrack , it is not actually t...

thanks all for replying me.

After rejudging the problem all of my previous WA got AC.

thanks again.

Noim, I was not sure if you had got accepted because of this sentence: Quote: first i have determined the lcs string for the input string and the reverse of input string---------> this is my quotation. This would give an LCS of abcd from abcdcbad, the lcs of abcdcbad and it's reverse string is NOT ...

Noim, did you get AC ? :wink: what do you think i give hints in this page, one year ago, without accepting the program?? look at my input statement of my ac program: scanf("%s", &input[1]); what do this prove? no need to see for a blank line. i don't think there is any meaningless inp...

you can check for following input:

aaaab
abbbb
ababab
aaaaa
abbcdba