Search found 22 matches

by taskin
Tue Oct 17, 2006 9:21 am
Forum: Volume 101 (10100-10199)
Topic: 10147 - Highways
Replies: 67
Views: 20539

10147 Highways - MLE

this is saying MLE, which should not be. can anyone help me? here fx & fy r local & other 2 r global. #define SIZE 751 struct Edge { int u, v; double w; bool is_MST; }; struct Node { int size; int father; }; Node forest[SIZE]; Edge A[SIZE * SIZE]; double fx[SIZE],fy[SIZE];
by taskin
Sat Sep 02, 2006 8:15 am
Forum: Volume 101 (10100-10199)
Topic: 10120 - Gift?!
Replies: 16
Views: 3897

thanks. but if i dont use special case (for n > 49, result always let me try) then it only results MLE. so i had to use special checking. is there any way to solve this without this special checking?
by taskin
Wed Aug 30, 2006 6:58 am
Forum: Algorithms
Topic: 2 counting problems
Replies: 2
Views: 1534

2 counting problems

1. there is a convex polygon of size n (may not be regular). what is the maximum number of regions created inside it by all its diagonals. for example if n = 3 then region = 1 and n = 4 then region = 4. 2. there are n circles. what is the maximum number of regions created by their intersection. e.g....
by taskin
Thu Aug 03, 2006 2:26 pm
Forum: Volume 101 (10100-10199)
Topic: 10120 - Gift?!
Replies: 16
Views: 3897

10120 Gift

i think this problem can be solved by using bfs. but my following code give wa. can anyone help? my idea is wrong or i just made wrong implementation of bfs?

// code deleted after AC
by taskin
Fri Jul 14, 2006 10:41 pm
Forum: Volume 1 (100-199)
Topic: 195 - Anagram
Replies: 242
Views: 26694

"the words should be output in alphabetically ascending order".
check this input:
1
aB

output:
aB
Ba
by taskin
Fri Jul 14, 2006 10:23 pm
Forum: Volume 101 (10100-10199)
Topic: 10104 - Euclid Problem
Replies: 29
Views: 10021

correction of previous post :
"but i made a small mistake in my implementation & after rechecking now its AC."
im in sleepy mind.
by taskin
Fri Jul 14, 2006 10:19 pm
Forum: Volume 101 (10100-10199)
Topic: 10104 - Euclid Problem
Replies: 29
Views: 10021

yes, nothing additional is needed after this algorithm. but i made a small mistake in my implementation after rechecking & now its AC.
by taskin
Wed Jul 12, 2006 9:39 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 183074

i dont understand what's ur problem, wa or tle? if tle, then try to store the values without recompute every time.
by taskin
Thu Jun 22, 2006 11:55 am
Forum: Volume 100 (10000-10099)
Topic: 10014 - Simple calculations
Replies: 34
Views: 8474

thanks. yes, this program falls in an infinite recursion when n > 1. in fact, it's not possible to solve this by using recursive call.
by taskin
Tue Jun 20, 2006 4:49 pm
Forum: Volume 101 (10100-10199)
Topic: 10106 - Product
Replies: 98
Views: 27276

java suporrt in judge is not good. i think class BigInteger is not available yet. read this
http://acm.uva.es/problemset/java.html
by taskin
Sun Jun 18, 2006 10:27 pm
Forum: Volume 101 (10100-10199)
Topic: 10104 - Euclid Problem
Replies: 29
Views: 10021

10104 - Euclid Problem

If there are several such X and Y, you should output that pair for which |X|+|Y| is the minimal (primarily) and X<=Y (secondarily). how can i test this? i use following algorithm-- Extended(a,b) if b = 0 then return (a,1,0) (d1, x1, y1) <--- Extended (b, a mod b) (d, x, y) <---- (d1, y1, x1 - floor(...
by taskin
Tue Jun 13, 2006 12:52 pm
Forum: Algorithms
Topic: n queen problem needed
Replies: 3
Views: 2410

n queen problem needed

can anyone give me n-queen problems except 167, 750 & 10094
by taskin
Fri Jun 09, 2006 4:23 pm
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 38826

its better to describe ur algo. i dont know pascal & so i cant check the code. i solved it just simulating the commands.
by taskin
Tue Jun 06, 2006 5:54 am
Forum: Volume 5 (500-599)
Topic: 531 - Compromise
Replies: 73
Views: 25575

thanks, but i still not found any error.
by taskin
Thu Jun 01, 2006 8:05 am
Forum: Volume 5 (500-599)
Topic: 531 - Compromise
Replies: 73
Views: 25575

531 - compromise WA

i have tried many times but still wa. i need the ans of some question 1. what is the output if no common sequence found 2. what to do if empty text occure 3. is there any punctuation in input. i use isgraph() to parse different words but no other character other than a...z will be in the output 4. f...

Go to advanced search