提出 #67568

---

ソースコード 拡げる

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <fstream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;

ll gcd(ll a, ll b){
	return (b>0)? gcd(b, a%b) : a ;
}

int main(){


	map <int,int> m;
	m['b']=1;
	m['c']=1;
	m['t']=3;
	m['j']=3;
	m['l']=5;
	m['v']=5;
	m['p']=7;
	m['m']=7;
	m['n']=9;
	m['g']=9;
	m['d']=2;
	m['w']=2;
	m['f']=4;
	m['q']=4;
	m['s']=6;
	m['x']=6;
	m['h']=8;
	m['k']=8;
	m['z']=-1;
	m['r']=-1;
	ll N;cin>>N;
	string result;
	for(int i=0;i<N;++i){
		string w;
		cin>>w;
		bool updated=false;
		for(int j=0;j<w.length();++j){
			int wc=w[j];
		if(w[j]>='A'&&w[j]<='Z')wc=tolower(w[j]);
		if(m[wc]){
			if(m[wc]==-1){
				result+=" ";
				result[result.length()-1]
					=(char)(m[wc]+1+'0');
			}else{
				result+=" ";
				result[result.length()-1]
				=(char)(m[wc]+'0');
			}
			updated=true;
		}
		}
		if(updated)result+=" ";
	}
	cout<<result.substr(0,result.length()-1)<<endl;
}

提出情報

ジャッジ結果