Skip to main content

URI Problem 2690 Solution New Password RA - URI Online Judge Solution

URI Online Judge Solution 2690 New Password RA Using Python Programming Language. 
A new set of authentication will be implemented at the Federal Institute of South of Minas, Muzambinho campus, so users will not have much difficulty, plus you ... Well, the new authentication service is safe, without bugs and headaches even though we are at the end of the semester. It will allow your password to have spaces, but not numbers or special characters. The update always occurs during the vacation period, so tpdps adjustments are made and in the end please all users. As a trainee at the school's support center, your duty is to implement the new authentication. For now the new standard for user names is being studied. 
As we can see for each set of letters we will have a specific number. Make a bad program to do this conversion of the letters to the numbers, and since you will not access the passwords of the students, make an algorithm so that the same one does the process alone using its own test cases. 
Note: Your test cases can not exceed 20 character and the output, 12 digits. 
Input 
You will have N indicating the number of passwords that will be exchanged, then N test cases. 
Output 
The output will be a list with the new, encrypted numbers of the passwords that were typed.
Input SampleOutput Sample

3
o rato roeu a roupa de margarida
O Rato Roeu A Roupa de Margarida
OlA TuDo CeRtO

470947440074

290949440694

216405474992

URI 2690 Solution in Python:


N = int(input())
S = ""
for i in range(N):
    S = input()
    P = 0
    for i in range(0, len(S)):
        if P == 12:
            break
        elif S[i] in ['a', 'k', 'u', 'G', 'Q']:
            print(0, end='')
            P += 1
        elif S[i] in ['b', 'l', 'v', 'I', 'S']:
            print(1, end='')
            P += 1
        elif S[i] in ['c', 'm', 'w', 'E', 'O', 'Y']:
            print(2, end='')
            P += 1
        elif S[i] in ['d', 'n', 'x', 'F', 'P', 'Z']:
            print(3, end='')
            P += 1
        elif S[i] in ['e', 'o', 'y', 'J', 'T']:
            print(4, end='')
            P += 1
        elif S[i] in ['f', 'p', 'z', 'D', 'N', 'X']:
            print(5, end='')
            P += 1
        elif S[i] in ['g', 'q', 'A', 'K', 'U']:
            print(6, end='')
            P += 1
        elif S[i] in ['h', 'r', 'C', 'M', 'W']:
            print(7, end='')
            P += 1
        elif S[i] in ['i', 's', 'B', 'L', 'V']:
            print(8, end='')
            P += 1
        elif S[i] in ['j', 't', 'H', 'R']:
            print(9, end='')
            P += 1
    print()
Labels:

Comments

Post a Comment

Popular posts from this blog

URI Problem 1001 Solution Extremely Basic - - URI Online Judge Solution

URI Online Judge Problem 1001 Extremely Basic Solution using C, Python Programming Language. Read 2 variables, named  A  and  B  and make the sum of these two variables, assigning its result to the variable  X . Print  X  as shown below. Print endline after the result otherwise you will get “ Presentation Error ”. Input The input file will contain 2 integer numbers. Output Print the letter  X  (uppercase) with a blank space before and after the equal signal followed by the value of X, according to the following example. Obs.: don't forget the endline after all. Samples Input Samples Output 10 9 X = 19 -10 4 X = -6 15 -7 X = 8 URI 1001 Solution in Python A = int(input()) B = int(input()) X = A + B print("X =",X); URI 1001 Solution in C: #include int main() { int A,B,X; scanf ("%d %d", &A, &B); X=A+B; printf("X = %d\n",X); return 0; }
Post a Comment
Read more

URI Problem 1179 Solution Array Fill IV - URI Online Judge Solution

URI Online Judge Solution 1179 Array Fill IV  Using C, Python Programming Language. In this problem you need to read 15 numbers and must put them into two different arrays: par if the number is even or impar if this number is odd. But  the size of each of the two arrrays is only 5 positions. So every time you fill one of two arrays, you must print the entire array to be able to use it again for the next numbers that are read. At the end, all remaining numbers of each one of these two arrays must be printed beginning with the odd array. Each array can be filled how many times are necessary. Input The input contains 15 integer numbers. Output Print the output like the following example. Input Sample Output Sample 1 3 4 -4 2 3 8 2 5 -7 54 76 789 23 98 par[0] = 4 par[1] = -4 par[2] = 2 par[3] = 8 par[4] = 2 impar[0] = 1 impar[1] = 3 impar[2] = 3 impar[3] = 5 impar[4] = -7 impar[0] = 789 impar[1] = 23 par[0] = 54 par[1] = 76 par[2] = 98 Solution Using C: #include <stdi...
Post a Comment
Read more

URI Online Judge Solution 1069 Diamonds and Sand

URI Online Judge Solution 1069  Diamonds and Sand using Python Programming Language. John is working in a diamond mine, trying to extract the highest number of diamond "<>". He must exclude all sand particles found "." in this process and after a diamond can be extracted, new diamonds can be formed. If he has as an input. <... << .. >> ....> .... >>>. three diamonds are formed. The first is taken from <..> resulting. <... <> ....> .... >>>. The second diamond is then removed, leaving. <.......> .... >>>. The third diamond is then removed, leaving at the end ..... >>>. without the possibility of extracting new diamonds. Input Read an integer N that is the number of test cases. Then follows N lines each up to 1000 characters, including "<" ,">" and "." Output You must print the amount of diamonds that can be extrated in each test ca...
Post a Comment
Read more