uva online judge self describing sequence problem solution python | uva 10049

The self describing sequence problem  (uva 10049) is also very straight forward and easy programming challenge in competitive programming once understood well. Which can be stated as (from online judge) Solomon Golomb’s self–describing sequence ⟨f(1),f(2),f(3),...⟩ is the only nondecreasing sequence of positive integers with the property that it contains exactly f(k) occurrences of k for each k. A few moments thought reveals that the sequence must begin as follows: n 1 2 3 4 5 6 7 8 9 10 11   12 f(n) 1 2 2 3 3 4 4 4 5 5 5 6 In this problem you are expected to write a program that calculates the value of f(n) given the value of n. Sample Input 100  9999  123456  1000000000  0 Sample Output 21  356  1684  438744 Programming Explanation This is very simple problem states that for given range of n as input (as shown in above image), we have
1 comment

Contact Us

Contact us

Comments

Post a Comment

Popular posts from this blog

uva online judge vito's family problem solution python | uva 10041

The vito's family problem (uva 10041) is a sorting problem in programming challenges from competitive programming. Which can be stated as (from online judge) The world-known gangster Vito Deadstone is moving to New York. He has a very big family there, all of them living in Lamafia Avenue. Since he will visit all his relatives very often, he is trying to find a house close to them. Vito wants to minimize the total distance to all of them and has blackmailed you to write a program that solves his problem. The distance between two street numbers si and sj is dij = |si −sj|. Sample Input 2 2 2 4 3 2 4 6 Sample Output 2 4 Explanation Given random sequence of vito's relatives as input [number of relatives] [relatives distances] (relative name = distance of relative from vito's room) we have to sort out and find the best way to visit all relatives in minimum time. We can do it in two ways: 1) find absolute difference between each relati
Read more

uva online judge australian voting problem solution python | uva 10142

The australian voting problem is little tricky but very easy problem, which can be stated as, Australian ballots require that the voter rank the candidates in order of choice. Initially only the first choices are counted and if one candidate receives more than 50% of the vote, that candidate is elected. If no candidate receives more than 50%, all candidates tied for the lowest number of votes are eliminated. Ballots ranking these candidates first are recounted in favour of their highest ranked candidate who has not been eliminated.  This process continues [that is, the lowest candidate is eliminated and each ballot is counted in favour of its ranked non-eliminated candidate] until one candidate receives more than 50% of the vote or until all candidates are tied. Sample Input 1 3  John Doe  Jane Smith  Sirhan Sirhan  1 2 3  2 1 3  2 3 1  1 2 3  3 1 2 Sample Output John Doe Explanation In australian voting, each voter has to vote all candidates, but
Read more

uva online judge common permutation problem solution python | uva 10252

The common permutation problem (uva 10252) is a simple and words puzzle programming challenge from competitive programming. Which can be stated as (from online judge) Given two strings of lowercase letters, a and b, print the longest string x of lowercase letters such that there is a permutation of x that is a subsequence of a and there is a permutation of x that is a subsequence of b. In this problem, we just have to find matching words in given two strings. After finding, just print them in alphabetical order, thats it. Sample Input pretty  women  walking  down  the  street Sample Output e  nw  et Explanation We just have to compare two strings and find out common characters, using old school method. Print them in alphabetical order. Code Final_answer = [] while(True):     count = 0     temp = []     str1 = str()     a = list(input())     try:         a[0]     except:         break     b = lis
Read more