Search found 27 matches

by pvncad
Fri Nov 07, 2008 7:37 pm
Forum: Volume 115 (11500-11599)
Topic: 11549 - Calculator Conundrum
Replies: 10
Views: 7591

Re: 11549 - CALCULATOR CONUNDRUM

by pvncad
Mon Oct 13, 2008 9:41 am
Forum: Volume 115 (11500-11599)
Topic: 11525 - Permutation
Replies: 9
Views: 3323

Re: 11525 - Permutation

Hint: split the vectors into smaller ones so that you search and removal time reduces.
by pvncad
Sun Oct 12, 2008 6:13 pm
Forum: Volume 115 (11500-11599)
Topic: 11525 - Permutation
Replies: 9
Views: 3323

Re: 11525 - Permutation

You can improve the algorithm further. You don't need to n iterations to find what to print.

Hint: skip the numbers in block

-pvncad
by pvncad
Mon Mar 31, 2008 7:15 am
Forum: Volume 114 (11400-11499)
Topic: 11444 - Sum
Replies: 8
Views: 1685

I did the same thing. kept the partial sums of i^k S and
computed fF(k, a, b) using binomial expansion. Still I am getting WA?
it was running fine for sample inputs and all of my own testcases.

Could someone provide some inputs ?
by pvncad
Mon Mar 17, 2008 11:20 am
Forum: FAQ
Topic: Borring System
Replies: 20
Views: 17729

andmej wrote:
What I miss the most is the e-mail received every time you submitted a problem.
It was very useful feature. I would love if we have it back.

[/quote]
by pvncad
Tue Sep 11, 2007 6:02 am
Forum: Volume 112 (11200-11299)
Topic: 11260 - Odd Root Sum
Replies: 22
Views: 11375

I am getting WA. Any problem with following code ? long long N = 0, n, res, nn; while (1) { scanf("%lld", &N); if (N == 0) return 0; if (N % 2 == 0) N --; n = floor(sqrt(N)) - 1; res = (n *( n + 1)) / 2; if ( res % 3 == 0) { res = (res / 3 ) * ( 2 * n + 1); } else { res *= (2 * n + 1 ) / 3; } nn = (...
by pvncad
Sat Aug 04, 2007 4:07 pm
Forum: Volume 112 (11200-11299)
Topic: 11258 - String Partition
Replies: 18
Views: 10371

Will try to recode and see how it goes. Thanks for ur help
by pvncad
Sat Aug 04, 2007 2:19 pm
Forum: Volume 112 (11200-11299)
Topic: 11258 - String Partition
Replies: 18
Views: 10371

i don't think that is a problem. num[j] represents the j-length digit starting from i + 1th position.
by pvncad
Sat Aug 04, 2007 2:12 pm
Forum: Volume 112 (11200-11299)
Topic: 11258 - String Partition
Replies: 18
Views: 10371

yup all r long long
by pvncad
Sat Aug 04, 2007 2:07 pm
Forum: Volume 112 (11200-11299)
Topic: 11258 - String Partition
Replies: 18
Views: 10371

I too felt the same but got so many WAs.

Can you anything wrong with this code ?

Code: Select all

=======    Removed ============

by pvncad
Sat Aug 04, 2007 1:42 pm
Forum: Volume 112 (11200-11299)
Topic: 11254 - Consecutive Integers
Replies: 24
Views: 11696

Actually, mine is also O(sqrt(2 *n))
by pvncad
Sat Aug 04, 2007 1:40 pm
Forum: Volume 112 (11200-11299)
Topic: 11254 - Consecutive Integers
Replies: 24
Views: 11696

I have solved this using O(sqrt(n)). emotional blind, any clue on o(1) solution ?
by pvncad
Sat Aug 04, 2007 1:18 pm
Forum: Volume 112 (11200-11299)
Topic: 11258 - String Partition
Replies: 18
Views: 10371

11258 - String Partition

I tried to solve this using DP. But was getting WA.

Can someone give me tricky i/o ?

Thanks
by pvncad
Sun Jul 29, 2007 11:22 am
Forum: Volume 112 (11200-11299)
Topic: 11247 - Income Tax
Replies: 50
Views: 20806

9799
by pvncad
Sun Jul 29, 2007 8:41 am
Forum: Volume 112 (11200-11299)
Topic: 11245 - Anti-Arithmetic-Sequence
Replies: 18
Views: 5901

thanks. Now, I know what I missed out.

Go to advanced search