Search found 3 matches
Search found 3 matches • Page 1 of 1
"Rewriting rules rewrite a letter at a position i, depending on letters at the positions i - 2, i, i+1. We rewrite all letters of the word in one step. When we have a given starting word and a set of rewriting rules a natural question is: how does the word look after s rewriting steps? " i've unders...
- Tue Jun 06, 2006 12:25 pm
- Forum: Volume 4 (400-499)
- Topic: 481 - What Goes Up
- Replies: 82
- Views: 14647
i think that problem 481 could be done using a "one-pass" algorithm. so you can read the numbers in input one-by-one without put them into an array! 8) take a look at this http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TR-931.pdf ... i've implemented the algorithm described in this article but...