Search found 38 matches

by amishera
Sat Oct 20, 2012 6:31 am
Forum: Volume 1 (100-199)
Topic: 103 - Stacking Boxes
Replies: 200
Views: 19598

Re: 103 problem ...

Hi I am getting verdict as "blank". What does it mean? I am waiting for more than 24 hours to get a verdict.
by amishera
Sat Jul 03, 2010 1:55 am
Forum: Volume 101 (10100-10199)
Topic: 10158 - War
Replies: 23
Views: 9243

Re: 10158 - War

You have to use disjoint set forest algorithm. Or you can also use binary search tree. I think disjoint forest would be faster.
by amishera
Sun Jun 13, 2010 1:24 am
Forum: Volume 4 (400-499)
Topic: 409 - Excuses, Excuses!
Replies: 63
Views: 8955

Re: 409 - Excuses, Excuses

I had trouble getting it accepted. I did a funny thing. In stead of putting a newline character in between the outputs, I put it at the end of every output. And then it was accepted. It was funny because it could have shown presentation error instead of WA.
by amishera
Fri Jun 11, 2010 12:22 am
Forum: Algorithms
Topic: Non-Text Book Algorithms
Replies: 2
Views: 3223

Re: Non-Text Book Algorithms

I am also wondering on this. I figured you got to read journal papers related to algorithms. I have some books which covers specialized algorithm such as bit manipulation, string matching(bio-informatics) and so on. I have also found a book on dynamic programming and greedy algorithm. Besides there ...
by amishera
Fri Jun 11, 2010 12:17 am
Forum: Volume 100 (10000-10099)
Topic: 10069 - Distinct Subsequences
Replies: 26
Views: 11588

Re: 10069 - Distinct Subsequences

hmm. I found the bug. For 2 rather simple test cases:
accepted/accept
success/scs
by amishera
Fri Jun 11, 2010 12:16 am
Forum: Volume 5 (500-599)
Topic: 540 - Team Queue
Replies: 37
Views: 16095

Re: 540- Team Queue, RTE

I have a question. Any help would be greatly appreciated on this. I did straightforwardly for mapping team members to team. Like I created a big array with 1M entry, where the index is the member and array value is the team. What could be the elegant way to map this? I tried using bst for hashing bu...
by amishera
Tue Jun 08, 2010 11:42 pm
Forum: Volume 101 (10100-10199)
Topic: 10104 - Euclid Problem
Replies: 29
Views: 9960

Re: 10104 - Euclid Problem

what would be the output for

0 0?

would it be nothing or a blank line?
by amishera
Thu May 27, 2010 2:59 am
Forum: Volume 100 (10000-10099)
Topic: 10069 - Distinct Subsequences
Replies: 26
Views: 11588

Re: 10069 - Distinct Subsequences

Jagadish's first set of input caused the uvatoolkit to break.

are there any more input sets to consider? I tried all the test cases posted here and seemingly the program passed.
by amishera
Fri May 21, 2010 2:25 am
Forum: Volume 101 (10100-10199)
Topic: 10131 - Is Bigger Smarter?
Replies: 93
Views: 64566

Re: 10131 - Is Bigger Smarter?

I have this question: 500(3) 1000(4) 1100(5) 2000(9) 6000(2) 6000(6) 6000(8) 6008(1) 8000(7) 4000(4) 3000(5) 2100(2) 2000(3) 2000(6) 1900(9) 1400(7) 1300(1) 1200(8) Why is the answer not 4 5 2 6 7? 1000(4) 1100(5) 6000(2) 6000(6) 8000(7) 4000(4) 3000(5) 2100(2) 2000(6) 1400(7) If the answer can be o...
by amishera
Wed May 19, 2010 3:26 am
Forum: Volume 6 (600-699)
Topic: 624 - CD
Replies: 77
Views: 33270

Re: 624 - CD

For the sample input/ouput sequence:

45 8 4 10 44 43 12 9 8 2

why is the solution not

43 2?

I tested this sequence (the permutation of the above):

45 8 43 2 4 10 44 12 9 8

with

http://uvatoolkit.com/problemssolve.php

and the output is coming out as

43 2
by amishera
Wed May 12, 2010 1:33 am
Forum: Volume 102 (10200-10299)
Topic: 10252 - Common Permutation
Replies: 150
Views: 51290

Re: 10252 - Common Permutation

My problem is rather simple. I used the print_LCS from the cormen book: PRINT-LCS(b, X, i, j ) 1 if i = 0 or j = 0 2 then return 3 if b[i, j ] = “&” 4 then PRINT-LCS(b, X, i ? 1, j ? 1) 5 print xi 6 elseif b[i, j ] = “?” 7 then PRINT-LCS(b, X, i ? 1, j ) 8 else PRINT-LCS(b, X, i, j ? 1) and implemen...
by amishera
Tue May 11, 2010 11:28 pm
Forum: Volume 100 (10000-10099)
Topic: 10082 - WERTYU
Replies: 57
Views: 6843

Re: 10082 - WERTYU

What does this mean? 7961513 10082 WERTYU Accepted C++ 0.008 2010-05-11 21:30:27 7961460 10082 WERTYU C++ 0.000 2010-05-11 20:54:31 7961442 10082 WERTYU C++ 0.000 2010-05-11 20:46:36 For the first 2 submissions there are no verdicts. And the mail I got has this: Your submission with number 7961460 f...
by amishera
Tue May 11, 2010 9:32 pm
Forum: Volume 107 (10700-10799)
Topic: 10719 - Quotient Polynomial
Replies: 51
Views: 17209

Re: 10719 - Quotient Polynomial

That is a pretty cool site. But it still didn't work. The both outputs match (tested using diff -b). Still WA. I don't understand what else can remain. k can be >0, <0 and ==0. the polynomial can be degree 0, 1, 2, 3, 4. Upto degree 4 polynomial should be representative. That should be all. But what...
by amishera
Tue May 11, 2010 12:07 am
Forum: Volume 107 (10700-10799)
Topic: 10719 - Quotient Polynomial
Replies: 51
Views: 17209

Re: 10719 - Quotient Polynomial

It seems like there are only 2 ways left to solve this:

1. beseech
2. bribe

if it were a girl instead then there would be a 3rd approach.
by amishera
Mon May 10, 2010 11:02 pm
Forum: Volume 107 (10700-10799)
Topic: 10719 - Quotient Polynomial
Replies: 51
Views: 17209

Re: 10719 - Quotient Polynomial

This is the code: #include <stdio.h> #include <string.h> #include <stdlib.h> #define MAX_DEGREE 20000 #define MAX_LEN 200000 char input[MAX_LEN]; int main() { int i; long a[MAX_DEGREE]; int k; int degree; long r; int j; long q[MAX_DEGREE]; long t; char* p; int n; char word[100]; int first = 1; // fr...

Go to advanced search