WA in ACPC10B

easy_taker 2012-11-16 21:10:40 UTC #1

i don't now why i'm getting WA in ACPC10B
spoj.pl/problems/ACPC10B/

deleted after ac

i think i did not undestand what the problem ask for , he want to find the (minimum) sum of the lengths of the two sequences.
is he mean that we generate the two sequences numbers until reach common number ,then find the sum of the 1st sequence leanth and the other leanth.
like in case 61 and 29
61 : 61, 37, 58, 89 (len =4 )
29 : 29, 85, 89 (len =3)

sum = 4 + 3 = 7

leppyr64 2012-11-20 21:28:17 UTC #2

Your understanding of what the problem is asking for is correct.

easy_taker 2012-11-21 01:34:50 UTC #3

leppy ! finally
i fix my code in :
1) i was have wrong in some cases like (20 50 , ans =11 ) correct (20 50 , ans =9)
20 : 20 42 145 89 (reversed)
50 : 50 25 29 85 89

2) new code is more readable

but even though WRONG ANSWER

new code :

deleted after ac

help

leppyr64 2012-11-21 02:44:59 UTC #4

Common is often not correct.

easy_taker 2012-11-25 10:35:23 UTC #5

thanx it's now AC

sidharthguglani 2013-01-30 12:40:02 UTC #6

getting WA please help
code modified.

Got Acc....

leppyr64 2013-01-30 14:11:49 UTC #7

Question all of your if statements.

sidharthguglani 2013-01-30 14:46:15 UTC #8

if(a==b) deals with number >=900 which are equal
A number >=900 will become <900 after first sum of squares of digits
I am generating all the numbers formed by 'a' till numbers start repeating and storing their position in pos array
then started forming numbers from 'b' and if it is already generated through 'a' then changing the min value accordingly

leppyr64 2013-01-30 16:20:20 UTC #9

That's only one if statement. That one happens to be correct. How about the rest of them.

sidharthguglani 2013-01-31 05:18:26 UTC #10

modified my code but still WA

I m first reducing numbers to <900 , while(a<900) and while(b<900) do this work.
then again checking for a==b.
first while(1) loop is generating all the numbers formed by 'a' and storing their location in pos array and if(pos[sum]!=0) is checking whether 'sum' is formed before or not if yes then break else store position.
second while(1) loop is generating numbers formed by 'b' and checking each number whether it is already formed by 'a' or not.
if(pos[b]!=0) checks whether number is formed by 'a' or not if yes then changing the value of min.
if(q[sum]!=0) is checking whether 'sum' is formed before or not by 'b'.
if(min==-1) if value of min remains -1 then the answer is 0.

leppyr64 2013-01-31 05:45:06 UTC #11

sidharthguglani 2013-01-31 08:06:02 UTC #12

for example a=1557 and b= 5751
check a and b if they are equal then min =2
ca and cb are 0 so answer =min+ca+cb=2
else
a 1^2 + 5^2 + 5^2 + 7^2 =100
b 5^2 + 7^2 + 5^2 + 1^2 =100
ca become 1
cb become 1
a become 100
b become 100
now check a==b if equal min=2
and answer= min+ca+cb=2+1+1=4
else
generate all the numbers from a
then generate number from b and check whether they have already formed by a or not

leppyr64 2013-01-31 10:23:24 UTC #13

printf("%d %d %d\n",aa,bb,min+ca+cb);

This line of code is where your wrong answer lies.

sidharthguglani 2013-01-31 12:50:32 UTC #14

silly mistakes again and again
Thanks sir , got accepted