Search found 82 matches

by Master
Fri Sep 05, 2003 2:20 pm
Forum: Off topic (General chit-chat)
Topic: Acmbeginner.tk - a new web site for the acm programmer.
Replies: 8
Views: 5352

Thanks Moni and also a lot to Ahmed Shamsul Arefin Actually I am not a great programmer like Steven Halim's, Mark Dettinger's or even as like Ahmed Shamsul Arefin . I have just a little experience about programming and I want to share it to others. This is inspired me to develop the site. The Steven...
by Master
Fri Sep 05, 2003 2:17 pm
Forum: Off topic (General chit-chat)
Topic: Acmbeginner.tk - a new web site for the acm programmer.
Replies: 8
Views: 5352

I am very happy to see that Mr. Steven Halim give me a link on his site. http://www.comp.nus.edu.sg/~stevenha/programming/acmoj.html It is very imperious for me and all other acm beginner. And also thanks for allowing me to develop the site based on your idea Thanks once again M H Rasel amcbeginner
by Master
Thu Sep 04, 2003 8:41 am
Forum: Off topic (General chit-chat)
Topic: Acmbeginner.tk - a new web site for the acm programmer.
Replies: 8
Views: 5352

Acmbeginner.tk - a new web site for the acm programmer.

Is it very difficult to disclose oneself as a good programmer? Most probably not. Most of us who knows C/C++ want to see ourselves as a good programmer. For this reason we registered in this site. But often they do not do well only for lack of proper direction. I am one of them. You know, it is an e...
by Master
Fri Aug 29, 2003 12:55 pm
Forum: Volume 105 (10500-10599)
Topic: 10518 - How Many Calls?
Replies: 19
Views: 13739

This page hel me a great to think about how i can solve this problem but i am geting WA. Here is my code. Can any one tell me why i am getting WA. [cpp] #include <iostream.h> main() { int calls[1000000]; int cases, b, m; long long int n; cases = 0; while(1) { cases++; // scanf("%llu %i",&n,&b); cin ...
by Master
Fri Aug 29, 2003 12:40 pm
Forum: Volume 105 (10500-10599)
Topic: 10512 - A Day in Math-land
Replies: 52
Views: 13115

I have got this problem AC just now.
i have found a great help on this bord.
Though my code is large but it work very fast.
I use double.

you can try te following input.

0 0
1 0
0 -1
1 1
-1 -3

M H rasel
Cuet Old sailor
by Master
Thu Aug 28, 2003 6:55 am
Forum: Off topic (General chit-chat)
Topic: problem in downloded problem set archive
Replies: 0
Views: 1300

problem in downloded problem set archive

Hi,
I have downmloded the problem set archive. I have found that the volume 14, and volume 15 do not work if i do not extract that in a particular folder.

There are some new problem in the volume 15 but it is not come in the downloded archive yet.


M H Rasel
CUET Old Sailor
by Master
Wed Aug 20, 2003 6:23 am
Forum: Volume 103 (10300-10399)
Topic: 10300 - Ecological Premium
Replies: 22
Views: 8199

10300 &#8211; Incorrect output with AC code again.

Hi every body, I have found another problem whose judge input is not appropriate. It gives an incorrect output with the following input. 1 5 100000 1 100000 100000 1 100000 100000 1 100000 100000 1 100000 100000 1 100000 it gives output, 7050327040 But the input can be more large. 8) Here is my code...
by Master
Wed Aug 20, 2003 5:46 am
Forum: Volume 102 (10200-10299)
Topic: 10220 - I Love Big Numbers !
Replies: 18
Views: 7745

Obeviously this is a big integer problem and the precalculation is must for this problem.
by Master
Wed Aug 20, 2003 5:23 am
Forum: Volume 100 (10000-10099)
Topic: 10055 - Hashmat the Brave Warrior
Replies: 166
Views: 47303

If you use abs then you have to include stdlib.h and if the parameter must be integer. And if you use double then use fabs.

In this problem you do not need to use abs or fabs. But you can use a if function.


M H Rasel
CUET Old Sailor
by Master
Sun Aug 17, 2003 7:38 am
Forum: Volume 104 (10400-10499)
Topic: 10427 - Naughty Sleepy Boys
Replies: 35
Views: 21355

Zubire wrote you can count the digit number by just multiplying the number of digit with the total number between the range. i.e total number of digits between 10~99 is 180. so you should calculate total number of digit as long as it does not exceed the given value then you can easily find the numbe...
by Master
Sun Aug 17, 2003 7:36 am
Forum: Volume 104 (10400-10499)
Topic: 10427 - Naughty Sleepy Boys
Replies: 35
Views: 21355

Zubire wrote you can count the digit number by just multiplying the number of digit with the total number between the range. i.e total number of digits between 10~99 is 180. so you should calculate total number of digit as long as it does not exceed the given value then you can easily find the numbe...
by Master
Sun Aug 17, 2003 7:14 am
Forum: Volume 105 (10500-10599)
Topic: 10515 - Powers Et Al.
Replies: 124
Views: 30245

To calculate m^n you don't need to calculate m^n :wink: but just calculate (last digit of m)^n :D . And the last digit can only be from 0 to 9. For each digit there is a repeated sequence. :roll: your task is to find that and then just use a switch statement.

M H Rasel
CUET Old Sailor
by Master
Thu Aug 14, 2003 6:59 am
Forum: Volume 4 (400-499)
Topic: 495 - Fibonacci Freeze
Replies: 222
Views: 31878

I got AC with this problem

I use a precalculation to find all the number and use dynamic memory allocation in that case.


M H Rasel
CUET Old Sailor
by Master
Thu Aug 14, 2003 6:53 am
Forum: Volume 5 (500-599)
Topic: 591 - Box of Bricks
Replies: 80
Views: 11666

I got AC
I use the following
[cpp]
while(con)
{
......
.....
.....
.....
printf("Set.. \n");
printf("The .... %d,\n\n",...);
scanf("...");
}
[/cpp]

M H Rasel
CUET Old Sailor
by Master
Thu Aug 14, 2003 4:46 am
Forum: Volume 1 (100-199)
Topic: 136 - Ugly Numbers
Replies: 156
Views: 19629

Now I found very interesting code on the book programming challenges for the prime factorization. I think this code will be very helpful for this problem.

M H
CUET Old Sailor

Go to advanced search