ASCII Based Encryption

PKJ

 Coding Problem Keys 

 ASCII Based Encryption 

 Problem Statement 

The program must accept a string S as the input. The program must encrypt the string S based on the following encryption technique.
    - Replace each vowel is S by the unit digit of its ASCII value.
    - Replace each consonant is S by the tenth digit of its ASCII value.
    - Replace each non-alphabet is S by the sum of digits in its ASCII value.
Then the program must print the encrypted string as the output.

 Input Format 

The first line contains S.

 Output Format 

The first line contains the encrypted string.

 Boundary Condition(s) 

1 <= Length of S < 100

 Example Input/Output 1 

 Input 

India#2020

 Output 

310578512512

 Explanation 

I is a vowel. So the unit digit of its ASCII (73) is printed as the output.
n is a consonant. So the tenth digit of its ASCII (110) is printed as the output.
d is a consonant. So the tenth digit of its ASCII (100) is printed as the output.
i is a vowel. So the unit digit of its ASCII (105) is printed as the output.
a is a vowel. So the unit digit of its ASCII (97) is printed as the output.
# is a non-alphabet. So the sum of digits in its ASCII (35) is printed as the output.
2 is a non-alphabet. So the sum of digits in its ASCII (50) is printed as the output.
0 is a non-alphabet. So the sum of digits in its ASCII (48) is printed as the output.
2 is a non-alphabet. So the sum of digits in its ASCII (50) is printed as the output.
0 is a non-alphabet. So the sum of digits in its ASCII (48) is printed as the output.

 Example Input/Output 2 

 Input 

PKJCoders@123

 Output 

877610111101356

 Max Execution Time Limit: 500 millisecs 

 Solution 

 Programming Language: Python 3 Language 

def sumOfDigits(n):
    s=0
    while(n>0):
       s+=n%10
       n//=10
    return s
l=input().strip()
vowel="aeiouAEIOU"
for i in l:
    if(i.isalpha()):
        if i in vowel: print(ord(i)%10,end="")
        else: print(ord(i)//10%10,end="")
    elif(i.isnumeric()):
        print(sumOfDigits(int(i)+48),end="")
    else:
        print(sumOfDigits(ord(i)),end="")

# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Maximum Sub Square Sum

PKJ
 Coding Problem Keys   Maximum Sub Square Sum   Problem Statement  Given a square matrix of size N x N where each cell is filled with a number between -9 and 9. A sub square of size k is any set of k contiguous columns and k contiguous rows. For any sub square, the sum of elements in its cells is called a sub square sum. Given the N x N square, write a program to find the maximum sub square sum. Note that a 1 x 1 square (k = 1) is not considered a sub square.  Boundary Condition(s)  2 <= N <= 1000  Input Format  The first line contains the value of N. The next N lines contain N integers each separated by space(s).  Output Format  The first line contains the maximum sub square sum.  Example Input/Output 1   Input  4 2 -8 4 -6 7 1 -5 3 -9 7 6 5 8 3 2 -4   Output  20   Explanation  The 2 by 2 square sums are 2 -8 -4 6 9 9 9 18 9 The 3 by 3 square sums are 5 7 20 18 And the 4 by 4 squar...
Click to Continue...

Search String S2 in S1 Character Matrix

PKJ
 Coding Problem Keys   Search String S2 in S1 Character Matrix   Problem Statement  Given two strings S1 and S2, form a R*C matrix with the string S1 (You may repeat the string S1 to fill in the rest of the matrix, if length of S1 is less than R*C). Then search for the string S2 along rows from left to right or along columns from top to bottom) and print the number of occurrence of S2.  Input Format  The first line contains R and C separated by a space. The second line contains S1. The third line contains S2.  Output  The first line contains the integer value denoting the number of occurrence of S2 in the character matrix formed.  Boundary Conditions  2 <= R, C <= 100. 2 <= Length of S1 <=10000. 2 <= Length of S2 <= 200.  Example Input/Output 1   Input  5 4 managermetuatten man  Output  ...
Click to Continue...

First N Repeated Characters

PKJ
 Coding Problem Keys   First N Repeated Characters   Problem Statement  The program must accept a string S and then print all the characters which are among the first N repeated characters in S.  Input Format  The first line contains the value of S. The second line contains the value of N.  Output Format  The first line contains the string output.  Constraints  1 <= Length of S  <= 1000 1 <= N <= 100  Example Input/Output 1   Input  abcdeabecdacdbe 4   Output  abceabecacbe   Explanation  Though all characters a, b, c, d, e are repeated thrice, the first four repeated characters are a b c e.  Example Input/Output 2   Input  officialwork 2   Output  ffii  Max Execution Time Limit: 500 millisecs   Solution   Programming Language: Python 3 Language  def firstRepeatedChar (s,n): h = {} k=[] for ch ...
Click to Continue...

Largest of Tenth Digit and Unit Digit

PKJ
 Coding Problem Keys   Largest of Tenth Digit and Unit Digit   Problem Statement  Given an integer N as input, the program must print the largest of the tenth digit and the unit digit in the integer N.  Boundary Condition(s)  10 <= N <= 9999999  Input Format  The first line contains the value of N.  Output Format  The first line contains the largest of the tenth digit and the unit digit in the integer N.  Example Input/Output 1   Input  5442  Output  4  Explanation  Tenth digit (4) is greater than unit digit (2).  Example Input/Output 2   Input  4567  Output  7  Explanation  Unit digit (7) is greater than tenth digit (6).  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= input () if (n[- 1 ]>n[- 2 ]): print (n[- 1 ]) else : print (n[- 2 ]) # Published By PKJC...
Click to Continue...

String With Most Vowels

PKJ
 Coding Problem Keys   String With Most Vowels   Problem Statement  Two Strings S1 and S2 are given as input. The program must print the string with the most number of vowels. If two strings have the same number of vowels, print the string with greater length.  Boundary Condition(s)  1 <= Length of Strings <=1000  Input Format  The first line S1 and S2 separated by space(s).  Output Format  The first line contains a string.  Example Input/Output 1   Input  adder divider  Output  divider  Example Input/Output 2   Input  important welcome  Output  important  Note:  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Java Language  import java.util.* ; public class Hello { public static int vowel (String s){ int x= 0 ; s=s. toLowerCase (); char ch; for ( in...
Click to Continue...

Reverse Column - First and Last

PKJ
 Coding Problem Keys   Reverse Column - First and Last   Problem Statement  The program must accept an integer matrix of size RxC as the input. The program must reverse all the elements in the column if the first and last elements of the column are same. Then the program must print the modified matrix as the output.  Input Format  The first line contains the value of R and C separated by space. The next R lines contain each C elements separated by space(s).  Output Format  The first R lines contain each C elements separated by space.  Boundary Condition(s)  2 <= R, C <= 50 -999 <= Each element of the matrix <= 999  Example Input/Output 1   Input  5 4 11 7 5 19 4 13 16 10 9 9 13 0 7 5 17 8 11 8 5 12   Output  11 7 5 19 7 13 17 10 9 9 13 0 4 5 16 8 11 8 5 12  Explanation  The elements in the first column are 11, 4, 9, 7 and 11. Here the first and the last elements are same. So ...
Click to Continue...