I Love You Too

I Love You Too

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2106    Accepted Submission(s): 1245

Problem Description

This is a  true story. A man showed his love to a girl,but the girl didn't replied clearly ,just gave him a Morse Code:
****-/*----/----*/****-/****-/*----/---**/*----/****-/*----/-****/***--/****-/*----/----*/**---/-****/**---/**---/***--/--***/****-/   He was so anxious that he asked for help in the Internet and after one day a girl named "Pianyi angel" found the secret of this code. She translate this code as this five steps:
1.First translate the morse code to a number string: 4194418141634192622374
2.Second she cut two number as one group  41 94 41 81 41 63 41 92 62 23 74,according to standard Mobile phone can get this alphabet: GZGTGOGXNCS

3.Third she change this alphabet according to the keyboard: QWERTYUIOPASDFGHJKLZXCVBNM = ABCDEFGHIJKLMNOPQRSTUVWXYZ
So ,we can get  OTOEOIOUYVL
4.Fourth, divide this alphabet to two parts:  OTOEOI and  OUYVL, compose again.we will get  OOTUOYEVOLI
5.Finally,reverse this alphabet the answer will appear :  I LOVE YOU TOO

I guess you might worship Pianyi angel as me,so let's Orz her.
Now,the task is translate the number strings.

 

Input

A number string each line(length <= 1000). I ensure all input are legal.

 

Output

An upper alphabet string.

 

Sample Input

  
  

   
   4194418141634192622374
41944181416341926223
  
  

 

Sample Output

  
  

   
   ILOVEYOUTOO
VOYEUOOTIO
  
  

 

Author

NotOnlySuccess

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<map>
using namespace std;
char p[10][5]={"ABC","DEF","GHI","JKL","MNO","PQRS","TUV","WXYZ"};

int main(){
	

	map<char,char>mm;
	char str[27]="QWERTYUIOPASDFGHJKLZXCVBNM";
	char str1[27]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
	for(int i=0;i<26;i++)
	{
		mm[str[i]]=str1[i];
	}
	
	/*for(int i=0;i<26;i++)
	cout<<mm[str[i]]<<" ";*/
	
	string ss;
	while(cin>>ss){
		string s;
		//4 1 9 4 4 1 81 41 63 41 92 62 23 74
		// G   Z   G  T  G  O  G  X  N   C  S
		for(int i=0;i<ss.size();i+=2)
		{
			int a=ss[i]-'2';
			int b=ss[i+1]-'1';
			s+=p[a][b];
		}	
		
		//QWERTYUIOPASDFGHJKLZXCVBNM = ABCDEFGHIJKLMNOPQRSTUVWXYZ
		string s1;
		for(int i=0;i<s.size();i++)
		{
			s1+=mm[s[i]];
		}
		//OTOEOIOUYVL-> OTOEOI and OUYVL
		int len=s.size();
		if(s1.size()&1)
		len+=1;
		len/=2;
		string s2,s3;
		
		for(int i=0;i<len;i++)
		s2+=s1[i];
		
		for(int i=len;i<s1.size();i++)
		{
			s3+=s1[i];
		}
	
		string s4;
		int le=0,lee=0;
		for(int i=0;i<s.size();i++)
		{
			if(i%2==0)
			s4+=s2[le++];
			else s4+=s3[lee++];
		}
	//输出	
	for(int i=s4.size()-1;i>=0;i--)
		{
			cout<<s4[i];
		}
		cout<<endl;
	}
	
	
}