## Search found 63 matches

Wed Oct 26, 2005 4:23 pm
Forum: Volume 109 (10900-10999)
Topic: 10945 - Mother bear
Replies: 65
Views: 16954

### Re: 10945 - WA!

no test cases
Are you sure i & j ' s initial value = 0 ?
Tue Oct 25, 2005 6:32 am
Forum: Volume 1 (100-199)
Topic: 167 - The Sultan's Successors
Replies: 21
Views: 3622
Deno wrote:I submit it again today without any changes....I got accepted!!
Thank you.
you're welcome , I submited your code unchanged first and got wa then
, and then I changed width to setw and got ac
anyway ~ you get ac
Sun Oct 23, 2005 9:06 am
Forum: Volume 1 (100-199)
Topic: 167 - The Sultan's Successors
Replies: 21
Views: 3622
Deno wrote:Did my inquiry sound rude in anyway?
How come nobody replies...>.<
your output num is right , but the reason is output format
use cout << setw (5) ( include<iomanip> ) , you can just get ac ~
Sun Oct 16, 2005 7:02 am
Forum: Volume 109 (10900-10999)
Topic: 10940 - Throwing cards away II
Replies: 28
Views: 14310
Anonymous wrote:
Jan wrote:Just evaluate the values upto 50. And you will get a easy sequence. If you still dont find it then I will tell you.
thanks jan

I found "+2 sequence"
sorry , I forgot to login
Sun Oct 16, 2005 6:18 am
Forum: Volume 109 (10900-10999)
Topic: 10940 - Throwing cards away II
Replies: 28
Views: 14310

### 10940 - Throwing cards away II

my method is if n ==6 then 1. 1 2 3 4 5 6 ( n=6=even , so copy ar[1]..ar[3] to ar[0].., then n/=2 ) 2. 2 4 6 ( n==3==odd , so copy ar[end] to ar[0] , then copy ar[1]..a[3]....to ar[ 1]... ) 3 6 4 4 4 but it is too slow can someone give me some hint , thanks
Mon Oct 10, 2005 7:31 am
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 32232
your algorithm is right but your code is wrong for(i=0;i<=30000 && flag;i++) should be for(i=30000;i+1 && flag;i-- ) or use additional array the reason is if now data is 4 and u[2] is true then u[6] is true but then i = 6 , your code will make u[10] is true it means 4+4+2 sorry for my poor english h...
Sun Oct 09, 2005 7:25 pm
Forum: Off topic (General chit-chat)
Topic: How old are you? Statistics.
Replies: 121
Views: 175834
:-? Hi, I am 23 years old and my solve is 230 till now.... i started solving in april 2004....i am having bad time in the last 3 months...plz pray for me that i get my good time back :cry: age : 16 solved : 3xx time : 7month where from : taiwan what I m doing : study my hate subject for monthly tes...
Sun Oct 09, 2005 5:08 pm
Forum: Volume 109 (10900-10999)
Topic: 10929 - You can say 11
Replies: 69
Views: 26820

### Re: Why WA

iishaque wrote:Plz give some critical input and output. Can any one tell Is rimu's algorithm right or wrong??
Plz help!!!!!

Code: Select all

``````     just count num's odd digits sum - num's even digits sum
then check it%11
then use Jan's way ( thanks  :D ) if(r[0]=='0'&&r[1]=='\0') break;
``````
Mon Oct 03, 2005 2:27 pm
Forum: Volume 4 (400-499)
Topic: 490 - Rotating Sentences
Replies: 212
Views: 20543

### Re: 490 : why WA with this simple looking problem?

Code: Select all

``````            if ( sen[k][j] ) putchar(...)  ;
``````

Sun Oct 02, 2005 6:11 pm
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 14293

### Re: WA in 10926 [ how many dependencies ]

Hi, will anyone plz explain this case: 1 --> 2 --> 4 and 1 --> 3 --> 4 then will I consider 1's count = 3 ( i mean, will '4' be counted once) ? here is my algo, will anyone plz tell me why it fails. I am using dfs and DAG. i select a starting node and visit all the nodes i can visit. (not visiting ...
Sun Oct 02, 2005 12:20 pm
Forum: Volume 109 (10900-10999)
Topic: 10925 - Krakovia
Replies: 50
Views: 21646

### Re: try these..

try this case Input 2 3 9999 1 1 20 3 4 5 9999 999 99 9 0 0 Output Bill #1 costs 10000: each friend should pay 3333 Bill #2 costs 3: each friend should pay 0 Bill #3 costs 11106: each friend should pay 2221 thanks very much The reason is my "lazy bigint addition" I don't code right addition , so go...
Sun Oct 02, 2005 5:18 am
Forum: Volume 109 (10900-10999)
Topic: 10925 - Krakovia
Replies: 50
Views: 21646

### Re: sorry

Code: Select all

``````have AC
``````
Sun Oct 02, 2005 4:15 am
Forum: Volume 109 (10900-10999)
Topic: 10922 - 2 the 9s
Replies: 38
Views: 14269
Larry wrote:Thanks. I changed my input reading from gets to scanf and it worked. I guess there were spaces somewhere..
no , use gets can get ac
Sat Oct 01, 2005 7:46 pm
Forum: Volume 109 (10900-10999)
Topic: 10922 - 2 the 9s
Replies: 38
Views: 14269

### Re: 10922 - 2 the 9s

I keep getting WA, so I'm not sure if I'm understanding it right. f(999999999999999999999) = f(189) + 1 = f(18) + 2 = f(9) + 3 and since 9 has 9-degree 1 (as given), doesn't that contradict the first case? it should be It sholud be when input 999999999999999999999 We count f (189) sorry , I forgot ...
Sat Oct 01, 2005 6:11 pm
Forum: Volume 109 (10900-10999)
Topic: 10925 - Krakovia
Replies: 50
Views: 21646

### 10925 - Krakovia

Can you give me some testdata , I don't know where wrong in my code

thanks