Search found 62 matches

by DP
Sun Aug 20, 2006 8:52 am
Forum: Volume 103 (10300-10399)
Topic: 10346 - Peter's Smokes
Replies: 46
Views: 16876

You can check this I/O:

Code: Select all

3 2
Output:

Code: Select all

5
1 1 1 =3
---
1 =1
1
----- =1
Total =5
by DP
Fri Aug 18, 2006 7:13 pm
Forum: Volume 103 (10300-10399)
Topic: 10350 - Liftless EME
Replies: 3
Views: 3093

10350

hello, can someone explain me the following line, coz i didnt get the following line? ......the i-th hole through the roof of k-th floor (i.e. the i-th hole through the floor of (k+1)-th floor) to the ladder at the j-th hole through the roof of (k+1)-th floor. In problem description, 3 2 1 2 .... 3 ...
by DP
Wed Aug 16, 2006 4:01 pm
Forum: Volume 103 (10300-10399)
Topic: 10305 - Ordering Tasks
Replies: 59
Views: 22386

Advice:
There is already some post ... so i think you should better to use those.

Now your program is OK. But there is initialization error.
Because i try several I/O again and again then it produces first correct output then wrong output.

Hope its help.
by DP
Wed Aug 16, 2006 3:42 pm
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17452

can you explain this code segment---->

Code: Select all

        for(int i=0;i<N;i++)
        {
            d = min_dist(N,graph,i);
            for(int j=0;j<N;j++)
                dist[j] += d[j];
        } 
by DP
Wed Aug 16, 2006 11:48 am
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17452

my program produce the following output for your input:

Code: Select all

Case #1 : John
bye
by DP
Tue Aug 15, 2006 1:25 pm
Forum: Volume 104 (10400-10499)
Topic: 10422 - Knights in FEN
Replies: 49
Views: 18309

Can someone tell me, how the following Input produce 8 move(s) for knight?

Code: Select all

11111
00111 
00111
0 001
00000 
I found it from board. PLease help me!!!
by DP
Tue Aug 15, 2006 11:56 am
Forum: Volume 108 (10800-10899)
Topic: 10819 - Trouble of 13-Dots
Replies: 67
Views: 38108

Martin,
Thnx you are a great helper. :)
by DP
Tue Aug 15, 2006 11:29 am
Forum: Volume 108 (10800-10899)
Topic: 10819 - Trouble of 13-Dots
Replies: 67
Views: 38108

Code: Select all

removed
by DP
Tue Aug 15, 2006 10:39 am
Forum: Volume 104 (10400-10499)
Topic: 10422 - Knights in FEN
Replies: 49
Views: 18309

10422

Can someone tell me why WA??? #include <cstdio> #include <iostream> #include <cstring> using namespace std; char board[6][6]; int sr[5][5]; int goal[5][5]={ 1,1,1,1,1, 0,1,1,1,1, 0,0,-1,1,1, 0,0,0,0,1, 0,0,0,0,0, }; int min,sx,sy; bool visit[5][5]; int check() { int i,j; for(i=0;i<5;i++){ for(j=0;j<...
by DP
Tue Aug 15, 2006 6:02 am
Forum: Volume 102 (10200-10299)
Topic: 10202 - Pairsumonious Numbers
Replies: 10
Views: 5623

thnx Moha.
by DP
Mon Aug 14, 2006 9:40 pm
Forum: Volume 108 (10800-10899)
Topic: 10819 - Trouble of 13-Dots
Replies: 67
Views: 38108

please check my I/O:

Code: Select all

1800 3
1950 1
2000 5
101 1

1801 3
2000 5
1955 1
101 1

1890 3
1955 1
2000 5
101 1
 
5000 4
1000 2
1000 2
1000 3
3200 5

0 0

1 1
1 1

5 5
1 9
2 9
3 9
1 9
2 9
Output:

Code: Select all

1
1
2
10
0
1
27
Is it correct?
by DP
Sun Aug 13, 2006 8:28 pm
Forum: Volume 102 (10200-10299)
Topic: 10202 - Pairsumonious Numbers
Replies: 10
Views: 5623

hi moha thnx for your reply.
But it could be helpfull if you give some hints. :)

thnx
by DP
Sun Aug 13, 2006 5:39 pm
Forum: Algorithms
Topic: need problem number
Replies: 2
Views: 1409

need problem number

can someone provide me some DP problems.
With easy+medium. Just write it side.

thnx
by DP
Sun Aug 13, 2006 4:24 pm
Forum: Volume 108 (10800-10899)
Topic: 10891 - Game of Sum
Replies: 33
Views: 13237

thnx a lot. Martin. :)
by DP
Sun Aug 13, 2006 4:16 pm
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 20788

hmm. really novice. :wink:

Code: Select all

OK just use double instead of long long
bye

Go to advanced search