Search found 79 matches
- Fri Nov 23, 2012 7:13 pm
- Forum: Volume 1 (100-199)
- Topic: 168 - Theseus and the Minotaur
- Replies: 64
- Views: 7585
Re: 168 - Theseus and the Minotaur TLE
I gathered inputs from other posts and added mine: A:BCD;B:AD;D:BG;F:H;G:DEH;E:FGH;H:EG;C:AD. A C 3 A:BCD;B:ACD;C:ABD;D:ABCG;G:DEFH;E:GFH;F:GEH;H:EFG. A C 1 A:BCD;B:ACD;C:ABD;D:ABCG;G:DEFH;E:GFH;F:GEH;H:EFG. A C 6 A:BCD;B:ACD;C:ABD;D:ABCG;G:DEFH;E:GFH;F:GEH;H:EFG. A C 7 A:B;B:A. B A 3 A:B;B:C;C:A. B...
- Wed Oct 24, 2007 11:10 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10806 - Dijkstra, Dijkstra.
- Replies: 24
- Views: 17845
- Thu Apr 05, 2007 3:39 pm
- Forum: Volume 1 (100-199)
- Topic: 112 - Tree Summing
- Replies: 137
- Views: 13913
My AC'ed program gives following output
I guess such an input isn't correct, it doesn't follow the input specification
Hope it helps
Code: Select all
yes
no
yes
no
no
yes
no
yes
yes
no
yes
yes
yes
yes
no
no
no
no
no
no
no
no
no
yes
no
no
yes
yes
yes
yes
yes
Code: Select all
5 ( 5 () 1 () ())
4 ( 2 (2 () 1()()) ())
Hope it helps
- Sat Mar 03, 2007 1:37 am
- Forum: Volume 108 (10800-10899)
- Topic: 10806 - Dijkstra, Dijkstra.
- Replies: 24
- Views: 17845
- Fri Mar 02, 2007 5:04 pm
- Forum: Volume 108 (10800-10899)
- Topic: 10806 - Dijkstra, Dijkstra.
- Replies: 24
- Views: 17845
message to misof!! actually you don't need to use bellman-ford algorithm at first i got wa ( i used dijkstra then set used arcs as infinity and used dijkstra again) , then i read your advise and used dijkstra then set used arcs as infinity then negated arcs and finally used bellman-ford, i got AC bu...
- Mon Jan 09, 2006 1:55 am
- Forum: Volume 105 (10500-10599)
- Topic: 10530 - Guessing Game
- Replies: 57
- Views: 27790
- Sat Jan 07, 2006 10:46 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10530 - Guessing Game
- Replies: 57
- Views: 27790
maybe try this: INPUT 7 too low 8 too high 9 right on 1 too high 7 too low 8 right on 5 too low 8 too high 7 too high 5 right on 10 right on 10 too low 1 too high 5 right on 4 too high 3 too high 5 right on 6 too low 7 too low 5 right on 4 too low 1 too low 6 too high 9 too high 5 right on 1 too low...
- Sat Jan 07, 2006 2:16 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10530 - Guessing Game
- Replies: 57
- Views: 27790
yes indeed!
my output differ from your!
Try to rethink one before last test case
the correct answer is : "Stan is dishonest"
Regards & hope it helps
my output differ from your!
Try to rethink one before last test case
Code: Select all
9
too low
8
too low
7
too low
8
right on
Regards & hope it helps
- Thu Dec 08, 2005 11:06 pm
- Forum: Volume 1 (100-199)
- Topic: 160 - Factors and Factorials
- Replies: 205
- Views: 24652
- Thu Sep 01, 2005 12:57 am
- Forum: Volume 4 (400-499)
- Topic: 459 - Graph Connectivity
- Replies: 132
- Views: 24871
- Sun Aug 14, 2005 3:13 pm
- Forum: Volume 1 (100-199)
- Topic: 111 - History Grading
- Replies: 135
- Views: 22137
I passed sample in/out and these in this post, but still WA I need some critical input, or hint.. Here's my code if someone wants to check it #include <cstdio> #include <vector> #include <algorithm> using namespace std; vector <int> modify(vector <int> a) { vector <int> pom(a); for(int i = 0; i < a....
- Sun Aug 14, 2005 2:14 pm
- Forum: Volume 1 (100-199)
- Topic: 111 - History Grading
- Replies: 135
- Views: 22137
- Sun Aug 14, 2005 11:18 am
- Forum: Volume 3 (300-399)
- Topic: 306 - Cipher
- Replies: 74
- Views: 18495
Actually, your suggestion gives TLE too there is 2kn operations to get the final sequence and than print them maybe you did it in better way?? I tried to speed up it several times but it must be k-permutaion, otherwise i get WA;( anyway here is my code #include <stdio.h> #include <string.h> int main...
- Sat Aug 13, 2005 4:23 pm
- Forum: Volume 3 (300-399)
- Topic: 306 - Cipher
- Replies: 74
- Views: 18495
- Wed Aug 10, 2005 11:36 pm
- Forum: Volume 3 (300-399)
- Topic: 327 - Evaluating Simple C Expressions
- Replies: 19
- Views: 8268
It can't be input like a + ++a or a+ --a ...and so on I mean it can't be same letter used a few times cause it was written Execute the statements generated in step 1, then those generated in step 3, and finally the one generated in step 2, in that order. so at first calculate expresisons like ++a an...