All about problems in Volume I. If there is a thread about your problem, please use it. If not, create one with its number in the subject.
Moderator: Board moderators
by hnphuong » Fri Oct 26, 2001 7:40 pm
Who have either its solution or algorithm please tell me. Thank you.
-
hnphuong
- New poster
-
- Posts: 3
- Joined: Fri Oct 26, 2001 2:00 am
- Location: Vietnam
-
by arnsfelt » Sat Oct 27, 2001 12:30 am
Just generate all the first n sequences using backtracking, and print the last one.
Kristoffer Hansen
-
arnsfelt
- New poster
-
- Posts: 44
- Joined: Wed Oct 17, 2001 2:00 am
- Location: Denmark
-
by hnphuong » Sat Oct 27, 2001 6:29 am
Oh really ? If we do that, n must be very small ! The problem didn't tell anything about the limit of n. I only want to ask that : did u get accepted ?
-
hnphuong
- New poster
-
- Posts: 3
- Joined: Fri Oct 26, 2001 2:00 am
- Location: Vietnam
-
by arnsfelt » Sat Oct 27, 2001 12:32 pm
Ofcourse I did get accepted, check it out for yourself:
123 | 0:00.000 | 64 | Kristoffer Hansen |
C | Iterative enumeration | 2001/05/08-21:41:21.029
-
arnsfelt
- New poster
-
- Posts: 44
- Joined: Wed Oct 17, 2001 2:00 am
- Location: Denmark
-
by hnphuong » Mon Oct 29, 2001 6:59 am
Only 501? That is amazing. Thank you for your suggestions.
-
hnphuong
- New poster
-
- Posts: 3
- Joined: Fri Oct 26, 2001 2:00 am
- Location: Vietnam
-
Return to Volume I
Who is online
Users browsing this forum: No registered users and 1 guest
