Search found 19 matches

Sun Oct 11, 2015 7:36 am
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 23677

Re: 147 - Dollars

Guys, I need help. My ideal code is getting WA :D. For test case: 300.00 0.00 It gives: 300.00 23123301210317 But AC answer (got from uDebug): 300.00 181490736388615 I checked 181490736388615 < 2^64-1 Here it is: Deleted (Because of AC) Updated: Fixed error, all problem was in convertion from float ...
Mon Feb 09, 2015 6:00 am
Forum: Volume 115 (11500-11599)
Topic: 11565 - Simple Equations
Replies: 21
Views: 6305

Re: 11565 - Simple Equations

Good day! I think this problem is solvable with careful bruteforce. We have 3 equations, but there is also another restriction, it is x < y < z. That is why, test 1 3 1 3 must be answered: No solution. From the third equation we can make conclusion that, range of variables' values is [-100, 100]. If...
Sun Feb 08, 2015 12:10 pm
Forum: Volume 12 (1200-1299)
Topic: 1216 - The Bug Sensor Problem
Replies: 7
Views: 5984

Re: 1216 - The Bug Sensor Problem

jddantes, here you can find analysis of this problem http://uvaanalysis.blogspot.ru/p/the-bug.html
There are also tips for WA cases.
Fri Feb 06, 2015 8:30 pm
Forum: Volume 12 (1200-1299)
Topic: 1265 - Tour Belt
Replies: 3
Views: 1246

Re: 1265 - Tour Belt

For this test case

Code: Select all

``````1
4 6
1 4 1
1 2 2
1 3 3
2 4 4
3 4 5
2 3 6
``````
Solution's out is:

Code: Select all

``````9
``````
Fri Feb 06, 2015 8:18 pm
Forum: Volume 12 (1200-1299)
Topic: 1265 - Tour Belt
Replies: 3
Views: 1246

Re: 1265 - Tour Belt

Help, I'm getting WA. My solution's strategy is this: group edges with same weights. After that, add heaviest edges. Count sizes of newly formed connected components. Do the same for all edge groups from heaviest to lightest. For test cases in the statement I got the same output, but my solution is ...
Fri Feb 06, 2015 10:48 am
Forum: Volume 12 (1200-1299)
Topic: 1265 - Tour Belt
Replies: 3
Views: 1246

Re: 1265 - Tour Belt

I can't even suggest any solution . Any ideas?
Tue Jul 01, 2014 1:55 pm
Forum: Volume 100 (10000-10099)
Topic: 10074 - Take the Land
Replies: 21
Views: 3826

Re: uva 10074: Take the Land WA

jishnu1 , I don't know what test case will break your solution, I can give you my code of solution, and you might generate outputs from it and compare them with your solution outs. #include <iostream> using namespace std; int M, N; int a[ 101 ][ 101 ]; int s[ 101 ][ 101 ]; void count_s() { int i, j...
Mon Jun 30, 2014 10:30 pm
Forum: Volume 115 (11500-11599)
Topic: 11503 - Virtual Friends
Replies: 49
Views: 18288

Rafiq123, explain your code. And take it into code area with tags.
Try to use sets not map
Fri Jun 27, 2014 8:06 pm
Forum: Volume 100 (10000-10099)
Topic: 10074 - Take the Land
Replies: 21
Views: 3826

Re: uva 10074: Take the Land WA

Correct your output code to printf("%d\n", maxSubRectz);
and you have errors in your code.
Mon Jun 16, 2014 6:39 am
Forum: Other words
Topic: Minimum Runtime
Replies: 1
Views: 2229

Re: Minimum Runtime

Hi. I think that firstly when you submit your solution to judge, it tests your solution. And if you got AC then judge will measure runtime to give you rank. So, if you want get top ranks, you should write AC and fast code. I want to say that program runtime is not important. When you are in competit...
Fri May 23, 2014 7:33 am
Forum: Bugs and suggestions
Topic: uHunt chat
Replies: 3
Views: 1739

Re: uHunt chat

Sun May 18, 2014 6:01 pm
Forum: Bugs and suggestions
Topic: uHunt chat
Replies: 3
Views: 1739

uHunt chat

I had been thinking a long about posting this topic in this group. The question: How to get uHunt code to sign in to uHunt chatroom? When you press "sign in", you get a message about how to get uHunt code. I sent email to uhunt@felix-halim.net, with subject "generate-code" at about month ago, but st...
Tue Jan 28, 2014 7:13 pm
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 27242

Re: Slow algorithm

problem is not in problem. I need help to count complexity of algorithms
Sun Jan 26, 2014 2:30 pm
Forum: Volume 101 (10100-10199)
Topic: 10110 - Light, more light
Replies: 76
Views: 27242

Slow algorithm

Hi! Yesterday I have been solving 10110 problem and had wrote this algorithm, the math model of the problem is very simple, solution is: if the number of dividers of number is even then we have to print "no", if odd we have to print "yes": Here is solution of problem, how did I solve it 1. Get the n...
Thu Jul 25, 2013 1:56 pm
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 53994

Re: Find critical input

I corrected this but still getting WA. :D #include <stdio.h> #include <ctype.h> #define MAXX 252 #define MAXY 252 #define CREATE_IMAGE 'I' #define CLEAR_IMAGE 'C' #define DRAW_PIXEL 'L' #define DRAW_VLINE 'V' #define DRAW_HLINE 'H' #define DRAW_FREC 'K' #define FILL 'F' #define SAVE_IMAGE 'S' #defin...