## Search found 16 matches

Wed Jan 24, 2007 7:16 pm
Forum: Volume 106 (10600-10699)
Topic: 10617 - Again Palindrome
Replies: 12
Views: 6168

### 10617 : Again Palindromes

Can someone explain me how is the answer for ABA 5?
I counted 4 :
1. leave as it is
2. remove B
3. remove A and A
4. remove everything
Sat Aug 19, 2006 8:06 pm
Forum: Volume 1 (100-199)
Topic: 163 - City Directions
Replies: 24
Views: 11026
Is this case allowed? What's the AC program output? Thanks for replies. A4W S1N SW TURN RIGHT TURN HALF RIGHT TURN SHARP RIGHT GO STRAIGHT 41 GO -32 PW TURN RIGHT TURN RIGHT GO STRAIGHT 21 TURN HALF LEFT TURN SHARP LEFT GO ON 47 TURN HALF LEFT OPPEKEOBWFGFXRYISILEIMFGUFRZZZDWVO TURN SHARP LEFT TURN ...
Fri Jun 30, 2006 3:29 pm
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 5338
Thanks, that makes sense.

EDIT: How do you check if tree is not obscured by another tree?
Fri Jun 30, 2006 2:11 pm
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 5338
Why are you dividing problem into quarter planes? How do you deal with trees on the border between planes?
Sun Jun 04, 2006 2:40 am
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 5338
I also have trouble with that problem. I don't know how to do it...

Tue May 23, 2006 9:51 pm
Forum: Volume 1 (100-199)
Topic: 148 - Anagram checker
Replies: 31
Views: 4808
Are you sure about correctness of your output? In the last case you repeated some lines.
Mon May 22, 2006 10:34 pm
Forum: Volume 1 (100-199)
Topic: 148 - Anagram checker
Replies: 31
Views: 4808
Any replies? I'm sure somebody here got AC for this problem. I'm seriously stuck.
Sun May 21, 2006 3:28 pm
Forum: Volume 1 (100-199)
Topic: 148 - Anagram checker
Replies: 31
Views: 4808

### [148] WA - Clarifications.

I get WA for this problem, and I have no idea what's wrong. I would be really thankful to anybody providing some tricky test case or answering the following questions: 1. Can we reuse words? 2. What about duplicate words? 3. Can we have multiple inputs? I would appreciate output from AC code for tha...
Sat Apr 29, 2006 3:14 am
Forum: Volume 1 (100-199)
Topic: 139 - Telephone Tangles
Replies: 66
Views: 9688

### 139 WA - need input

I'm doing that problem for a quite long time, and I'm desparate now. Could anybody supply some test cases that could brake that code: // Telephone Tangles - acm.uva.es/p/v1/139.html // by Artur Dmowski #include <cstdio> #include <cstdlib> #include <cstring> #define MAXL 10001 #define REP(i,n) for(in...
Fri Jan 20, 2006 5:36 pm
Forum: Volume 1 (100-199)
Topic: 128 - Software CRC
Replies: 62
Views: 8898

### 128-Software CRC WA

I have no idea what's wrong with my code. Does anybody have some special cases or other inputs. Here is my code: // Software CRC - acm.uva.es/p/v1/128.cpp // by Artur Dmowski #include <cstdio> #include <cstring> #define G 34943 using namespace std; char line[1500]; int crc,m,k,i; int main() { #ifnde...
Sun Dec 18, 2005 5:05 pm
Forum: Volume 1 (100-199)
Topic: 114 - Simulation Wizardry
Replies: 80
Views: 9273

### 114 WA

I have no idea why it gets WA. I tested my program for all inputs available on board and it works. Any ideas? //Simulation Wizardry - acm.uva.es/p/v1/114.html #include <iostream> #include <cstring> #include <cstdio> #define MAXD 55 #define REP(i,n) for(int tn=n,i=0; i < tn; i++) using namespace std;...
Sat Dec 03, 2005 4:22 am
Forum: Volume 1 (100-199)
Topic: 109 - SCUD Busters
Replies: 96
Views: 26912

### 109 WA

Can anybody help me with that problem? Judge says WA and I have no idea what could be wrong. Thanks in advance, for replies. //SCUD Busters - acm.uva.es/p/v1/109.html #include <cstdio> #include <cstdlib> #include <cassert> #include <cstring> #include <climits> #include <cmath> #include <algorithm> #...
Sat Oct 29, 2005 1:51 am
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 54077

### 101 RE and no ideas

Can anybody help with that code. I try to find some bug that makes runtime error but it always works. Thanks in advance, for any replies. #include <cstdio> #include <cstring> #define MAXN 25 using namespace std; long contains[MAXN][MAXN], pos[MAXN], size[MAXN]; void setup(){ int i,j; for(i = 0; i < ...
Sun Oct 23, 2005 3:59 pm
Forum: Other words
Topic: USACO --- cowxor
Replies: 4
Views: 2742
Oh, there is no problem actually. I was solving that problem under winxp cause my linux box was 'injured' for a moment. WinXp is so memory devouring that I didn't have place to allocate 1<<21 integers which lead my to asking that question. Now everything is ok. Thanks again for your reply.
Sun Oct 23, 2005 4:29 am
Forum: Other words
Topic: USACO --- cowxor
Replies: 4
Views: 2742
Hi. Thanks for your reply. So now I realized that my problem wasn't really a problem. I thought that 1<<21 is too much space but it's ok on usaco machinges. However, it gives errors on my machine. Does anybody know how to fix that? I guess there is some kind of flag that reduces it.