| Show all threads Hide all threads Show all messages Hide all messages |
| Delfi ne pret!!!!!!!!!!!!!!!!!!!!!!! Help!!!!!!!!!!! | NeChihi | | 21 May 2007 17:52 | 2 |
I am programming on Delphi7 . I sent my answeres but it Write "Wrong answer" I've used to write in delphi before i learned C++. It works fine. Look for mistake in your code |
| Nice task (+) | cxxcoder | 1396. Maximum. Version 2 | 21 May 2007 17:17 | 1 |
Nice task... I really like it...
Not very difficult, but not simple too |
| What is ' Wrong Answer 7' stands for? | TOOTH | 1036. Lucky Tickets | 20 May 2007 19:43 | 6 |
When I submited, it always said "Wrong Answer text#7"
Who can tell me what does it means? It means your program or your solution is wrong :) :))))))))) ACM.Krupko_Victor[Ivanovo SPU] 19 Jan 2006 18:51 what the number mean?
why isn't it '5' or '1' When you submit your program it is launching on
some tests. If after it you get WA 7 it means
that on 7-th of these tests your program gives
Wrong Answer. There is big answer on 7th test. |
| Problem with test #7. Need help :( | Fokysnik | 1036. Lucky Tickets | 20 May 2007 15:46 | 2 |
Henry Hu wrote that the problem is in multiplication of big numbers in checking the carry. But I still can't get what's wrong. Can anybody describe the problem with an example?
What's special in this test? Long answer.
Edited by author 20.05.2007 15:46 |
| No subject | xMagGTU Дмитрий Тишкин GPRS | 1023. Buttons | 19 May 2007 23:54 | 1 |
No subject xMagGTU Дмитрий Тишкин GPRS 19 May 2007 23:54
Edited by author 19.05.2007 23:54 |
| WA on test#1??Crash?what's wrong? | zero.xc | 1003. Parity | 19 May 2007 17:54 | 3 |
Why Crash?
Who can give me test#1?
Thanks I got wa on #1 too,it is driving me crazy! |
| Please help,I always have WA#1.Thank you very much!!!!! | CHIDEMYAN SERGEY | 1423. String Tale | 18 May 2007 17:53 | 12 |
[code deleted]
Edited by author 14.05.2007 17:50
Edited by author 14.05.2007 17:53
Edited by author 14.05.2007 17:55 Please,give me test#2!!!I can't understand where is my mistake?
What answer is right for this test:
1
a
a
answer:
0
or
answer:
-1
Thank you VERY Much!!!!!
Edited by author 14.05.2007 17:54
Edited by author 14.05.2007 17:54 my program writes 0
Edited by author 14.05.2007 18:59 Thank!!!Sorry,if you can,please give me test#1 & test#2 or some test,where in your opinion I could be wrong;I really don't understand why I always have wa#1!!!Thank you!!!
Edited by author 14.05.2007 21:23
Edited by author 14.05.2007 21:25 Test #1 is a sample test from the problem statement. Try to input data using stdio only or using iostream only, because your code works differently in the different compilers. Thank,but I used only <iostream.h> with functions cin,cout.And for input strings I used gets function.
In this tests my program output:
1
a
a
ans:0
1
a
b
ans:-1
2
aa
aa
ans:0
2
as
sa
ans:1
2
as
ad
ans:-1
and finnaly for test
11
abracadabra
racadabraab
ans:9
I tried to change gets to cin & now I have WA#4
Thank you very much for attention!!!
Edited by author 16.05.2007 17:30
Edited by author 16.05.2007 17:30
Edited by author 16.05.2007 17:32
Edited by author 16.05.2007 17:34
Edited by author 16.05.2007 17:35
Edited by author 16.05.2007 17:40
Edited by author 16.05.2007 17:42 Sorry,for test:
4
asde
ased
ans:-1
I think it right,isn't it?
Edited by author 16.05.2007 17:51
Edited by author 16.05.2007 17:55
Edited by author 16.05.2007 17:56 Try:
scanf("%d%s%s",&len,s,t);
without gets and cin Thank a lot!!!I have one more question:if you can please give me example of test#4,because I still have WA#4.It will help me to correct my algo!
Thank a lot!!!
Edited by author 17.05.2007 19:58 Thank,thank!!!!!Nice test,now I'll try to correct my algo!!!
Edited by author 18.05.2007 17:54 |
| WA 21 | Jony Inglish | 1498. Stroke at Full Speed | 17 May 2007 21:44 | 3 |
WA 21 Jony Inglish 8 May 2007 17:41 Please, give me some tests on #21 Please, give me some examples! I don't now why I get WA on test #21... Re: WA 21 {AESC USU} Evgeny Kurpilyanskij 17 May 2007 21:44 try this test
5 7 10
2 2
3 7
Ans: 7. |
| WhyCrash (floating-point invalid operation) test #10? | Neizvestnii | 1333. Genie Bomber 2 | 17 May 2007 18:07 | 1 |
Sorry, I have AC!
Edited by author 18.05.2007 17:10
Edited by author 18.05.2007 17:11 |
| Idea | TSU: Machvi | 1003. Parity | 17 May 2007 13:42 | 2 |
Idea TSU: Machvi 13 May 2007 02:39 something tells me that it must be solved by building a graph and finding strongly connected components for each new income of data.
:)) It can be solved by using disjoint set.And hash table may be useful to help,or you can use binary search instead. |
| J# rulezzz | CF# {Anoshin,Sotov,Khuramshin} | 1013. K-based Numbers. Version 3 | 16 May 2007 22:46 | 1 |
J# rulezzz CF# {Anoshin,Sotov,Khuramshin} 16 May 2007 22:46 Learn J# and no problems on olympiads!
[code deleted]
Edited by moderator 17.05.2007 10:03 |
| Something strange... | Loky_Yuri [USTU] | 1257. Hyphenation | 16 May 2007 21:24 | 4 |
I now that the first test for this problem is the sample (I check it with a stupid programm which output the strings of sample, and this programm has WA#2).
And for this test my REAL program give the corret answer, but when I try to submit it I have ACCESS VIOLATION. I try even do all my arrays [1..1000] and replace string on ansistring (i write in PASCAL), but all my attempts was failed.
Can anybody help me?
PS If you want I can show my program [Code deleted by author]
Edited by author 16.05.2007 21:22 You call CutString(str); with str='' ant it fails
while dl <> length(str) do
begin
dl := length(str);
//if dl=0 then break;
CutString(str); //162 string
end;
Kirill
Edited by author 16.05.2007 20:51 |
| Who can help me? I don't know how to do? It should be right :< | wsoangel | 1002. Phone Numbers | 16 May 2007 13:46 | 1 |
Edited by author 18.04.2008 12:13 |
| Hint | Fyodor Menshikov | 1538. Towers of Guard | 16 May 2007 05:44 | 1 |
Hint Fyodor Menshikov 16 May 2007 05:44 [hint deleted]
Edited by moderator 16.05.2007 09:25 |
| wa test 6 | Nikita | 1295. Crazy Notions | 15 May 2007 22:59 | 1 |
|
| Strange! Crash{access violation} #9 | {AESC USU} Evgeny Kurpilyanskij | 1018. Binary Apple Tree | 15 May 2007 22:03 | 1 |
> Array[0..100]of longint;
Crash {access violation} #9
> Array[0..1000]of longint;
Crash {access violation} #3
Please help me!
|
| is the output of question wrong? | xuguoxin | 1005. Stone Pile | 15 May 2007 11:01 | 3 |
1: 27，8
2: 5，5，13，14
min:(5+5+13+14)-(27+8)=2
not 3!!!
First 5 is the number of stones, not the weight of some stone!!! So (27 + 8) - (5 + 13 + 14) == 3! :)
Edited by author 14.05.2007 16:48 |
| O(2^N) works! | Alexander Kouprin | 1130. Nikifor's Walk | 15 May 2007 00:48 | 1 |
I use recursion (with optimization :)) and got AC 0.015! |
| {C++} Why wrong???? | Edward Sarkisyan RAU | 1084. Goat in the Garden | 14 May 2007 23:32 | 2 |
#include<iostream.h> #include<math.h> int main() { double pi; double l, r,alpha,segm,treug,delta; cin>>l>>r; pi=3; l/=2; if(r<=l/2) cout<<pi*r*r; if(r>(l*sqrt(2))) cout<<l*l*4; else { alpha=2*acos(l/r); segm=pi*r/(2*alpha); treug=l*sqrt(((r*r)-(l*l))); delta=segm-treug; cout<<pi*r*r-4*delta; } return 0; } Sorry pi=3,145
Why when inpus is:
3 1
Output is:
-1.#IND
???
Compiler:
Visual C++ 6.0 |
| What is fuck with test #9??? | I&K | 1126. Magnetic Storms | 14 May 2007 11:44 | 4 |
It is said in problem text that the number of measurings does not exceed 25001. But my program get AC only if I set this number >=25002, else WA#9!!! Check your test please!!! This problem appeared after rejudgement. Sorry for wrong verdict after regudge. N was equal 25002 in 9th test. It was my bug.
Limitations in the problem statement were changed. Now N <=25000 (as in the original version of problem). All tests with N>25000 were fixed, submits were rejudged.
If somebody will find more bugs in this problem, please, write about it.
Edited by author 14.05.2007 00:30 Sandro, you add only one test? In test 9 M=2. My wrong solution works now 0.015 :)))
Edited by author 14.05.2007 04:59 The limitations in the problem statement are weak. Do you have a test that fails your solution with "if m<100"?
By the way you can also replace this line with "if m<1000" :)
Try to solve this problem with limitations N<=10^6, numbers <= 10^9. It will be not so easy to get AC with O(N^2) solution. :)
If you have some good tests you can mail me: sandro sobaka plotinka ru
Edited by author 14.05.2007 11:48 |
