Search found 48 matches

by joy
Wed Jul 09, 2008 4:20 am
Forum: Volume 9 (900-999)
Topic: 926 - Walking Around Wisely
Replies: 20
Views: 11554

Re: 926 - Walking Around Wisely

try this:

Code: Select all

1
3
1 1
3 3
2
2 3 S
3 2 W
by joy
Fri Jul 04, 2008 8:30 am
Forum: Volume 114 (11400-11499)
Topic: 11450 - Wedding shopping
Replies: 14
Views: 6340

Re: 11450 - Wedding shopping

thanks...
good problem :P
by joy
Thu Jul 03, 2008 10:45 pm
Forum: Volume 114 (11400-11499)
Topic: 11450 - Wedding shopping
Replies: 14
Views: 6340

Re: 11450 - Wedding shopping

I use DP, but can't understand why WA... plz give some I/O...

Code: Select all

ACC... :)

by joy
Tue Mar 25, 2008 4:03 am
Forum: Volume 101 (10100-10199)
Topic: 10199 - Tourist Guide
Replies: 57
Views: 30988

thankss andmej ...
I was sooo.... :-?
by joy
Fri Mar 21, 2008 4:02 am
Forum: Volume 101 (10100-10199)
Topic: 10199 - Tourist Guide
Replies: 57
Views: 30988

I cn't find where is the problem... It passes all the I/O in this forum...
plz help..

Code: Select all

ACC......  
:D
by joy
Wed Mar 19, 2008 8:52 pm
Forum: Volume 7 (700-799)
Topic: 796 - Critical Links
Replies: 54
Views: 22509

WA

Code: Select all

ACC..

:)

I don't understand why WA!!! plz help
by joy
Sun Sep 09, 2007 9:36 pm
Forum: Volume 106 (10600-10699)
Topic: 10670 - Work Reduction
Replies: 10
Views: 7585

WA

I dont understand why this code is wrong... plz help.. i got too many WA #include<stdio.h> #include<string.h> #include<stdlib.h> char name[105][22], str[88], ss[77]; int cst[105][4]; int callcost(int n, int rem, int x, int y) { int cost=0; while((n+1)/2 >= rem && n!=rem) { if(y < x*((n+1)/2)) cost+=...
by joy
Tue Aug 28, 2007 9:28 pm
Forum: Volume 112 (11200-11299)
Topic: 11240 - Antimonotonicity
Replies: 33
Views: 12316

WA

I got WA... please help me... i cannot find any wrong #include<stdio.h> int a[30005]; void main() { int t, test, j, cnt, max, i, n; scanf("%d", &test); for(t=0; t<test; t++) { max=0; scanf("%d", &n); for(i=0; i<n; i++) scanf("%d", &a[i]); for(i=0; i<n; ) { cnt=1; for(j=i+1; j<n; j++) { if(i%2==j%2) ...
by joy
Wed Mar 07, 2007 8:18 pm
Forum: Off topic (General chit-chat)
Topic: I win !!
Replies: 361
Views: 123139

:roll:
:lol:
:lol: 8) 8) 8)
by joy
Fri Jan 26, 2007 2:26 pm
Forum: Volume 102 (10200-10299)
Topic: 10229 - Modular Fibonacci
Replies: 53
Views: 17072

Hi Could anyone tell me how to solve tihs problem ? I've got our Fn by using O(lg) algorithm and I know that (a*b*c)%n==((a%n)*(b%n)*(c%n))%n but I don't know how to use it? Should I find prime factors of this number and use them to calculate Fn%m - I think that 2147483647th fibbonacii is too big f...
by joy
Tue Jan 23, 2007 6:23 pm
Forum: Off topic (General chit-chat)
Topic: I win !!
Replies: 361
Views: 123139

Code: Select all

                        /\
                      /    \
                    /   ^ ^  \
                  /      v     \
                /................\
********************************
*******KEEP POSTING*************
********************************
by joy
Sun Jan 21, 2007 2:00 pm
Forum: Volume 111 (11100-11199)
Topic: 11164 - Kingdom Division
Replies: 6
Views: 3079

try these input: 4 6 9 6 7 15 thanks for ur reply ...... but wiil be the output for this input... i got negetive output is it: Poor King! i have changed my code: Acc.... some input and out put: input: 0 4 5 0 5 0 0 9 7 5 6 0 0 0 0 4 98 5 98 5 69 -1 34 3 output: Set 1: 0.0000 Set 2: 0.0000 Set 3: 0....
by joy
Sun Jan 21, 2007 3:51 am
Forum: Volume 111 (11100-11199)
Topic: 11164 - Kingdom Division
Replies: 6
Views: 3079

11164 - Kingdom Division

Anyone can give me some tricky testcases ?
I got WA....

here is my code:

Code: Select all

 Acc......
please help...
by joy
Sat Jan 13, 2007 12:18 pm
Forum: Volume 100 (10000-10099)
Topic: 10010 - Where's Waldorf?
Replies: 42
Views: 18051

First search your problem in the board.Dont open a new thread if there is one already. If there is no thread then open a new one.
by joy
Sat Jan 06, 2007 7:09 am
Forum: Off topic (General chit-chat)
Topic: New here
Replies: 9
Views: 40019

Hi,

keep posting....

good luck :D :D

Go to advanced search