| ENG RUS | Timus Online Judge |
Discussion of Problem 1685. Orthography[RISE] Levon Oganesyan [RAU] Easy ~ [5] // Problem 1685. Orthography 3 Aug 2014 05:07 My solution is 20 lines. Easy problem. david[SESC UrFU] Re: Easy ~ [1] // Problem 1685. Orthography 31 Aug 2014 13:01 14 lines solution with using recursive function. [RISE] Levon Oganesyan [RAU] Re: Easy ~ // Problem 1685. Orthography 31 Aug 2014 21:03 I have recursive function too. Whatever, Good Job! KostyaRychkov Re: Easy ~ [2] // Problem 1685. Orthography 28 Oct 2019 22:09 7 lines with recursive func in python 3. Or 14 with normal look a code. Dmitry10005`~ Re: Easy ~ [1] // Problem 1685. Orthography 29 Oct 2019 01:27 5 lines M M[Δ] Re: Easy ~ // Problem 1685. Orthography 13 Mar 2023 21:23 I got by 2 lines But It possible by 1 using https://overcoder.net/q/87149/может-ли-лямбда-функция-вызывать-себя-рекурсивно-в-python (rus forum) Raman Gupta please check my code WA 3 [3] // Problem 1685. Orthography 3 Dec 2012 12:42 #pragma comment(linker, "/STACK:16777216") #include <stdio.h> #include <string.h> #define size 20010 char str[size]; char arr[size]; int i=0; void recurse(int low,int high){ int mid; if(low>high) return; mid = (low+high)/2; arr[mid] = str[i++]; recurse(low,mid-1); recurse(mid+1,high); } int main(){ scanf(" %[^\n]s",str); recurse(0,strlen(str)-1); printf("%s\n",arr); return 0; } /*I simply used recursion and its working for all the test I know presently.Please tell me what is the problem in the code*/ staticor Re: please check my code WA 3 // Problem 1685. Orthography 18 Jul 2013 12:26 input output Xel Re: please check my code WA 3 [1] // Problem 1685. Orthography 28 May 2014 19:25 the same def solve(str): l = len(str) if l<=2: return str mid = (1+l)//2 return solve(str[1:mid]) + str[0] + solve(str[mid:]) print solve(sys.stdin.readline().strip()) it's working for all the test I know, but get WA3 here ura Re: please check my code WA 3 // Problem 1685. Orthography 3 Feb 2019 13:55 Xel,отличное решение! Только вместо функции strip() нужна функция strip('\n'), иначе удаляются все концевые пробелы и этим самым нарушаются входные данные. Edited by author 03.02.2019 13:56 Dhruv Somani My solution in Python 3 took 0.078 seconds and 516 KB with recursion. Can you do it faster? [1] // Problem 1685. Orthography 25 May 2016 16:12 My solution in Python 3 took 0.078 seconds and 516 KB with recursion. Can you do it faster? imaginary friend Re: My solution in Python 3 took 0.078 seconds and 516 KB with recursion. Can you do it faster? // Problem 1685. Orthography 18 Aug 2018 18:46 you can try to to it with stack instead of recursion Felix_Mate Какой формат вывода? [1] // Problem 1685. Orthography 7 May 2016 21:20 Не понимаю фразу:"Строка должна оканчиваться символом перевода строки." Что это интересно за символ в паскале? Мой код: const Nmax=21000; var a,s:array[1..Nmax] of char; N,i,L,R:longint; ch:char; procedure Solve(L,R,i:longint); var m:longint; begin if(R-L>1) then begin m:=(L+R) div 2; a[m]:=s[i]; Solve(L,m-1,i+1); Solve(m+1,R,m-L+i+1); end else begin a[l]:=s[i]; if(R>L) then a[R]:=s[i+1]; end; end; begin N:=0; while not eof do begin read(ch); inc(N); s[n]:=ch; end; L:=1; R:=N; Solve(L,R,1); for i:=1 to N-1 do write(a[i]); writeln(a[n]); end. Combatcook Re: Какой формат вывода? // Problem 1685. Orthography 10 May 2016 23:17 Возможно, нужно вывести все символы в строке с помощью команды write, а затем просто добавить строку writeln. Nguyen Trung Hieu Test 15 is a space or multispace!! Be careful!! // Problem 1685. Orthography 20 Jan 2014 10:26 Test 15 is a space or multispace!! Be careful!! Pegasus How this : "orthography, we get gtorhoprahy",I can't understand // Problem 1685. Orthography 15 Nov 2012 19:53 _-Re@l-_ Correct answer for test [1] // Problem 1685. Orthography 8 Mar 2012 19:36 Test : abcdefgh Answer : dbacfeg Is this answer correct? Aneto Re: Correct answer for test // Problem 1685. Orthography 5 Jul 2012 15:09 no, correct answer is "cbdafegh" Vitaliy Karelin WA#8 [2] // Problem 1685. Orthography 28 Feb 2009 17:21 Does anybody has any idea? YSYMYTH Re: WA#8 [1] // Problem 1685. Orthography 21 Jun 2012 19:51 Me too and I dont think I'm wrong Neofit Re: WA#8 // Problem 1685. Orthography 22 Jun 2012 19:20 Send your email. I help you. _-Re@l-_ Correct answer for test [2] // Problem 1685. Orthography 8 Mar 2012 19:36 Test : abcdefgh Answer : dbacfeg Is this answer correct? Jane Re: Correct answer for test [1] // Problem 1685. Orthography 1 May 2012 15:15 нет! как минимум, в первом слове букв больше :D Edited by author 01.05.2012 15:15 Edited by author 01.05.2012 15:15 _-Re@l-_ Re: Correct answer for test // Problem 1685. Orthography 1 May 2012 15:53 Oh, of course :D I want to say, is answer dbacfegh is correct. But now I already know, that my old algorithm hadn't been correct and here is just recursion. silveracm3 What is answer to "один глаз, один рог, но не носорог"? [2] // Problem 1685. Orthography 8 Sep 2009 11:31 What is "г рковоаззи- аул лаывгвдяыеат"? I have no desire to suffer with Russian letters in the console. Snetkov_Mishka Re: What is answer to "один глаз, один рог, но не носорог"? // Problem 1685. Orthography 17 Sep 2009 13:27 Answer: "корова из-за угла выглядывает". Translated by Google: "cow from behind a corner peeps". Sorry for my bad English :) IgorKoval(from Pskov) Re: What is answer to "один глаз, один рог, но не носорог"? // Problem 1685. Orthography 7 Oct 2011 19:29 #include <iostream> #include <string> #include <windows.h> using namespace std; string s; string f( long b, long e ){ //lalalalalala } int main(){ #ifndef ONLINE_JUDGE freopen("input.txt", "rt", stdin); freopen("output.txt", "wt", stdout); #endif SetConsoleCP(1251); SetConsoleOutputCP(1251); s = "г рковоаззи- аул лаывгвдяыеат"; cout << f( 0, s.size()-1 ) << endl; return 0; } aaa why? [5] // Problem 1685. Orthography 28 Feb 2009 17:40 where i am wrong please write me aramvmv@mail.ru #include <iostream> using namespace std; __int64 i,n,k, o[20110]={0},l=0, s,t,j,m,r; char a[20110], c[20110]; int main() { cin.ignore(); cin.getline(a,20110); n=strlen(a); k=n; t=1; while(k!=0) {c[(k+1)/2]=a[t]; o[(k+1)/2]=1; k=(k+1)/2; t++; } for(j=0;j<n/4;j++) { for(i=1;i<=n;i++) if(o[i]==0) {l=1; m=s=i; while(o[i+l]==0) {l++; m+=i+l;} if(l==0) break; if(l==1) {c[s]=a[t]; o[s]=1;} else {k=m/l; while(k>=s) {c[k]=a[t]; o[(k+1)/2]=1; l/=2;m=0; for(r=s;r<s+l;r++)m+=r; k=m/l; t++; }}}} for(i=1;i<=n;i++) cout<<c[i]; return 0;} riVers Re: why? // Problem 1685. Orthography 7 Mar 2009 12:49 time limit? aaa Re: why? [3] // Problem 1685. Orthography 8 Mar 2009 15:24 no crash aaa Re: why? [2] // Problem 1685. Orthography 8 Mar 2009 15:27 here is my new solution but again crash #include <iostream> using namespace std; __int64 i,n,k, o[20110]={0},l=0, s,t,j,m,r; char a[20110], c[20110]; int main() { cin.ignore(); cin.getline(a,20110); n=strlen(a); k=n; t=1; while(k!=0) {c[(k+1)/2]=a[t]; o[(k+1)/2]=1; k=(k+1)/2; t++; } for(j=0;j<n/4;j++) { for(i=1;i<=n;i++) if(o[i]==0) {l=1; s=i; while(o[i+l]==0) {l++; } if(l==0) break; if(l==1) {c[s]=a[t]; o[s]=1;} else {k=s+l; while(k>=s) {c[(k+s)/2]=a[t]; o[(k+s)/2]=1; k=(k+s)/2; t++; }}l=0; }} for(i=1;i<=n;i++) cout<<c[i]; return 0;} Oleg Strekalovsky [Vologda SPU] Re: why? [1] // Problem 1685. Orthography 18 May 2009 18:55 I solved this problem by Java with recursive function. I think it's more easy :) edya Re: why? // Problem 1685. Orthography 23 Aug 2011 15:06 recursive function is the best method for solving this problem, i thenk =D Vasily Slesarev WA1, please give test [1] // Problem 1685. Orthography 29 Jun 2011 18:22 My program passes tests "kyaVs alisse uop." and "gtorhoprahy" but get WA1. Please help. Vasily Slesarev Re: WA1, please give test // Problem 1685. Orthography 5 Jul 2011 01:11 Now AC. The problew was that I used getchar() instead of gets(). sklyack To all who got wa17 // Problem 1685. Orthography 5 Feb 2011 00:49 With array of 20001 chars (with '\0') I got wa17, but of 20002 I got AC. So the input string can contain 20001 chars, can't it? And in the statement has been said "The text is no longer than 20000"... hhh No subject [3] // Problem 1685. Orthography 28 Feb 2009 17:19 please smb send me the solution or the idea my mail is vgvavlad@gmail.com Soporboy ! Re: No subject [2] // Problem 1685. Orthography 23 Sep 2010 18:29 [code deleted] Edited by moderator 19.11.2019 23:23 Proba Re: No subject [1] // Problem 1685. Orthography 23 Sep 2010 20:54 Thank you very much for this algoritm! Ozod Yusupov Re: No subject // Problem 1685. Orthography 23 Sep 2010 20:57 This is exellent program! Ivan Need data.. plz (wa1) // Problem 1685. Orthography 12 Mar 2010 22:00 Mods, send input data for test1 please. Trying to solve the problem second day already. Thx vanvector@mail.ru aSSault Be careful on different OS // Problem 1685. Orthography 6 Oct 2009 16:09 If using Java BufferedReader pay attention on number of symbols read. While testing in eclipse I used N-1. But on Timus server N-2 was accepted Edited by author 06.10.2009 16:13 Anupam Ghosh,Bengal Engg and Sc Uni,MtechIT,2006-09,India what to do with punctuation marks? // Problem 1685. Orthography 10 Aug 2009 12:01 orthography gives gtorhoprahy but “one eye, one horn, but not a rhino” gives “reo ac wpeosr tu fdbmo heinoa cnrer” where are the comma's gone??? somebody please help me understand the problem Edited by author 10.08.2009 12:02 Edited by author 10.08.2009 12:02 Edited by author 10.08.2009 12:02 Ivan Zdomskyy_IvanoFrankivsk_SU Crash #8 [2] // Problem 1685. Orthography 3 Mar 2009 14:08 Why Crash (stack overflow)#8 ???? Help,please =) melkiy Re: Crash #8 [1] // Problem 1685. Orthography 3 Mar 2009 17:32 Use directive somelike #pragma comment(linker, "/STACK:16777216") This is described in the FAQ to this site. Ivan Zdomskyy_IvanoFrankivsk_SU Re: Crash #8 // Problem 1685. Orthography 4 Mar 2009 20:55 Thank you. I got AC. gio_gio Input of the Test #15 is just one character! // Problem 1685. Orthography 1 Mar 2009 17:17 Take care of it.
|