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()

Comments

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; }

URI Online Judge Solution 1151 Easy Fibonacci

URI Online Judge Solution 1151 Easy Fibonacci using C Programming Language. he following sequence of numbers 0 1 1 2 3 5 8 13 21 ... is known as the Fibonacci Sequence. Thereafter, each number after the first 2 is equal to the sum of the previous two numbers. Write an algorithm that reads an integer N (N < 46) and that print the first N numbers of this sequence. Input The input file contains an integer number N (0 < N < 46). Output The numbers ​​should be printed on the same line, separated by a blank space. There is no space after the last number. Thanks to Cássio F. Input Sample Output Sample 5 0 1 1 2 3 Solution using C : #include <stdio.h> int main() {     int n,i,n1,n2,t;     scanf("%d",&n);     for(i=1; i<=n; i++)     {         if(i==1)         {             n1 = 0;             printf("%d",n1);         }         else if(i==2)         {             n2 = 1;             printf("%d",n2);         }

URI Online Judge Solution 1149 Summing Consecutive Integers

URI Online Judge Solution 1149 Summing Consecutive Integers using C Programming Language. Write an algorithm to read a value A and a value N. Print the sum of N numbers from A (inclusive). While N is negative or ZERO, a new N (only N) must be read. All input values are in the same line. Input The input contains only integer values, ​​can be positive or negative. Output The output contains only an integer value. Input Sample Output Sample 3 2 7 3 -1 0 -2 2 7 Solution using C : #include <stdio.h> int main() {     int a,n,s=0;         scanf("%d%d",&a,&n);         while(n<=0)             scanf("%d",&n);         while(n)         {             s += a++;             n--;         }         printf("%d\n",s);     return 0; }