Search found 70 matches

by Tanu
Sun Jul 22, 2007 8:07 pm
Forum: Volume 111 (11100-11199)
Topic: 11150 - Cola
Replies: 43
Views: 22739

What a funny..............

Some problem makes a lots of fun with me, like this one...
:P :P :P :P :P :P :P :P :P :P :P :P :P :P :P :P :P :P :P
by Tanu
Sun Apr 08, 2007 8:09 am
Forum: Volume 101 (10100-10199)
Topic: 10165 - Stone Game
Replies: 6
Views: 2886

Hay

Yah thats true i got accepted by this way
but can anyone let me know how it works.
Thanks in advance...
- Tanu :o
by Tanu
Wed Jan 24, 2007 11:39 pm
Forum: Volume 101 (10100-10199)
Topic: 10113 - Exchange Rates
Replies: 5
Views: 2793

I got it in O^3 Floid Warshall.
in 0.059 sec...
by Tanu
Wed Aug 30, 2006 7:19 am
Forum: Volume 6 (600-699)
Topic: 623 - 500!
Replies: 187
Views: 43818

all programmer have to spend some time with big integer...
it is the earlier step of them...
actually the problem is not upto 500!
the limit is 1000!
consider the number as string back to the child age and
use the way we learn to multyply....
use array for storing answers...
hope it helps...
by Tanu
Wed Aug 30, 2006 7:12 am
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 21178

you dont have to initiate all array through... make it declare as global... Taht will make just u want all zero... there may be enough reason for wrong anwer... to avoid wa i take input as string... removed the . (decimal point) to get integer.... the range goes to long long... it is safe to avoid a...
by Tanu
Mon Aug 21, 2006 11:50 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 20444

Yah 107

I found 3-4 wrong answer for this problem... I used this algo... k is initialized as 1... find the k th root m of 1st number... decrement to get z = m-1... p = pow(z , k) if (fabs(p-second number)) calculate results using k..... ............................................ .............................
by Tanu
Tue Jul 25, 2006 2:23 am
Forum: Volume 2 (200-299)
Topic: 272 - TEX Quotes
Replies: 136
Views: 35542

But I used

I used
c = getchar() for this problem
by Tanu
Sat Jul 22, 2006 5:46 am
Forum: Volume 107 (10700-10799)
Topic: 10730 - Antiarithmetic?
Replies: 21
Views: 7260

What is the wrong

what is the wrong with my code... I save the indexes and checked for n, is the position if n+1 and n+2 is greater than position of n... is there anything wrong understanding with my code... plz help... #include<stdio.h> #include<string.h> long in[10005],pos[10005]; main() { char s[15]; long len,n,i;...
by Tanu
Fri Jul 21, 2006 8:26 am
Forum: Volume 2 (200-299)
Topic: 272 - TEX Quotes
Replies: 136
Views: 35542

Compiler error

check your id information... If your automatic mail is on then there have an mail attaching code & another with result... In case of Compiler error the line number of error will be mentioned Check this select any fuction name and press ctrl+F1 if the function is unix supported then it will also be s...
by Tanu
Thu Jul 20, 2006 3:40 pm
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21190

I know the n^2 algorithm

I know the N^2 algorithm...
I'm trying to do it in nlog(n) time...
I learn it from my friend but my code is so useful to make it implemented...
help anyone to solve this problem in better...
Is there any post about it...
Referrence is needed...
Thanx dear IRA...
...Tanu
by Tanu
Thu Jul 20, 2006 9:08 am
Forum: Volume 4 (400-499)
Topic: 497 - Strategic Defense Initiative
Replies: 144
Views: 21190

in nlog(n) time

I'm trying to solve it in nlog(n) time ... here is my code... Plz help... #include<stdio.h> #include<string.h> #define inf 4294967295 #define MAX 1000000 unsigned long res[MAX],in[MAX]; long top; long binarySearch(unsigned long key ) { long low = 0; long high = top- 1; //zero based array long middle...
by Tanu
Wed Jul 19, 2006 8:25 am
Forum: Volume 108 (10800-10899)
Topic: 10892 - LCM Cardinality
Replies: 25
Views: 8390

I have no scope here to compile my code in this time... I think for input 1 output must be 1... This is my algo ... Compare Yourself... 1. 1st find all the divisor of the given input.Save in array and sort. { the way may recursive or-> a loop i:from 2 to sqrt(N) if(N%i == 0) then add both i and N/i ...
by Tanu
Wed Jul 19, 2006 8:02 am
Forum: Algorithms
Topic: Graph problem
Replies: 12
Views: 3648

Check private massage
by Tanu
Tue Jul 18, 2006 12:24 pm
Forum: Volume 108 (10800-10899)
Topic: 10892 - LCM Cardinality
Replies: 25
Views: 8390

Think about the prime input...
by Tanu
Tue Jul 18, 2006 11:55 am
Forum: Algorithms
Topic: Graph problem
Replies: 12
Views: 3648

Take it easy

439 was my first try in bfs.... Many solvers solved it in 0.016 sec but it is possible to make the time faster... Think it easily as a simmetric matrix.... if u can go from board[a] to board[c][d] in x step then possibilities: 1. board[c][d] to board[a] will take the same step. 2. I think board[n-a]...

Go to advanced search