Search found 5 matches

by kasparov
Sun Aug 14, 2005 8:57 am
Forum: Volume 4 (400-499)
Topic: 437 - The Tower of Babylon
Replies: 14
Views: 7939

I'm got AC finally.

i forgot to put the format "Case #: maximum height = #" :oops:
but my solution was gr8 :wink: 0.01 seconds (i hope it's gr8 :D )

if anybody wanna test some test cases, tell me
by kasparov
Fri Aug 12, 2005 7:21 am
Forum: Volume 4 (400-499)
Topic: 437 - The Tower of Babylon
Replies: 14
Views: 7939

hello everybody, i solved it but WA (in 0.010 seconds). my solution is memonized backtracking. Can u tell me wether this output's correct or not ? 5 31 41 59 26 53 58 97 93 23 84 62 64 33 83 27 20 10 19 18 18 19 22 23 33 34 19 21 22 32 32 31 10 90 10 10 80 10 22 22 29 29 28 27 26 25 24 19 80 1 22 21...
by kasparov
Sat Jul 09, 2005 4:02 pm
Forum: Java
Topic: ArrayList allowed ?? Compile Error
Replies: 1
Views: 2732

ArrayList allowed ?? Compile Error

I got this compile error : ------------------------------------------------------------------- 03731899_24.java:12: Type `ArrayList' not found in the declaration of the local variable `ll'. ArrayList ll; ^ 03731899_24.java:68: Type `ArrayList' not found in the declaration of the local variable `ll'....
by kasparov
Sat Jul 09, 2005 4:02 pm
Forum: Java
Topic: ArrayList allowed ?? Compile Error
Replies: 0
Views: 2212

ArrayList allowed ?? Compile Error

I got this compile error : ------------------------------------------------------------------- 03731899_24.java:12: Type `ArrayList' not found in the declaration of the local variable `ll'. ArrayList ll; ^ 03731899_24.java:68: Type `ArrayList' not found in the declaration of the local variable `ll'....
by kasparov
Thu Jan 27, 2005 9:45 pm
Forum: Volume 100 (10000-10099)
Topic: 10054 - The Necklace
Replies: 62
Views: 31132

Plz help, still WA

#include <iostream> #include <fstream> using namespace std; #define cin in int conn[52][52]; int Conn[52][52]; int nEdges[52]; // To check weather this node is connected or not. void IsConnected(int node) { for(int i=1; i<51; i++) { if (Conn[node] > 0) { Conn[node] --; Conn [node]--; IsConnected(i);...

Go to advanced search