I want to use GMP library but can anybody tell me how to install it on
VC++,
--
You received this message because you are subscribed to the Google Groups
Google Code Jam group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
I am programming in C++, but I find it difficult to handle very very large
inputs of the problems in Codejam. My program runs well on smaller inputs, so
can anyone give me a clue to handling extremely large input sets, typically of
the order of 20th to 100th power of 10 ? Any website or link to
you can use GMP library for such proposes,http://gmplib.org/
On Sat, Apr 27, 2013 at 2:11 PM, splendido kumar.ashutosh...@gmail.comwrote:
I am programming in C++, but I find it difficult to handle very very large
inputs of the problems in Codejam. My program runs well on smaller inputs,
so
I was seeing the solutions of the top 10 contestants for the large input of
Bull's Eye. They all seem to have used some method involving variables like
beginning,end and mid. Can anybody explain to me what method they've applied
exactly?
I just used basic maths to solve it. They seem to have
On Sunday, April 14, 2013 8:14:15 AM UTC+5:30, sk wrote:
I do use java, and even though one can compete in codejam, do you agree that
C++ is a better languague to compete in code jam. I see the top 5 are using
C++.
i agree its a best language for coding
--
You received this message
My code for Small input was right but for large input cases,it stops
working.Coding Language is java.
Another Problem is,for first 2000 inputs of a large input file (in separate
file),it works fine but if all 6000 inputs are given in a file,it calculate
only up to 1694th input and stops at 1695
you have to choode data types which have greater range
On Sat, Apr 27, 2013 at 3:41 PM, SONI parveensoni14...@gmail.com wrote:
My code for Small input was right but for large input cases,it stops
working.Coding Language is java.
Another Problem is,for first 2000 inputs of a large input file
They have used a binary search , since the function relating radius ,
number of circles and the amount of paint was strictly non decreasing.
On Sat, Apr 27, 2013 at 2:12 PM, Vaibhav Tulsyan
wittynwise2...@gmail.comwrote:
I was seeing the solutions of the top 10 contestants for the large input
The problem with this is that pow(foo, 0.5) performs a floating point
calculation which is not accurate to the 18 significant figures required
for this result.
On Sat, Apr 27, 2013 at 6:55 AM, wonjun wonj...@gmail.com wrote:
I used the following logic for the problem -
Let k be the required
Hi,
I understand that they're using binary search, but I don't know how can it get
to the solution.
Could someone be very nice and explain the code below, please?
This is from coder wata:
void solve() {
long left = 0, right = 1L 40;
while (right - left 1) {
the 1.5 might just be to speed up the process to get the value. even if 1.6
was used or 1.55 was used for that matter, you might still get the right
answer but with varying speeds. thats just my guess. haven't tried it.
On Sat, Apr 27, 2013 at 6:04 PM, newbie007 lescoutinh...@gmail.com wrote:
11 matches
Mail list logo
