Search found 69 matches

by x140l31
Tue Jun 15, 2010 1:19 am
Forum: General
Topic: online judge site down for quite some time
Replies: 1
Views: 3454

Re: online judge site down for quite some time

Hi!

I got the same problem.

For people that in a future have the same problem... you should clean your cookies.
by x140l31
Wed Jul 15, 2009 1:31 am
Forum: Volume 114 (11400-11499)
Topic: 11455 - Behold my quadrangle
Replies: 21
Views: 11041

Re: 11455 - Behold My Quadrangle

Enzam wrote:It is possible to make an quadrangle when sum of its 3 side is equal to other side.

And Beware of the fact that the lengths are not in sorted order!
It isn't!!!

How to make a quadrangle when the sum of 3 sides is equal to the other side????????? It's a line!!! not a poligon!
by x140l31
Wed Jul 01, 2009 7:40 pm
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 52253

Re: 10267 - Graphical Editor

well guys, after take a look in some previous posts I could fix the RTE I was receiving, but now WA is chasing me. Maybe somebody could find what I'm doing wrong. #include <stdio.h> #include <stdlib.h> void newTable( char x[][252] ){ int i, j; for(i = 0; i<252; i++){ for( j = 0; j<252; j++ ){ if( i...
by x140l31
Wed Jul 01, 2009 7:31 pm
Forum: Volume 102 (10200-10299)
Topic: 10267 - Graphical Editor
Replies: 190
Views: 52253

Re: 10267 - Graphical Editor

Just because it says (x1, y1) is the upper-left and (x2, y2) is the lower-right does not mean that x1 < x2, and y1 < y2. The lower-right could be in the upper left and the upper left could be in the lower right. In my AC code, I always swap X1, X2 (if X1 > X2), Y1, Y2 (if Y1 > Y2) in cases V, H and...
by x140l31
Tue Jun 30, 2009 9:26 pm
Forum: Volume 3 (300-399)
Topic: 350 - Pseudo-Random Numbers
Replies: 56
Views: 16361

Re: 350

The only thing wrong is that you have to generate first a random number and then start your calculations Remove you code after AC :D I don't understand why it will modify the output... I changed it and still getting WA =/ Removed after AC L might not be less than M Critical Input: 1111 1111 1111 11...
by x140l31
Tue Jun 30, 2009 1:16 am
Forum: Volume 113 (11300-11399)
Topic: 11342 - Three-square
Replies: 14
Views: 6633

Re: 11342 - Three-square

sazzadcsedu wrote:can anyone tell me how to optimize it.i got tle.
try comparing the sum i*i+j*j don't exceed n
by x140l31
Sun Jun 07, 2009 4:10 pm
Forum: Volume 3 (300-399)
Topic: 333 - Recognizing Good ISBNs
Replies: 166
Views: 21614

Re: 333 - Recognizing Good ISBNs

0-89237-010-6 test 0-89237-010-6 TEST output: correct incorrect this are the output frm http://www.uvatoolkit.com/problemssolve.php but i dont understand why?? problem statement dont say that case matters or this kind of input(with alphabet except X as 10th number) can be correct. from previous thr...
by x140l31
Sun Jun 07, 2009 2:48 am
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 39934

Re: Re:

A little speech about the problem: I got at least 6 times WA for the given code ( in the previous post). I posted here bcz I didn't found any bug in my code. I hoped that I will get helped from the great helpers about my problem. But I failed to get help from others. I think somebody ( cordial pers...
by x140l31
Fri Jun 05, 2009 9:54 pm
Forum: Volume 104 (10400-10499)
Topic: 10412 - Big Big Trees
Replies: 15
Views: 8901

Re: 10412 - Big Big Trees

Can anyone help me please? I read all your I/O and hints but still WA =/ #include <iostream> #include <cmath> using namespace std; double distance(int m, int h1, int leaf1, int h2, int leaf2) { int x = m - leaf1 - leaf2; int y = h1 - h2; return sqrt((double) x*x + y*y); } int ccw(int Ax, int Ay, int...
by x140l31
Fri Oct 24, 2008 10:43 pm
Forum: Volume 7 (700-799)
Topic: 785 - Grid Colouring
Replies: 27
Views: 13665

Re: 785 - Grid Colouring

can anyone help me? I get RE! why? #include <iostream> using namespace std; void floodFill(char map[31][81], int i, int j, char fill) { map[i][j] = fill; if (map[i - 1][j] == ' ') floodFill(map, i - 1, j, fill); if (map[i + 1][j] == ' ') floodFill(map, i + 1, j, fill); if (map[i][j - 1] == ' ') floo...
by x140l31
Sat Oct 18, 2008 2:37 am
Forum: Volume 5 (500-599)
Topic: 501 - Black Box
Replies: 35
Views: 16126

Re:

I don't know if your algorithm is correct, I'm no C++ guy. The problem as I implemented it: with each "ADD" query add the number to your data structure. With the i-th "GET" query print the i-th smallest number in the data structure. The problem comes from NEERC' 1996 regionals. You can use the test...
by x140l31
Wed Oct 08, 2008 7:50 pm
Forum: Volume 113 (11300-11399)
Topic: 11398 - The Base-1 Number System
Replies: 23
Views: 9647

Re: 11398 - The Base-1 Number System

To x140l31 Submit your code again. I did not know that GNU C++ compiler supports and operator. while (cin >> block and block != "~") is similar to while (cin >> block && block != "~") Returning a value from int main() is a good practice. You will get accepted. May be you submitted wrong code before...
by x140l31
Tue Oct 07, 2008 10:16 pm
Forum: Volume 113 (11300-11399)
Topic: 11398 - The Base-1 Number System
Replies: 23
Views: 9647

Re: 11398 - The Base-1 Number System

lnr wrote:To x140l31

Try this
Input:

Code: Select all

000 00 0 00 000 #
~
Output:

Code: Select all

2
Thanks all.
:-? why!!!

000 is ignored (it's a valid input? doesn't matter...) RESULT = 0
00 FLAG = 0 RESULT = 0
0 FLAG = 1 RESULT = 0
00 FLAG = 0 RESULT = 0
000 push 3-2=1 digits of FLAG = 0 RESULT = 0

result = 0
by x140l31
Sun Sep 14, 2008 1:59 am
Forum: Volume 110 (11000-11099)
Topic: 11063 - B2-Sequence
Replies: 73
Views: 39986

Re: 11063 - B2-Sequence

please help!!!! I'm desesperate T.T

what's wrong in this code? T.T

Code: Select all

Removed after AC
by x140l31
Fri Sep 12, 2008 3:21 am
Forum: Volume 100 (10000-10099)
Topic: 10099 - The Tourist Guide
Replies: 91
Views: 28690

Re: 10099 - The Tourist Guide

anyone can see what's wrong in this code? #include <iostream> #include <cmath> using namespace std; int main() { int n, r, sce = 1; while (cin >> n >> r and n) { int minRoads[n + 1][n + 1], x, y, t; for (int j = 1; j <= n; ++j) for (int i = 1; i < j; ++i) minRoads[i][j] = 0; while (r--) { scanf("%d ...

Go to advanced search