// Made by :- Sp Maurya /* INPUT :- First line of input contains an integer for number of test cases. Each test case contains an integer (denoting the length of the string) and a string S... All the entries can be separated by space or newline... for.eg. 3 - No. of Testcases 20 - Size of first String j4eZamQY0SQgM9cX7dcb - first String 17 - Size of second String rOMNgC0bBUgJnz9Ra - second String 19 - Size of third String CXNUgE6RwBysojPIM6o - third String */ // OUTPUT :- The entered String will be converted to another String having each character alphabet of prime ASCII value nearest to that of the original characters... for.eg. ASCII values of alphabets in AFREEN are 65, 70, 82, 69 ,69 and 78 respectively which are converted to CGSCCO with ASCII values 67, 71, 83, 67, 67, 79 respectively. All such ASCII values are prime numbers. // Made for HackerEarth Challenge : LINK - https://www.hackerearth.com/practice/basic-programming/input-output/basics-of-input-output/practice-problems/algorithm/magical-word/ #include using namespace std; unsigned short closestPrime(unsigned short); unsigned short checkPrime(unsigned short); int main() { unsigned short size,testCase; cin>>testCase; for(unsigned short t=0; t>size; char str[size]; cin>>str; for(unsigned short i=0; i'z') n='z'; else if(n>'Z'&&n<'a') { if(n-'Z'<='a'-n) n='Z'; else n='a'; } unsigned short a=n,b=n; while(!checkPrime(a)) a--; while(!checkPrime(b)) b++; if(((a>='A'&&a<='Z')||(a>='a'&&a<='z'))&&((b>='A'&&b<='Z')||(b>='a'&&b<='z'))) { if(n-a <= b-n) return a; else return b; } else if(!(a>='A'&&a<='Z')||(a>='a'&&a<='z')) if((b>='A'&&b<='Z')||(b>='a'&&b<='z')) return b; else if(!(b>='A'&&b<='Z')||(b>='a'&&b<='z')) if((a>='A'&&a<='Z')||(a>='a'&&a<='z')) return a; return n; } unsigned short checkPrime(unsigned short n) { if(n<2) return 0; for(unsigned short i=2; i

MagicalWord.cpp