Search found 64 matches

by arifcsecu
Sun Feb 21, 2010 9:02 pm
Forum: Volume 117 (11700-11799)
Topic: 11752 - The Super Powers
Replies: 6
Views: 3604

Re: 11752 - The Super Powers

How can i solve this ?
I have got TLE.

Please help any body.
by arifcsecu
Sat Feb 20, 2010 2:06 pm
Forum: Volume 117 (11700-11799)
Topic: 11762 - Race to 1
Replies: 10
Views: 4151

Re: 11770-(Race to 1)WA

Can You Explain this For
n=13
by arifcsecu
Sat Feb 20, 2010 1:15 pm
Forum: Volume 117 (11700-11799)
Topic: 11762 - Race to 1
Replies: 10
Views: 4151

11762 - Race to 1

I don't understand the problem and answer .
Can any body help me?
by arifcsecu
Sat Feb 20, 2010 12:45 pm
Forum: Volume 117 (11700-11799)
Topic: 11770 - Lighting Away
Replies: 27
Views: 8514

Re: WA in problem 11770

My approach is something as like as Robot. Algorithm: 1. run dfs for every zero in-degree vertex and count all zero in-degree vertex. 2. run dfs for maximum out-degree vertex ( if it has not visited yet and increase the counter) 3. run dfs for all vertices which has not visited yet and increase the ...
by arifcsecu
Fri Nov 13, 2009 3:31 pm
Forum: Volume 116 (11600-11699)
Topic: 11690 - Money Matters
Replies: 19
Views: 6682

Re: 11690 MONEY MATTERS

Taman wrote:Thanks to Arifcsecu. . .ur reply to Durjay helped me a lot. . . :D
It is OK
by arifcsecu
Fri Nov 13, 2009 3:30 pm
Forum: Volume 116 (11600-11699)
Topic: 11666 - Logarithms
Replies: 16
Views: 6104

Re: Replica Mulberry Handbags

Mulberry was founded in 1971 by Roger Saul through a gift of 50-pounds sterling from his mother Joan. Roger began by selling his own designs for leather chokers and belts to such high fashion shops as Biba in London. His first collection of belts in suede and leather demonstrated the influence of s...
by arifcsecu
Fri Nov 13, 2009 3:21 pm
Forum: Volume 5 (500-599)
Topic: 530 - Binomial Showdown
Replies: 137
Views: 33278

Re: I need Help on 530(Binomial Showdown)

what is this ?
by arifcsecu
Sun Nov 08, 2009 11:09 am
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10471

Re: 11686 How can

Cin and cout take more time than scanf and printf
by arifcsecu
Wed Nov 04, 2009 6:31 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10471

Re: 11686 How can

Read previous post
by arifcsecu
Sat Oct 31, 2009 4:28 pm
Forum: Volume 117 (11700-11799)
Topic: 11714 - Blind Sorting
Replies: 14
Views: 3293

Re: 11714 Blind Sorting

try to build to Binary tree(Decision tree) for finding largest element
then search the binary tree for finding second largest element

Hope you understand the matter
by arifcsecu
Thu Oct 29, 2009 6:24 pm
Forum: Volume 117 (11700-11799)
Topic: 11714 - Blind Sorting
Replies: 14
Views: 3293

Re: 11714 Blind Sorting

This is a faily easy problem if u consider a binary tree for finding the largest number
and the second largest number can also compute with the complesity of binary time

formula is
largest=n-1
second largest = lg2(n-1)
then sum the above two numbers
by arifcsecu
Tue Oct 20, 2009 4:54 pm
Forum: Volume 116 (11600-11699)
Topic: 11636 - Hello World!
Replies: 30
Views: 6332

Re: Monitor everything they do online

Do you want to monitor what your kids are doing online? Do they chat with ill-intentioned strangers? Do you doubt that your emoplyees are busy with personal affairs during work-time? Are they trying to copy out company confidential data? All you need is a smart Internet usage monitoring software to...
by arifcsecu
Tue Oct 20, 2009 10:01 am
Forum: Volume 4 (400-499)
Topic: 454 - Anagrams
Replies: 97
Views: 21207

Re: 454 - Anagrams

cc
by arifcsecu
Tue Oct 20, 2009 9:36 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 181804

Re: If you get WA in problem 100, read me before post!

Silly mistake here

change this line
printf("\n%ld %ld %ld",i,j,huh(i,j));

as
printf("%ld %ld %ld\n",i,j,huh(i,j));

Hope it helps
by arifcsecu
Sun Oct 18, 2009 5:04 pm
Forum: Volume 116 (11600-11699)
Topic: 11686 - Pick up sticks
Replies: 44
Views: 10471

Re: 11686 How can

removed

Go to advanced search