//Created by UraL, 19.08.2019 /* Because ASCII table for code 0..127 is standard, then we work with string in uppercase !!! */ /* Input Format The first line of input consist of number of test cases, T. The first line of each test case consist of the message. The second line of each test case consist of a numbered string which will help in decryption. Constraints : 1<= T <=10 1<= |string| <=100 1<= |numbered_string| <=|string| Output Format Print the decrypted message and help Ray secure second spot. Sample TestCase 1 Input 2 fgjkl 23145 poliut 342561 Output hdiog msndas */ #include #include #include #include //strupr(), strlwr() int main() { #define CountMax 10 int T, i; char InputMsg [CountMax][100]; char NumberMsg[CountMax][100]; char OutputMsg[CountMax][100]; printf("Number of test cases:"); scanf("%d", &T); if (T < 1 || T > 10) { printf("\n Number is not valid"); getch(); exit(1); } for (i = 0; i < T; i++) { printf("\n%d Input Message: ", i+1); scanf("%s", InputMsg[i]); strcpy(OutputMsg[i], InputMsg[i]); printf("\n%d Number Message: ", i+1); scanf("%s", NumberMsg[i]); } //------- for (i = 0; i < T; i++) { int j, len; printf("\n%d OutputMsg Before: %s", i+1, OutputMsg[i]); char *ptr; ptr = OutputMsg[i]; ptr = strupr(OutputMsg[i]); //upper case len = strlen(NumberMsg[i]); for (j = 0; j < len; j++) { int k = NumberMsg[i][j]-'0'; if (k % 2) OutputMsg[i][j] -= k; else OutputMsg[i][j] += k; // cyclic rotation if out of 'a'..'z' if (OutputMsg[i][j] > 'Z') { OutputMsg[i][j] -= 26; } else if (OutputMsg[i][j] < 'A') { OutputMsg[i][j] += 26; } } ptr = OutputMsg[i]; ptr = strlwr(OutputMsg[i]); //lower case printf("\n%d OutputMsg After: %s", i+1, OutputMsg[i]); } return 0; }

decrypt msg 1