Search found 16 matches
- Mon Oct 23, 2006 7:21 am
- Forum: Volume 111 (11100-11199)
- Topic: 11138 - Nuts and Bolts
- Replies: 9
- Views: 5693
- Mon Sep 04, 2006 5:34 pm
- Forum: Other words
- Topic: Will someone ever fix the "update info" link?
- Replies: 1
- Views: 1894
Will someone ever fix the "update info" link?
"THE UPDATE PROFILE AND RETRIEVE PASSWORD DOESN'T WORK YET. BE PATIENT !!!"
I need to update my profile on the online judge but it is unavailable for a long time. Why is it taking so long a time to fix it? How long will it take more?
I need to update my profile on the online judge but it is unavailable for a long time. Why is it taking so long a time to fix it? How long will it take more?
- Mon Sep 04, 2006 5:19 pm
- Forum: C++
- Topic: are the time limits set so that STL code runs within it?
- Replies: 12
- Views: 4786
It would have been great if the algorithm could be detected, but I guess this is not possible. Could it be specified in the problem statement that STL code would not make the time limit for the particular problem? Because I have also had times when I have coded with STL and got TLE. If I could know ...
- Sat Sep 02, 2006 10:52 am
- Forum: C++
- Topic: are the time limits set so that STL code runs within it?
- Replies: 12
- Views: 4786
- Sat Sep 02, 2006 9:07 am
- Forum: C++
- Topic: are the time limits set so that STL code runs within it?
- Replies: 12
- Views: 4786
are the time limits set so that STL code runs within it?
sometimes i wonder whether my c++ code with STL will make the time limit. how does the problem setters set the time limit? do they make sure that if the algorithm is correct, any implementation (e.g., STL, object oriented) are accepted? (sorry if this topic has been discussed before. it's hard to fi...
- Sat Aug 12, 2006 11:51 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11069 - A Graph Problem
- Replies: 20
- Views: 9310
- Sat Aug 12, 2006 8:29 pm
- Forum: Volume 110 (11000-11099)
- Topic: 11069 - A Graph Problem
- Replies: 20
- Views: 9310
11069 - A Graph Problem
i am ashamed to see so many people have solved this problem but i coudn't understand how to.
is there any constant time formula? or is it a brute force enumeration? (doesn't seem so).
is there any constant time formula? or is it a brute force enumeration? (doesn't seem so).
- Mon Aug 15, 2005 6:24 pm
- Forum: Volume 107 (10700-10799)
- Topic: 10794 - The Deadly Olympic Returns!!!
- Replies: 14
- Views: 13129
Sorry for late reply
Thank you. You were right. I was doing an integer division and storing it in a double.
But I wonder how I forgot (or did I ever know it?) that it doesn't automaticallly
convert to the larger type!??!?
ummmm............a bit late reply heh heh.....i was very busy........
But I wonder how I forgot (or did I ever know it?) that it doesn't automaticallly
convert to the larger type!??!?
ummmm............a bit late reply heh heh.....i was very busy........
- Fri Jul 29, 2005 11:01 am
- Forum: Volume 107 (10700-10799)
- Topic: 10794 - The Deadly Olympic Returns!!!
- Replies: 14
- Views: 13129
10794
my algo is same. checked div by 0. but still WA. can anybody give me some sample critical I/O? another thing....am i supposed to truncate the output or simply round it up? i used int for input and double for calculation.
- Sun Jun 19, 2005 11:45 am
- Forum: Volume 105 (10500-10599)
- Topic: 10543 - Traveling Politician
- Replies: 25
- Views: 7729
10543 - Travelling politician
What's wrong with this? gets WA....... #include <iostream.h> #include <stdio.h> #include <math.h> void main() { int n, m, k, u, v, p, q, r, i; scanf(" %d %d %d ", &n, &m, &k); while (n || m || k) { int g[50][50] = {0}; int temp1[50][50] = {0}; int temp2[50][50] = {0}; for (i = ...
- Mon Jun 13, 2005 9:02 pm
- Forum: Volume 105 (10500-10599)
- Topic: 10543 - Traveling Politician
- Replies: 25
- Views: 7729
- Mon Jun 13, 2005 3:53 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10182 - Bee Maja
- Replies: 9
- Views: 3460
- Sun Jun 12, 2005 7:26 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10182 - Bee Maja
- Replies: 9
- Views: 3460
10182 - bee maja
Can anyone give me any hint on this?
Is there a simple formula?
Is there a simple formula?
- Fri Apr 15, 2005 7:08 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10131 - Is Bigger Smarter?
- Replies: 93
- Views: 68746
10131
i have the same algo.
sort w increasing
sort i decreasing
find lcs of these two
but i get wa! is this algo wrong?
sort w increasing
sort i decreasing
find lcs of these two
but i get wa! is this algo wrong?
- Thu Apr 14, 2005 5:26 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10100 - Longest Match
- Replies: 95
- Views: 22953
yes!
thank you so much!
I got AC.
I got AC.