## Search found 8 matches

Mon Sep 13, 2004 9:06 pm
Forum: Volume 107 (10700-10799)
Topic: 10706 - Number Sequence
Replies: 34
Views: 14318
Hi Old Sailor (Faizur)!
Your program gives correct answer for all the test cases greater than 45, doesn't it? Seem to me, if u solve "the bug" u will get it accepted. So i m giving u 45 test cases: 1 to 45.

Best regards,
Md. Azam Khan, NewSailor!!!

I born to code
Fri Jul 02, 2004 4:13 am
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 50385
Hi, The matter is not actually like that. The program is never faster than the light. In this problem there is only six combination. it can be done without using any loop. So how much time is there need to solve the problem? It is enough time of 0.00.000123=>?, isn't it? Anyway now u r a newcomer (a...
Wed Jun 30, 2004 9:52 pm
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 50385
Hi, I think there is nothing to explain bcoz u understood the problem clearly. So no more discussion. I changed ur silly mistake in making the minimum. { //why did u use this bracket? k[5]=a[3]+a[6]+a[1]+a[7]+a[2]+a[5]; //It is for k[1] not for k[5] according to ur output. k[1]=a[3]+a[4]+a[0]+a[7]+a...
Tue Jun 29, 2004 8:09 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 28884
Hi, Please read the two statements again that u write and also the whole problem . The both statements saying that from a given range u should print the lower one if two or more values generates same (longest) sequence. Suppose u are given to generate the range 55 35 then u proceed from 35 to 55 and...
Sun Jun 27, 2004 10:54 pm
Forum: Volume 4 (400-499)
Topic: 495 - Fibonacci Freeze
Replies: 222
Views: 31057
Hi,
Do you know 1500th fibonacci number more than 1000 digit! and how much digit contain in Long double range? Is it possible to solve this problem without string processing? Though i didn't solve this problem yet, i think this suggesstion will help you. With best wishes.

I born to code
Sun Jun 27, 2004 10:38 pm
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 28884
Hi, You solved 100 and 694, but TLE in 371! You can use same algorithm and code of 100, but think what will be output if input is 1 and 1. For this input loop will continue. int cycle(long long m) { int i=0; while(m!=1||i==0) // see this condition { ......... } return i; } in main(): if(temp>max_cyc...
Sun Jun 27, 2004 10:03 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 185309
Hellow new comer! Welcome to programmers zone. u didn't write the problem no! Though i thought the code is for problem no 100. Anyway, u should know how to write code first. Notice carefully where i modified your code. Another thing, think about variable length. #include<stdio.h> #include<stdlib.h> ...
Fri Jun 25, 2004 1:44 pm
Forum: Volume 1 (100-199)
Topic: 160 - Factors and Factorials
Replies: 205
Views: 25158
Hellow, Read the problem description carefully. 1. Each line contain fifteen numbers. No new line will be when just fifteen number should print. 2. From the 16th numbur u should give a new line with six extra space for sixteenth number. 3. What will be output when n=1. Wish these will help you :wink...