| ENG RUS | Timus Online Judge |
Common BoardDixonD (Lviv NU) Read this lessons [4] // Problem 1465. Pawn Game 22 Jul 2007 22:59 This is a simple problem if read some theory of games such this: http://sps.nus.edu.sg/~limchuwe/cgt/ It helps me very much:) huakaile Re: Read this lessons // Problem 1465. Pawn Game 30 Jul 2008 16:56 Wonderful!!~~~ bsu.mmf.team Re: Read this lessons [2] // Problem 1465. Pawn Game 8 Mar 2009 23:50 Thank you very much! Finally I got AC. I've calculating the nim-sequence for this game about 3 hours)))) Sergey Lazarev (MSU Tashkent) Re: Read this lessons [1] // Problem 1465. Pawn Game 2 Sep 2009 00:23 Thank you! Very useful articles. mwh Re: Read this lessons // Problem 1465. Pawn Game 11 Dec 2011 13:04 thank you sincerely!!!!!!!!!!!!!!!!! wonderful artical!!!!!!!!!!!!!! great ideas!!!!!!!!!!!!!!!!!!!!!!1 Edited by author 13.12.2011 17:50 ahyangyi(newer id) Why this problem is classified as Data Structure? [2] // Problem 1628. White Streaks 12 Nov 2010 05:26 I feel this is somewhat misleading as Data Structure isn't necessary for this problem. SkorKNURE Re: Why this problem is classified as Data Structure? // Problem 1628. White Streaks 29 Jan 2011 19:33 Agree. Solves with sort only. luckysundog Re: Why this problem is classified as Data Structure? // Problem 1628. White Streaks 11 Dec 2011 10:44 Sorting is good, yes. But it can be solved with data stuctures too. I used map<int,set<int> > and it gave slow AC (0.75 sec). Figznaetlto Why WA? // Problem 1820. Ural Steaks 11 Dec 2011 05:24 Edited by author 11.12.2011 07:01 Edited by author 11.12.2011 07:02 Childofbodom tests [1] // Problem 1433. Diamonds 23 Jul 2009 03:51 please,somebody! take me tests!!! wa on 1st test :/ but work on all my tests Fatemeh Re: tests // Problem 1433. Diamonds 10 Dec 2011 20:13 GRBY YGBR equal BBGY GYBB equal YGBR GBRY different BYRG GYRB different Sunnat What's this mean... // Problem 1353. Milliard Vasya's Function 10 Dec 2011 19:19 mem[1][9] <=> 1=>>10 mem[20][9] <=> 20=>>299 or 29 ? mahbubul will any body help me? I am OLE [1] // Problem 1164. Fillword 12 Jul 2003 23:23 I am Output Limit Exceed. my source is in C++. Here this is: #include<iostream.h> #include<string.h> main() { int len,temp,i; int n,m,j,p; char ch[12][12],word[15]; char letter; long int array[30]; for(i=0;i<27;i++) array[i]=0; cin>>n>>m>>p; for(i=1;i<=n;i++) cin>>ch[i]; for(i=1;i<=p;i++){ cin>>word; len=strlen(word); for(int k=0;k<len;k++){ temp=word[k]; array[temp-64]--; }} for(i=1;i<=n;i++) for(j=0;j<m;j++){ temp=ch[i][j]; array[temp-64]++; } for(i=1;i<27;i++){ temp=array[i]; letter=i+64; while(temp!=0){ cout<<letter; temp--; }} cout<<endl; return 0; } George_Aloyan[PTS Obninsk] Re: will any body help me? I am OLE // Problem 1164. Fillword 10 Dec 2011 12:05 make temp!=0 - temp > 0; and some other changes, but it gets WA11 Edited by author 10.12.2011 12:10 DR. Zhihua Lai To Admin: I got "Fail (compiler)" 10 Dec 2011 05:22 Hi Admin, I got "Fail (compiler)" message if I use "goto" statement in Pascal... but it compiles fine on my machine.. Why? can I not use "goto" ? Thanks... 59838AD what is the algorithm :? [5] // Problem 1656. Far Away Kingdom's Army 18 Nov 2008 21:43 Artem Litvinenko SSU Re: what is the algorithm :? [1] // Problem 1656. Far Away Kingdom's Army 19 Nov 2008 01:11 the algorithm consist of transposition the most high soldier to the centre of the line and to the centre of the column. in cycle from 1 to n gives bubble sorting. melkiy Re: what is the algorithm :? // Problem 1656. Far Away Kingdom's Army 11 Mar 2009 07:05 Please can you explain how to do bubble sort in 2-d array here? melkiy algorithm [2] // Problem 1656. Far Away Kingdom's Army 11 Mar 2009 07:14 I constructed such an algorithm. It requires the soldiers to be sorted by their height downwards. When the soldiers are sorted, take them one by one and fill the square diamond by diamond, starting from center. A "diamond" contains those cells (x,y) for which |x - x_center| + |y - y_center| == C, C ranges [0; n-1]. Edited by author 11.03.2009 08:54 Michail Yudin Re: algorithm // Problem 1656. Far Away Kingdom's Army 11 Apr 2009 19:42 it's no solution Daniel Mahu Re: algorithm // Problem 1656. Far Away Kingdom's Army 10 Dec 2011 04:47 There is a much simpler method, which also uses less memory. Hint: try a O(n) sort. Also try not to store n*n elements in memory (print line by line instead). shahmohammadi what is perfix [1] // Problem 1842. Local Roots 10 Dec 2011 01:50 if in a case p is abcde, is ab a prefix of p? or ab is prifix of cde? in other word is prefix and suffix of a word a part of that or placed in out of it? thank you. shahmohammadi Re: what is perfix // Problem 1842. Local Roots 10 Dec 2011 02:40 thanks. now i know what problem want. and i know when we say A is Prefix/suffix of B,=> B includes A. Nigora No subject // Problem 1385. Interesting Number 9 Dec 2011 22:12 Toshev Qulmurod No subject // Problem 1069. Prufer Code 9 Dec 2011 21:15 davlatov jaloliddin 1334 // Problem 1506. Columns of Numbers 9 Dec 2011 19:53 Daniel Mahu test #4 out of bounds? [1] // Problem 1052. Rabbit Hunt 9 Dec 2011 04:04 In my solution I read values like this: scanf("%d %d", &px[i], &py[i]); px[i] += 1000; py[i] += 1000; board[px[i]][py[i]] = 1; and get access violation on test #4; however, if I add right before accessing the array: if (px[i] < 0 || py [i] < 0 || px[i] > 2000 || py[i] > 2000) { while (1); } I get TLE on the same test. Are all the values of test #4 within the bounds -1000 <= x,y <= 1000 ?! Sandro (USU) Re: test #4 out of bounds? // Problem 1052. Rabbit Hunt 9 Dec 2011 14:12 Statement is fixed. Now -2000 <= x,y <= 2000 (as it was actually in tests). Thank you. Zefick It is possible to write the output to one line. // Problem 1319. Hotel 9 Dec 2011 11:24 coolface.jpg Valdemar Thanks // Problem 1348. Goat in the Garden 2 9 Dec 2011 00:59 Very nice problem!!! I solve it with vector. Min calculated just d*sin(acos(alpha)) :) anhpnt I got crash in test #23 [3] // Problem 1297. Palindrome 21 Sep 2009 23:09 Is there something special in test #23? I got crash (access violation). Tranvick Re: I got crash in test #23 // Problem 1297. Palindrome 5 Dec 2011 15:07 I have WA in this test. It's my code: #include <iostream> #include <string> #include <algorithm> #define N 1111 using namespace std; string s; int n,d1[N],d2[N],k; int main(){ getline(cin,s); n=s.length(); for (int i=0;i<n;i++){ for (k=1;i-k>=0 && i+k<n;k++) if (s[i-k]!=s[i+k]) break; d1[i]=max(k-1,-1); } for (int i=1;i<n;i++){ if (s[i]!=s[i-1]){ d2[i]=-1; continue; } for (k=1;i-k-1>=0 && i+k<n;k++) if (s[i-k-1]!=s[i+k]) break; d2[i]=max(k-1,0); } int *k1=max_element(d1,d1+n),*k2=max_element(d2+1,d2+n); if (*k1>=*k2+1) for (int i=k1-d1-*k1;i<=k1-d1+*k1;i++) cout<<s[i]; else for (int i=k2-d2-*k2-1;i<=k2-d2+*k2;i++) cout<<s[i]; return 0; } Can I get this test? zhqc Re: I got crash in test #23 [1] // Problem 1297. Palindrome 7 Dec 2011 17:30 a you must output a Tranvick Re: I got crash in test #23 // Problem 1297. Palindrome 8 Dec 2011 20:16 Locally my program prints a. But have AC only if I add if (n==1){ cout<<s<<endl; return 0; } I found my mistake, but I don't know, why there are different answers on my computer and here. aprhz sth must be wrong with test data // Problem 1820. Ural Steaks 8 Dec 2011 12:06 Eazy jobb I get WA11 before . Now I AC . Here is some hint // Problem 1416. Confidential 8 Dec 2011 11:48 Helpful test data: 6 6 1 2 8 2 3 3 3 5 2 2 4 7 4 6 2 2 5 6 Ans: Cost: 22 Cost: 25 Edited by moderator 12.11.2023 21:26 Ahmad converting from string to int [1] // Problem 1877. Bicycle Codes 8 Dec 2011 04:32 hi I am facing problem in converting. I try this: string lock1; int x; cin>>lock1; x= atoi(lock1.c_str()); it works but when I submit it it gives me compilation error, so any ideas or other way to convert from string to integer??? thank you. Ahmad Re: converting from string to int // Problem 1877. Bicycle Codes 8 Dec 2011 05:02 no thing wrong with my code the only thing missing that I did not include<cstring> and <string> and it's works now :) Lebedev Can you give me answer for one test? [2] // Problem 1643. Attack of the Dark Fortress 7 Dec 2011 19:47 Which answer for test 2 2 #$ !* Who have AC program, please help. morbidel Re: Can you give me answer for one test? [1] // Problem 1643. Attack of the Dark Fortress 7 Dec 2011 21:18 Well, what is your answer? By reading the text, I understand that the armies cannot attack the fortress alone. So I think the answer should be 2 (one for joining the armies, one for attacking the fortress). bsu.mmf.team Re: Can you give me answer for one test? // Problem 1643. Attack of the Dark Fortress 8 Dec 2011 02:50 Of course, the answer is 2. First step for meeting the armies and the second one for attack.
|