{"version":"1.0","description":"#include <iostream> #include <cstdlib> using namespace std; int main(){ const char *table[] = {\"abcde\", \"fghij\", \"klmno\", \"pqrst\", \"uvwxy\", \"z.?! \"}; string s; while(cin >> s){ int row = 0, col = 0, na = 0; string t; if(s.size() % 2){ na = 1; }else{ for(int i = 0, l = s.size(); i < l; i += 2){ strin\u2026","width":"100%","author_name":"peryaudo","title":"AOJ 0127 Pocket Pager Input","categories":["Programming","Algorithm","AOJ"],"blog_url":"https://peryaudo.hatenablog.com/","author_url":"https://blog.hatena.ne.jp/peryaudo/","image_url":null,"blog_title":"\u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5","provider_name":"Hatena Blog","published":"2010-07-24 01:41:02","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperyaudo.hatenablog.com%2Fentry%2F20100724%2F1279989662\" title=\"AOJ 0127 Pocket Pager Input - \u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","height":"190","url":"https://peryaudo.hatenablog.com/entry/20100724/1279989662"}