Search found 13 matches

by skylander
Tue Jun 08, 2004 7:33 pm
Forum: Volume 100 (10000-10099)
Topic: 10089 - Repackaging
Replies: 41
Views: 14573

To make it easier to check if it is in the pyramid, I use 2D convex hull. i am interested to know how a convex hull could be use to solve a linear system of equations...i am not very clear about the part on the pyramid and how the convex hull could be used in this case....it would be best if u can ...
by skylander
Sun Jun 06, 2004 8:52 am
Forum: Volume 100 (10000-10099)
Topic: 10051 - Tower of Cubes
Replies: 19
Views: 8792

10051 Tower of Cubes

i tried to solve this problem using dynamic programming (lis)...i am not very sure if my algo is correct or if it is even considered dp, but it works as follows: i have a 2d array tower(i, j) which is set to true or false, depending on whether i can form a tower of height i, with the color j facing ...
by skylander
Thu Jun 03, 2004 4:49 am
Forum: Volume 100 (10000-10099)
Topic: 10021 - Cube in the labirint
Replies: 17
Views: 3882

i seem to have confused the locations of the walls....so careless of me...now its an AC....thanks Anggakusuma..:)
by skylander
Wed Jun 02, 2004 1:51 pm
Forum: Volume 100 (10000-10099)
Topic: 10021 - Cube in the labirint
Replies: 17
Views: 3882

thx for your suggestion....i have modified the code to use breadth first search...and tried my program with test data that i can think of...somehow the judge gives a WA....can anyone take a look at my code and see what i have overlooked or misunderstood....thanks....

[c]
code accepted..:)
[/c]
by skylander
Wed Jun 02, 2004 10:32 am
Forum: Volume 100 (10000-10099)
Topic: 10021 - Cube in the labirint
Replies: 17
Views: 3882

10021 - Cube in Labirint

i attempted to do this problem using a depth first traversal, but it seems to be to inefficient to solve the problem within 10s.... and looking at the timings achieved by those who solved the problem, mostly below one fifths of a sec...so there should be another more efficient approach to this probl...
by skylander
Tue Jun 01, 2004 4:54 pm
Forum: Volume 100 (10000-10099)
Topic: 10011 - Where Can You Hide?
Replies: 58
Views: 12674

i tried my program with many test cases and i am still getting wa from the judge...wonder wad i have overlooked...i considered the house being nearer to the source than the tree (pythagoras theorem), the house being out of range of the radiation (by the angle between tree, house and source)...and us...
by skylander
Mon Feb 03, 2003 8:09 am
Forum: Volume 1 (100-199)
Topic: 114 - Simulation Wizardry
Replies: 80
Views: 7622

help with 114

i just carn figure out what is wrong with my code, the judge just gives me wa [c]/* @BEGIN_OF_SOURCE_CODE /**/ #include <sys/types.h> #include <sys/stat.h> #include <fcntl.h> #include <stdio.h> #define MAX_M 55 #define MAX_N 55 void makeGrid(const int, const int, const int); int playBall(const int, ...
by skylander
Tue Jun 11, 2002 4:00 am
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 162
Views: 16110

you do not need to use string arithmetic, just some formula and a double will do the job...
by skylander
Tue Jun 11, 2002 3:53 am
Forum: Volume 1 (100-199)
Topic: 121 - Pipe Fitters
Replies: 36
Views: 2485

after some long thinking, i manage to come up with equilateral triangles linking 3 circles together, and stuck there... using that method, i found that i could fit 128 circles instead of 126 circles in the box 11 by 11, but i am not very sure about those dimensions with decimals...they are quite con...
by skylander
Mon Jun 10, 2002 4:03 pm
Forum: Volume 1 (100-199)
Topic: 114 - Simulation Wizardry
Replies: 80
Views: 7622

114 - Simulation Wizardry

the judge gave me WA but it worked well with the sample inputs...and some of my own inputs [cpp] /* @BEGIN_OF_SOURCE_CODE */ #include <iostream.h> const int MAP_SIZE = 56; typedef struct MAPTYPE { bool canWalk; int cost, value; } MapType; /* Function Prototypes */ void createMap(int, int, int); void...
by skylander
Mon Jun 10, 2002 3:34 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 22797

there is an O(n^3) algorithmn for finding the maximum sum....can anybody explain how it works?

i remembered someone saying that it is related to the largest subsequence problem
by skylander
Mon Jun 10, 2002 3:30 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 183040

Re: In prob 100 will the program take all the input and then

My question is that in prob No 100 will the program take all the input lines and then give output OR with each line of input it will give the output? If its the 1st case then how to read the input.Please tell me.Because in other problems (next 2 )also I have same doubt. it will work either way, i t...
by skylander
Mon Jun 10, 2002 3:28 pm
Forum: Volume 1 (100-199)
Topic: 121 - Pipe Fitters
Replies: 36
Views: 2485

problem 121 - pipe fitters

can anybody tell me the formulas i need to know for this problem?

thank you :D

Go to advanced search