## Search found 19 matches

Tue Mar 16, 2004 2:32 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 19191

### ^-^

I guess that your solution is brute force.

I got Accepted using brute force, but I optimize a fomula.

I used log function.

Of course, Brute force is not good solution.

Newton's method is better solution than brute force.
Tue Mar 16, 2004 2:21 am
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 32942

### ^_^

If more than one order of brown, green, and clear bins yields the minimum number of movements then the alphabetically first string representing a minimal configuration should be printed.
BCG
BGC
GBC
GCB
CBG
CGB

is not alphabetically order.
Sun Mar 14, 2004 10:47 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 19191

### Thank you^^

I got ACCEPTED.
Sun Mar 14, 2004 10:45 am
Forum: Volume 1 (100-199)
Topic: 109 - SCUD Busters
Replies: 96
Views: 24138

### 109 Plz help me

I got RUN TIME ERROR (SIGSEGV). I don't know why SIGSEGV. I tested any input set that I got it in this site. Plz Help Me... :roll: [c] #include <stdio.h> #include <math.h> #include <string.h> typedef struct _KINGDOM { int x; int y; } KINGDOM; #define MAX 20 KINGDOM table[MAX][110]; int table_count[M...
Mon Mar 08, 2004 4:05 am
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 19191

### [107] I can't understand...ToT Plz help me.

I am a primer. I want to solve a problem of 107. However, I can't understand this problem unfortunately. What do follow sentences mean? The number of cats inside each (non-smallest) cat's hat is a constant, N. The height of these cats-in-a-hat is 1/(N+1) times the height of the cat whose hat they ar...
Sat Feb 28, 2004 6:03 am
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 36693

### ^^

my code gives: 0: 0 1: 1 2 2: 3: 4: 5: 5 4 6 6: 7: 7 9 3 8: 8 9: 10: 10 11 12 11: 12: 13: 13 14: 14 17 15: 15 16: 16 17: 18: 18 my question is, how do 7 9 3 go over 8 in the end? Insert this condition. You will get accept. Any command in which a = b or in which a and b are in the same stack of bloc...
Fri Feb 27, 2004 1:43 am
Forum: Volume 1 (100-199)
Topic: 142 - Mouse Clicks
Replies: 58
Views: 5966

### Huk

Huk..............

I fixed followed code.
printf("%3c", (char)(i + 49)); -> printf("%3d", i + 1);
And I got Accepted.

Ha Ha.............. Sorry... my mistake ToT

Very large mistake!!!

Thank you very much El-idioto
Fri Feb 27, 2004 12:48 am
Forum: Volume 1 (100-199)
Topic: 142 - Mouse Clicks
Replies: 58
Views: 5966

### ^^

Thank you

strain my eyes.........................FULL SEARCHING^-^
Thu Feb 26, 2004 10:12 am
Forum: Volume 1 (100-199)
Topic: 142 - Mouse Clicks
Replies: 58
Views: 5966

### 142 Mouse Clicks...WA..ToT

I solved this problem easily. But, judge server judged Wrong Answer. I can't find my mistake...ToT Give me correct input and output set. Help me......ToT~~~~ :cry: [cpp] #include <stdio.h> typedef struct _POINT { int x; int y; bool hidden; } POINT; typedef struct _RECT { int left; int top; int right...
Thu Jan 02, 2003 11:50 am
Forum: Volume 1 (100-199)
Topic: 105 - The Skyline Problem
Replies: 160
Views: 26867

### [105] Stupid Judge

I accepted SkyLine Problem.

But, I find that my solution is wrong.

Test case,

3 2 4
3 1 7
5 2 6

Exactly output is

3 2 4 1 5 2 6 1 7 0

But, Judge Server accept follow output.

3 2 6 1 7 0

Hm....
Fri Aug 30, 2002 11:31 am
Forum: Volume 103 (10300-10399)
Topic: 10351 - Cutting Diamonds
Replies: 10
Views: 5248

### Judge Server is very Stupid...

This source is Accept... Very similar Code, But compare parameter(i, j) is different. Judge Server is very very stupid..!!! [cpp] #include<stdio.h> #define PI 3.14159265358979323846 double sqr(double a); typedef struct _Coordinate { int x; int y; int z; } Coordinate; int main() { Coordinate Box[3], ...
Fri Aug 30, 2002 10:14 am
Forum: Volume 103 (10300-10399)
Topic: 10351 - Cutting Diamonds
Replies: 10
Views: 5248

### 10351 - Cutting Diamonds

Sample outputs are Perfect. But, I recieve WA, again. My Solution is wrong? [cpp]#include<stdio.h> #define PI 3.14159265358979323846 double sqr(double a); typedef struct _Coordinate { int x; int y; int z; } Coordinate; int main() { Coordinate Box[3], Diamond[3]; int i, j, count = 1; bool first; floa...
Sat Aug 10, 2002 4:13 pm
Forum: Volume 3 (300-399)
Topic: 313 - Intervals
Replies: 10
Views: 4761

### I find my mistake...but WA

I have three situations.

1. Light's x-coordinate == Pipe's x-coordinate

2. Light's x-coordinate > Pipe's x-coordinate

3. Light's x-coordinate < Pipe's x-coordinate

any more situation?
Fri Aug 09, 2002 9:01 pm
Forum: Volume 3 (300-399)
Topic: 313 - Intervals
Replies: 10
Views: 4761

### 313 - Intervals

Easy Algorithm... But I recieve WA, again. Sample test set is perfect. Would you help me...? [cpp] #include<stdio.h> #include<math.h> typedef struct _coordinate { int x; int y; } Coordinate; typedef struct _interval { double start; double end; } Interval; void ComputeInterval(Coordinate Light, Coord...
Mon Aug 05, 2002 8:49 pm
Forum: Volume 4 (400-499)
Topic: 460 - Overlapping Rectangles
Replies: 25
Views: 2347

### [460] Is This Multiple Input??? -_-;;;

Why WA?? This problem is Multiple Input? I don't know my mistake.... :cry: [cpp] #include <iostream> using namespace std; int min(int a,int b); int max(int a,int b); int main() { int XLL1,YLL1,XUR1,YUR1,XLL2,YLL2,XUR2,YUR2; cin>>XLL1>>YLL1>>XUR1>>YUR1; cin>>XLL2>>YLL2>>XUR2>>YUR2; XLL1=max(XLL1,XLL2...