The algorithm is the perceptron algorithm. I believe it can be cast as gradient descent.sclo wrote:the method looks like gradient descent, but I don't know what function it is trying to minimize.
Search found 194 matches
- Mon Oct 08, 2007 6:48 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11289 - Friend or Foe?
- Replies: 8
- Views: 2983
- Fri Oct 05, 2007 10:29 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 8825
hey cormac look below: the problem said for the last test case should be: 0 0 but the judge data has no input like 0 0 now for this coding technique you will get wa in this problem #include<stdio.h> int main() { long i,n,q; char c; while(scanf("%ld%ld",&n,&q)==2) { if(n==0&&q==0) break; for(i=0;i<q...
- Fri Oct 05, 2007 9:51 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 8825
thnx cormac for reply i got WA with my code several times but few minutes ago when i delete the while condition and delete the breaking condition from my code i got AC. So why i cant i say that the judge data is faulty when it doesnot work when i wrote like this: while(scanf("%ld%ld",&n,&q)==2) { i...
- Fri Oct 05, 2007 9:41 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 8825
hey cormac i so i have to ready a program after a lot of thoughts but when it comes WA for poor judge data (for giving the breaking conditions) it really frustrated us. best regard tanvir If you got WA it is because your program is wrong. By weak data, I mean that the judge gives AC when it should ...
- Fri Oct 05, 2007 9:27 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 8825
FROM NOW I WILL FIRST SEND THE SAMPLE OUTPUT BEFORE SUBMITTING ANY PROBELMS WHO KNOWS IF THE PROBELM HAVE SINGLE INPUT WITHOUT BREAKING CONDITION(!!!!!!!!!!!!!) :wink: In a contest that'll cost you points. This is a practice site. I don't see that developing strategies to spoof the judge gives you ...
- Fri Oct 05, 2007 8:49 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 8825
ok when garbage is accepted with some garbage output then it may raise question about the judge data. strange really strange that how a garbage code can have a AC. [I had made a comment saying that Waterloo had 20 test cases where uva.es had only one. I was mistaken. uva.es should have all test cas...
- Fri Oct 05, 2007 8:32 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 8825
thnx cormac for reply this is the link of that code: http://plg.uwaterloo.ca/~acm00/070929/data/wedding.c it got ac in UVA but result "bad luck" for the test case... i will remove the link after your message.... best regards tanvir The official Waterloo data and solutions always begin with the prob...
- Fri Oct 05, 2007 8:22 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11294 - Wedding
- Replies: 21
- Views: 8825
thnx baodog for your reply i didn't found any additional I/O but i found a source code of wedding which is found as a AC code when it is tested. then i make some sample input to compare it with my own source code: input: 10 2 1h 2w 1h 2h for which my own code's output is: 1h 2h 3h 4h 5h 6h 7h 8h 9h...
- Mon Oct 01, 2007 3:48 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11293 - Tournament
- Replies: 19
- Views: 6683
What I did was - 1. Find the number of knights that will get a bye . Let the number of knights that didn't get a bye = M. 2. Then I sorted all the <name, ability> in increasing order of ability. Isn't it true that the best selection of M knights would be a consecutive subsequence? This method gets ...
- Mon Oct 01, 2007 1:22 pm
- Forum: Volume 112 (11200-11299)
- Topic: 11293 - Tournament
- Replies: 19
- Views: 6683
Re: 11293 - Tournament
Now if, for example, A plays B, the winner plays C, and the winner plays D, we have the case that A needs to play in 3 events to win. So it is not true that no knight must compete in more than 2 events, because A must. So this second schedule fails to maximize e. Well, 4 knights, A, B, C, D. A play...
- Mon Oct 01, 2007 12:20 am
- Forum: Volume 112 (11200-11299)
- Topic: 11293 - Tournament
- Replies: 19
- Views: 6683
Re: 11293 - Tournament
The problem states.. The tournament schedule is organized so that no knight needs to compete in more than e events to be champion, for the minimum possible e given k, the number of knights. The minimum possible e should be always 1. So, the number of knights can be reduced to 2. Am I right or I am ...
- Sun Oct 08, 2006 4:32 am
- Forum: Algorithms
- Topic: Suffix Tree and some application
- Replies: 1
- Views: 1889
Re: Suffix Tree and some application
11107 Life Formsrushel wrote:Hi guys i want to learn suffix tree and also want to see some suffix application.
please guys help me i badly need it.
10526 Intellectual Property
10580 Ransom Note
- Sat Oct 07, 2006 3:10 am
- Forum: Volume 111 (11100-11199)
- Topic: 11102 - Moonshine
- Replies: 27
- Views: 10276
if R>t then it would be right.else { t=R-t; V=Volume cone -Volume Slice;} let's prove it. if (R>t) [img=http://img322.imageshack.us/img322/7932/cimg0766sr4.th.jpg] [/url] The shape is not a pyramid, and the formula doesn't apply. The formula assumes that the cross-sectional area d vertical units fr...
- Thu Oct 05, 2006 5:26 pm
- Forum: Volume 111 (11100-11199)
- Topic: 11102 - Moonshine
- Replies: 27
- Views: 10276
integral is nasty, but it has a simple solution to find the volume of a cone sliced by a plane parallel to its axis. First you to find of area of the base of a cone(segment of the base circle) and multiply to height(not height of con) and devide it 3 R - radius of a cone h - height of a cone t,p - ...
- Thu Oct 05, 2006 11:03 am
- Forum: Volume 111 (11100-11199)
- Topic: 11102 - Moonshine
- Replies: 27
- Views: 10276
Re: 11102 Moonshine WA
Please help me, i tested it with several test case, but it was WA here is my code thanks Not sure what you are doing but I don't see any code that integrates to find the volume of a cone sliced by a plane parallel to its axis. This integral is nasty. Dr. Math has an incorrect solution and I have no...