## Search found 405 matches

Thu Dec 30, 2004 4:37 pm
Forum: Volume 107 (10700-10799)
Topic: 10790 - How Many Points of Intersection?
Replies: 28
Views: 16201
May I give the formula here. it is a multiplication of four term and then a division by 4.00 and i used .0lf to print the value.
Thu Dec 30, 2004 1:02 pm
Forum: Volume 107 (10700-10799)
Topic: 10790 - How Many Points of Intersection?
Replies: 28
Views: 16201
OOPS! little joye sorry! I just solved the program today. using double I got WA and using long long I got ac. Is there any reason for it? And, can we use I64 data type (I have used never at uva). Is it allowed now?
Thu Dec 30, 2004 10:08 am
Forum: Volume 107 (10700-10799)
Topic: 10790 - How Many Points of Intersection?
Replies: 28
Views: 16201
soyoja, it's a two line program with O(1) soln. try the same way .. simplified your equation. Use long long ofcourse
Mon Dec 20, 2004 7:42 pm
Forum: Volume 107 (10700-10799)
Topic: 10773 - Back to Intermediate Math
Replies: 41
Views: 16664
For Anupam only : There is a math problem in Tofajjal Sir's Physics Book in HSC Level. At that math, it is shown that a boat can cross a river in two ways (as you said in your problem) and there the velocity of river is considered in both the cases. But the solution for your problem can not work wi...
Sat Nov 20, 2004 4:07 pm
Forum: Other words
Topic: Foundation Contest 2004
Replies: 12
Views: 3545

### Foundation-acm Contest - II

Hello All, Thank to all for participating in the 2nd contest of us (FOUNDATION-ACM CONTEST-II). As usual, here goes some discussion about the problems: (A) Back to Intermediate Math Problemsetter: Anupam Bhattacharjee This is the easiest problem. Simple Geometric. (B) Repeated Josephus Problemsette...
Thu Nov 18, 2004 8:46 am
Forum: C++
Topic: GCC in windows
Replies: 3
Views: 2110
and then use g++. first of all search "cygwin" in this board and you will get a lot of hints.
Thu Oct 07, 2004 10:16 pm
Forum: Off topic (General chit-chat)
Replies: 3
Views: 2090
A very good book for beginners, but many pages may not be useful for a regular contestant as they already knew them:)
Mon Oct 04, 2004 9:45 pm
Forum: Volume 3 (300-399)
Topic: 314 - Robot
Replies: 30
Views: 6280
check whether the source node contains an obstacle. check whether the destination node has an obstacle.
Mon Oct 04, 2004 9:38 pm
Forum: Algorithms
Topic: Need an algorithm
Replies: 4
Views: 2054
Use DP for 10690 and 10664.
Mon Oct 04, 2004 9:35 pm
Forum: Volume 4 (400-499)
Topic: 495 - Fibonacci Freeze
Replies: 222
Views: 29383
Yes, the problem is in your Bignum class. I got ac with the algorithm in 3:8s. You may use java biginteger
Mon Oct 04, 2004 9:32 pm
Forum: Volume 106 (10600-10699)
Topic: 10684 - The jackpot
Replies: 34
Views: 18593
O O, I think I failed to understand what you were talking about. >>he can identify patterns of consecutive wins and elaborate a win-win strategy. A bet is an amount of money and is either winning (and this is recorded as a positive value). So shouldn't consecutive wins be a continuous subsequence of...
Sun Oct 03, 2004 9:40 pm
Forum: Volume 106 (10600-10699)
Topic: 10684 - The jackpot
Replies: 34
Views: 18593
Yeah, I also think so. It is a positive subsequence for win conds.
Sat Sep 25, 2004 10:43 pm
Forum: Volume 107 (10700-10799)
Topic: 10701 - Pre, in and post
Replies: 13
Views: 6020
There is a another same problem in volume 5 (536 tree recovery). Search for it.
Thu Sep 23, 2004 11:56 pm
Forum: Volume 107 (10700-10799)
Topic: 10720 - Graph Construction
Replies: 49
Views: 30380

### Re: 10720

[cpp] while(scanf("%d",&n)==1 && n){ flod = false ;//flod no need FOR(i,1,n){scanf("%d",&d ); if(d < 0 || d >= n){flod=true ;}//no need sum+=d ;} if(flod){printf("Not possible\n");continue ;}//no need if(sum==0){printf("Possible\n");continue ;}//no need if(n==1 && sum > 0){printf("Not possible\n");...
Thu Sep 23, 2004 11:44 pm
Forum: Volume 107 (10700-10799)
Topic: 10720 - Graph Construction
Replies: 49
Views: 30380
Thanks schindlersp. Got AC in 0:00.219s. I had used all the steps u said except vImp which I checked after addition of all the inputs. That is the only reason I think to get such a huge runtime.