Search found 64 matches

by arifcsecu
Wed Oct 07, 2009 6:29 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10472

Re: 11686 How can

This is topological sort
So try to use vector instead of 2D array

Use dfs algorithm and with in dfs
you have to check back edge and
use a stack to contain the fast blacken vertices

and also take input using scanf
and output using printf


i hopes ....
by arifcsecu
Tue Oct 06, 2009 9:39 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10472

Re: 11686 Runtime error Here

MRH wrote:TRY THIS CASE
4 3
4 1
1 2
3 2
MY Acc code give :
3
4
1
2
Thanks
Accepted now
by arifcsecu
Tue Oct 06, 2009 9:33 pm
Forum: Volume 116 (11600-11699)
Topic: 11690 - Money Matters
Replies: 19
Views: 6682

Re: 11690 MONEY MATTERS

Durjoy
Try to use Vector
i got it accepted using vector
by arifcsecu
Tue Oct 06, 2009 7:45 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10472

Re: 11686 How can

Igor9669 wrote:Try to change cin/cout to scanf/printf. May be this could help.

Thanks
Accpted now
This problem makes me one third mad

Please Can u explain me what does it happen
by arifcsecu
Tue Oct 06, 2009 6:01 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10472

Re: 11686 Time Limit exceeded

Code remove
After Accepted
by arifcsecu
Mon Oct 05, 2009 6:51 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10472

Re: 11686 How can

remove
by arifcsecu
Sat Oct 03, 2009 8:51 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33279

Re: I need Help on 530(Binomial Showdown)

i think there is precision error So you should use integer operation only like nCr= n!/(r!* (n-r)!) n *( n-1)* (n-2)* ...... (n-r+1)* (n-r)* (n-r-1)* ..........3*.2*1 ------------------------------------------------------------------- {r*( r-1)*(r-2).........3.2.1 )} {(n-r)* (n-r-1)...........3*2*1}...
by arifcsecu
Fri Oct 02, 2009 5:11 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10472

11686 - Pick up sticks

remove
by arifcsecu
Thu Oct 01, 2009 11:06 am
Forum: Volume 113 (11300-11399)
Topic: 11388 - GCD LCM
Replies: 18
Views: 10151

Re: 11388 - GCD LCM

Another One of the easiest problem like Hasmot the brave warrior: we know that a x b= gcd(a,b) x lcm(a,b) or gcd(a,b) x lcm(a,b)= a x b ....................(1) Input is : gcd(a,b) and lcm(a,b) output : a=? b=? from equation (i) there is symmetry try: from forward: a=12 b=18 gcd(12,18)=6 lcm(12,18)=3...
by arifcsecu
Wed Sep 30, 2009 11:53 pm
Forum: Volume 115 (11500-11599)
Topic: 11526 - H(n)
Replies: 49
Views: 16686

Re: 11526 - H(n)

i am new
thanks for ur ...........
by arifcsecu
Wed Sep 30, 2009 9:38 pm
Forum: Volume 101 (10100-10199)
Topic: 10104 - Euclid Problem
Replies: 29
Views: 9962

Re: 10104 - Euclid Problem

IT is one of the easiest problem in UVA Nothing is minimal or ordered here Just take input and run extended_euclid algorithm link: http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm print the triples ok i think u will get accepted now
by arifcsecu
Wed Sep 30, 2009 5:44 pm
Forum: Volume 116 (11600-11699)
Topic: 11679 - Sub-prime
Replies: 1
Views: 1463

Re: 11679 - WA

I think no critical input is required Here my algorithm is : after liquidate all debentures from creditor to debtor now check that any of those banks monetary reserves is <0 if yes print "N\n" else print "S\n" thats
by arifcsecu
Wed Sep 30, 2009 11:59 am
Forum: Volume 115 (11500-11599)
Topic: 11526 - H(n)
Replies: 49
Views: 16686

Re: 11526 - H(n)

oh i got accepted now
i forget for negative numbers

when n<=0
printf("\n");

bye
by arifcsecu
Wed Sep 30, 2009 2:14 am
Forum: Volume 115 (11500-11599)
Topic: 11526 - H(n)
Replies: 49
Views: 16686

Re: 11526 - H(n)

Code remove after AC
by arifcsecu
Tue Sep 29, 2009 1:06 am
Forum: Off topic (General chit-chat)
Topic: How you feel when you are not solving problem?
Replies: 7
Views: 37594

Re: How you feel when you are not solving problem?

It seems to me that
nothing can be possible by me.
i live on earth only for eating and losing money.
oh ....
but i have LAPTOP AND GP MODEM

now i am ................

Arif
University of chittagong
Bangladesh

Go to advanced search