Search found 185 matches

by htl
Fri Jun 25, 2004 3:56 am
Forum: Volume 106 (10600-10699)
Topic: 10670 - Work Reduction
Replies: 10
Views: 7720

I don't know how to get the answer of case 1, could someone help me?
by htl
Mon Jun 21, 2004 2:48 pm
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 23147

Sorry, it's my mistake. 19 is my answer. But I still don't know how you can get 21 as answer?
by htl
Sun Jun 20, 2004 9:46 am
Forum: Volume 101 (10100-10199)
Topic: 10130 - SuperSale
Replies: 76
Views: 23147

Why the answer of sohel's input is 19? Could someone explain about it?
by htl
Sat Jun 19, 2004 3:21 pm
Forum: Volume 104 (10400-10499)
Topic: 10430 - Dear GOD
Replies: 12
Views: 5207

How about the in/output below? in: 1 99 2 99 3 99 4 99 5 99 6 99 7 99 8 99 9 99 out: Dear GOD, Pardon Me X = 99 K = 1 X = 633825300114114700748351602687 K = 633825300114114700748351602688 X = 85896253455335221839410188294270212117017920333 K = 171792506910670443678820376588540424234035840667 X = 133...
by htl
Sat Jun 19, 2004 11:35 am
Forum: C
Topic: Dev-C++ supports long long type?
Replies: 4
Views: 2723

Dev-C++ supports long long type?

I use the latest version of Dev-C++ with the latest gcc. I thought that the compiler should support 'long long' type. But it makes the wrong output when I use 'long long'. How do I solve this problem? And do Borland C++ Compiler and Visual C++ support 'long long'?
by htl
Sat Jun 19, 2004 6:05 am
Forum: Volume 104 (10400-10499)
Topic: 10430 - Dear GOD
Replies: 12
Views: 5207

10430

Is there any critical test case? And are both of T and N positive integers?
I still can find out what's wrong.
by htl
Thu Jun 17, 2004 3:24 pm
Forum: Volume 105 (10500-10599)
Topic: 10579 - Fibonacci Numbers
Replies: 8
Views: 4832

I have tried addition calculation... Thanks..
by htl
Tue Jun 15, 2004 5:57 pm
Forum: Volume 106 (10600-10699)
Topic: 10655 - Contemplation - Algebra
Replies: 42
Views: 10775

10655

I think it's not a hard one, and not finding out any mistake in my code. But I use Dev-C++ compiler and not getting the right result. I don't know the problem is syntax or type changing or something else.. Is there someone willing to run the prog for me and see what's wrong? [c] #include<stdio.h> #i...
by htl
Tue Jun 15, 2004 6:07 am
Forum: Volume 106 (10600-10699)
Topic: 10668 - Expanding Rods
Replies: 38
Views: 20545

Setting the range of y between 0 and 1.... But I thought that the radius could be very long as well as y. Could you give me more guidelines? I still work on finding the proper range that I could do bisection.
by htl
Mon Jun 14, 2004 6:26 pm
Forum: Volume 105 (10500-10599)
Topic: 10579 - Fibonacci Numbers
Replies: 8
Views: 4832

It means that if I should make a multiplication table for any base I wanna to convert to? Could you give me more information on bigint? Thanks!
by htl
Mon Jun 14, 2004 5:14 pm
Forum: Volume 106 (10600-10699)
Topic: 10668 - Expanding Rods
Replies: 38
Views: 20545

I used almost the same method as sohel, but using nr method. This code got TLE. This is my first code using nr method to solve the equation. Could someone give some advice on my code? Or using bisection could be better? I'm poor at computer numerical method and hoping someone to help me solve proble...
by htl
Mon Jun 14, 2004 8:15 am
Forum: Volume 106 (10600-10699)
Topic: 10668 - Expanding Rods
Replies: 38
Views: 20545

10668 - Expanding Rods

It seems that it's a easy geometry problem. I use Newton-Raphson Method to get the angle of the sector. But I always got WA. Could someone give some input?
by htl
Mon Jun 14, 2004 6:48 am
Forum: Volume 106 (10600-10699)
Topic: 10667 - Largest Block
Replies: 12
Views: 7528

Uh...Sorry for interrupting your discussion.. But could someone give some critical input? I think that it shouldn't be hard to get AC.
by htl
Sat Jun 12, 2004 5:09 pm
Forum: Volume 106 (10600-10699)
Topic: 10667 - Largest Block
Replies: 12
Views: 7528

10667 - Largest Block

I believed that many people have solved such problems before and are familiar with this one. But I got WA on this one. Can somebody give some critical input? And I always use O(n^4) algorithm to solve problems like this. It seems to take too much time. Can someone share your faster algorithm? :roll:
by htl
Wed Jun 09, 2004 6:33 pm
Forum: Volume 103 (10300-10399)
Topic: 10341 - Solve It
Replies: 64
Views: 35643

I've heard that there's someone solving this with Newton-Raphson Method(or called Newton's Method, I think). But there are two things to think of, one is that f'(x) may be zero, the other is that we could get the 'root' out of the range [0,1]. Maybe there are some ways to overcome these problems. Co...

Go to advanced search