## Search found 15 matches

Mon Sep 16, 2002 9:06 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 197525

### that is not true.

you CAN do this : for (int i=10;i<20;i++) ... if you write in C++ and you CANNOT in ANSI C It is simple really. As for the count word. It is possible not to be reserved, but I had this problem with other word, but I am not sure witch exactly. I really don`t wrire on DJGPP, the only way to be sure ab...
Mon Sep 16, 2002 8:56 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 24405

### I said I got Accepted

Yes ,you are right that computing (int) 4.10*100 is 409, but it is ok with 20. By the way the same problem exists with double and long double, but with other values.
Any way that is not the problem
Sun Sep 15, 2002 7:13 pm
Forum: Volume 1 (100-199)
Topic: 113 - Power of Cryptography
Replies: 163
Views: 18632

### I am not sure you should write this

I really don`t think that it is good to ask such a questions here. After all, if algorith is esential part of the problem. :x Any way I will give you a hint. There is NO number theory for this problem. Just (almost) brute force. :wink: Any way I still think that such question should not be asked here.
Sun Sep 15, 2002 7:05 pm
Forum: Volume 1 (100-199)
Topic: 147 - Dollars
Replies: 233
Views: 24405

### that is senseless

I used [cpp]i=(int)(n*20); [/cpp]and got accepted. Just a hint I used float for n, not double. (Any way I hope that this isn`t your error - it is STUPID )
Sun Sep 15, 2002 6:57 pm
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 197525

### (a) few thoughts

First are you sure you send it az C++, not as a C code. Second this variable count. I am not sure but if it is doubled in the compiler as a reserved word there may be trouble. And last, but not least It would be great if pasted and the errors the jusge returned to you. See, normally(if option not sw...
Thu Sep 12, 2002 6:20 pm
Forum: Volume 1 (100-199)
Topic: 109 - SCUD Busters
Replies: 96
Views: 25820

### a hint

I also got AC, but my solution prints 0.00 on the last test posted.
So I think that it is counted to be hitten if the position is inside the walls,
not on a site.
Wed Sep 11, 2002 4:24 pm
Forum: Volume 1 (100-199)
Topic: 125 - Numbering Paths
Replies: 56
Views: 6255

### I have the same problem

but the input you give is ok on my computer.
Tue Sep 10, 2002 1:42 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 197525

### some hints

There is one very common error on this task: preasuming that a<=b it is not true if I remember right. As fas as having a faster code - may be you could save an array with already computed values. E.g. you will compute length(10) once for 10 10, and one more time for 1 15. That is very stupid for mul...
Tue Sep 10, 2002 1:33 am
Forum: Volume 1 (100-199)
Topic: 151 - Power Crisis
Replies: 56
Views: 5580

### may be you should paste you code.

Don`t worry this site is full of broken code. If you paste it someone may find the error. By the way WA could also be a result of "array" problems. For example on my computer I write on MS Visual C and as a result it treats these two codes identical: [cpp]int a[5]; ... a[0]=...; <=> a[5]=..;[/cpp] G...
Tue Sep 10, 2002 1:24 am
Forum: Volume 1 (100-199)
Topic: 186 - Trip Routing
Replies: 15
Views: 4723

### I finally solved my problems

So if someone wants help on these two I am ready to help.
Tue Sep 03, 2002 8:18 pm
Forum: Volume 1 (100-199)
Topic: 186 - Trip Routing
Replies: 15
Views: 4723

### here is the source code of 186

I solved the problem with 187, but 186 continues to be WA. [cpp]#include <stdio.h> #include <string.h> int n; char a[25],b[25],c[15]; int v; char town[110][25]; char nm[110][110][15]; int vals[110][110]; int m[110][110]; void gstr(char * st,char ch,int len) { int i=0; char c; while ((c=getchar())!=c...
Sun Sep 01, 2002 6:38 pm
Forum: Volume 1 (100-199)
Topic: 187 - Transaction Processing
Replies: 18
Views: 4990

### finaly got Accepted

My problem was when dividing by 100. I solved it by dividing not by 100.0, but using integer division by 100 and %100
Sat Aug 31, 2002 8:33 pm
Forum: Volume 1 (100-199)
Topic: 188 - Perfect Hash
Replies: 9
Views: 5349

### hmmm

The second part seems alright to me(it is almost the same as mine- I got ACC). However, I don`t know if you read the words ok. Are you sure you read the last word?
Sat Aug 31, 2002 8:20 pm
Forum: Volume 1 (100-199)
Topic: 186 - Trip Routing
Replies: 15
Views: 4723

### 186 - Trip Routing

Can somebody tell me why 186 and 187 give WA time after time?
Is there some tricky input/output or it is just some spacing or something else?
Thu Aug 29, 2002 11:11 pm
Forum: Volume 1 (100-199)
Topic: 187 - Transaction Processing
Replies: 18
Views: 4990

### I have the same problem

It is not much, but atleast you know you are not alone. If I accept it or receive some other information I will write.