| Show all threads Hide all threads Show all messages Hide all messages |
| HELP FIRST TEST | Yerevan RAU 5 | 2014. Zhenya moves from parents | 18 Nov 2014 12:53 | 3 |
FOR 5 -1000 10.09 21:00 +500 09.09 14:00 +1000 02.09 00:00 -1000 17.09 21:00 +500 18.09 13:00 ANSWER IS -1000 -500 0 -500 -500 OR -1000 -500 0 -500 0 The first one. Jenya never puts earned money into the credit account. why then the 2nd debt is -500 not -1000? date,understand Edited by author 18.11.2014 13:14 |
| WHY WA 4 . | AngDS120 | 1404. Easy to Hack! | 17 Nov 2014 12:24 | 8 |
please help me !!!!!!!! I submissions 14 time this is my code #include<stdio.h> int main() { char str0[100]; int str1[100],str2[100],str3[100]; int i,len=0; gets(str0); for(i=0;str0[i]!='\0';i++,len++) str1[i]=str0[i]-'a';
str2[0]=str1[0]; for(i=1;i<len;i++) { str2[i]=str1[i]; while(str2[i]<str2[i-1]) { str2[i]+=26;
} }
str3[0]=str2[0]-5; for(i=0;i<len;i++) str3[i+1]=str2[i+1]-str2[i];
for(i=0;i<len;i++) printf("%c",(str3[i]%26)+'a');
} Edited by author 28.11.2006 22:06 Edited by author 28.11.2006 22:08 not (a[0] in ['a'..'z'])!! What I wanna tell you is that this problem is really easy to solve. You only need to have a really good thinking. Try to find the changes between each letters or numbers. Then you'll work it out! The problem is that you haven't considered the case where str[0]<'a'+5. In this case when you do str[0]-=5 at the end a value lesser than 'a' may be obtained. Hence at the end if (str[0]-=5)<0 then str[0]+=26. Try this test case once bimdhhycaoinese Answer should be whereareyoufrom you get [hereareyoufrom if you havent taken care of the condition. <<jagatsastry>> A lot of Thanks)) <jagatsastry> Thank you very much for explanation <jagatsastry> Thank you very much for explanation |
| WA 4 | Catalin Cocis | 1580. Dean's Debts | 16 Nov 2014 22:55 | 4 |
WA 4 Catalin Cocis 3 Apr 2010 01:05 What is wrong with test 4? 5 6 5 4 9 4 2 6 5 1 6 1 2 3 5 3 8 3 2 5 Re: WA 4 Nathan Wildenberg 16 Nov 2014 22:55 0.00 3.00 2.00 3.00 6.00 Isn't this the correct answer? :? Nevermind, it is actually undeterminable. Edited by author 16.11.2014 22:56 Edited by author 16.11.2014 23:08 |
| WA 10 | Alexandr | 1787. Turn for MEGA | 16 Nov 2014 20:21 | 1 |
WA 10 Alexandr 16 Nov 2014 20:21 /// What's wrong? var a,b,c,i,s:integer; m:array[1..1000000] of integer; begin s:=0; read(a); read(b); for i:=1 to b do begin read(m[i]); if(m[i]>a) then s:=s+m[i]-a else begin if s>m[i]+a then s:=s-m[i]-a else s:=0; end; end; if s<0 then writeln(0) else writeln(s); end. |
| help me with tests | Georgy Mogafk | 1086. Cryptography | 16 Nov 2014 19:33 | 2 |
I found my error. I was searched all multiples of i<=LIMIT, whereas right i*i<=LIMIT. Now my code not run firsth test..but i am sure that result is correct. Please, give me some input data for test. |
| Дайте тест №2 | ya_diman | 1086. Cryptography | 16 Nov 2014 18:45 | 7 |
Дайте тест №2, ну или все тесты на эту задачу!!! For example: 4 15000 14000 15000 14000 It can be test if you have TLE, try this 15000 15000 15000 ... 15000 (15001 lines) or 15000 1 2 ... 14999 15000 Hint for check: 15000th prime number is 163841 you sure that 15000th prime number is 163841? i think that it 163847 |
| Stupid mistakes | bsu.mmf.team | 2036. Intersect Until You're Sick of It | 16 Nov 2014 16:08 | 1 |
Please don't make so stupid mistakes that I did. Lost about 3 hours on the contest, gratz to me. Anti-WA #51: 4 0 0 2 0 1 1 1 2 Answer: oo Anti-WA #52: 4 0 0 1 2 2 2 3 0 Answer: oo |
| very easy solution on Java | Evgeniy[VVV] | 1083. Factorials!!! | 16 Nov 2014 15:15 | 2 |
it's very simple,especially on java. |
| Hint (simple) | Najmaddin Akhundov | 1209. 1, 10, 100, 1000... | 16 Nov 2014 08:32 | 1 |
The order of 1's within the number is 1 2 4 7 11 16 ...You can find the n'th number in sequence is equal to 1+n*(n-1)/2. So for any given input a, it is sufficient to test whether or not (a-1)*2 is equal to multiplication of two consequence number. I hope it helps |
| WA 4 | mushfiq | 1581. Teamwork | 16 Nov 2014 02:40 | 2 |
WA 4 mushfiq 24 Oct 2014 18:03 What is test case 4? please help yes, give 4 test Edited by author 16.11.2014 02:42 |
| wh | Georgy Mogafk | 1149. Sinus Dances | 15 Nov 2014 23:34 | 1 |
wh Georgy Mogafk 15 Nov 2014 23:34 |
| WA#1, please, help me | Ivan Metelev | 1020. Rope | 15 Nov 2014 16:01 | 1 |
var n,i: integer; x1,x2,y2,y1,xx,yy,e,r: real; begin readln(n,r); readln(x1,y1); yy:=y1; xx:=x1; for i:=2 to n do begin readln(x2,y2); e:=e+sqrt(sqr(x2-x1)+sqr(y2-y1)); x1:=x2; y1:=y2; end; writeln((round((e+2*3.14159*r+sqrt(sqr(xx-x1)+sqr(yy-y1)))*100))/100); end. |
| Memory_Limit | Nodir | 1553. Caves and Tunnels | 14 Nov 2014 22:12 | 1 |
I'm using Heavy light Decomposition an I'm getting ML in test 9 WHY ???? |
| What is test #7? | Alexey Krupnitskiy | 1200. Horns and Hoofs | 14 Nov 2014 17:17 | 1 |
could you give me test #7? I can not understand what is wrong! |
| Please give me output for my input. | {AESC USU} Dembel | 1338. Automobiles | 14 Nov 2014 17:08 | 2 |
I have Wa#4. Please help me! #input 5 5 ooooo ooooo ooooo ooooo ooooo 2 1 13 #output ??? 5 5 ooooo ooooo ooooo ooooo ooooo 2 1 13 ans: Experiment #1: North: 4, South: 0, East: 20, West: 0 Experiment #2: North: 2, South: 2, East: 10, West: 10 |
| No subject | Valentin | 1960. Palindromes and Super Abilities | 14 Nov 2014 17:08 | 1 |
Edited by author 20.11.2014 20:26 |
| WA 3 | Frog | 1446. Sorting Hat | 14 Nov 2014 14:21 | 2 |
WA 3 Frog 14 Nov 2014 14:11 I use fgets to read from stdin, when I try to store name in an array with length 201, i got WA 3,but when I changed the length to 210, I got AC, who can tell me why? i got it: if the name has exactly 200 symbols, the name and the newline will be read into two strings. |
| Memory exceeded | Ankita | 1001. Reverse Root | 13 Nov 2014 22:29 | 1 |
Hi, This is my code: #include <iostream> #include <vector> #include <cmath> #include <iomanip> using namespace std; int main() { vector<int> V; V.resize(0); int n; cin >> n; while( n != EOF) { V.resize(V.size() + 1); V.push_back(n); cin >> n; } cout << setprecision(4) << fixed ; while(V.size() > 0) { n = V.back(); V.pop_back(); cout << sqrt(n) << endl; } return 0; } Could someone please tell me why the memory got exceeded here ? The stream is just 256 KB, right ? Regards, Ankita |
| if you have WA1 | nightwolf212 | 1002. Phone Numbers | 13 Nov 2014 18:27 | 1 |
|
| збс | Birne Ageev | 2030. Awesome Backup System | 12 Nov 2014 20:05 | 5 |
збс Birne Ageev 25 Oct 2014 13:27 Re: збс Vedernikoff 'Goryinyich' Sergey (HSE: АОП) 26 Oct 2014 00:48 Re: збс Birne Ageev 26 Oct 2014 10:11 В пршлм гд бл прфсср "Е.Бен", в этм "ЗБС". Нцнзрн брнь. Re: збс Vedernikoff 'Goryinyich' Sergey (HSE: АОП) 26 Oct 2014 14:08 нжн длг крть, чтб т рскрть - вбщ н дгдлс... Edited by author 26.10.2014 14:08 Re: збс Oxxxymiron 12 Nov 2014 20:05 збс же придумал автор?! ЗБС!) |