出生题 非常容易AC的一道题，逐位比对就完了~~

$\color{#FF0000}\text{WARNING:}$

数字要开longlong!

数字要开longlong!

数字要开longlong! 重要的事情说三遍.

#include <bits/stdc++.h>
using namespace std;
long long n;
int c=0,nam[13];
bool f=0;
char dic[10][4]={{' ',' ',' ',' '},{' ',' ',' ',' '},{' ','A','B','C'},{' ','D','E','F'},{' ','G','H','I'},{' ','J','K','L'},{' ','M','N','O'},{' ','P','R','S'},{' ','T','U','V'},{' ','W','X','Y'}};
int main()
{
	cin>>n;
	while (n>0){
		c++;
		nam[c]=n%10;
		n/=10;
	}
	for (int i=1;i<=4617;i++){
		bool flag_=1;
		string a;
		cin>>a;
		if (a.length()!=c){
			continue;
		}
		for (int j=1;j<=c;j++){
			bool flag=0;
			for (int k=1;k<=3;k++){
				if (/*比对是否相同,请补全代码，PS:有坑!*/){
					flag=1;
					break;
				}
			}
			if (!flag){
				flag_=0;
				break;
			}
		}
		if (flag_){
			cout<<a<<endl;
			f=1;
		}
	}
	if (f==0){
		cout<<"NONE";
	}
}

#include<iostream>
#include <map>
#include<cstring>
#include<cstdio>
using namespace std;
char dic[5000][20];
char bh[15];
 map <char,int> m;
bool check(int x){
    if(strlen(dic[x])==strlen(bh)){
        for(int i=0;i<strlen(bh);i++)
            if(m[dic[x][i]]!=bh[i]-'0') return 0;
        return 1;
    }
    return 0;
}
int main(){
    m['A']=2;m['B']=2;m['C']=2;
m['D']=3;m['E']=3;m['F']=3;
m['G']=4;m['H']=4;m['I']=4;
m['J']=5;m['K']=5;m['L']=5;
m['M']=6;m['N']=6;m['O']=6;
m['P']=7;m['R']=7;m['S']=7;
m['T']=8;m['U']=8;m['V']=8;
m['W']=9;m['X']=9;m['Y']=9;
    bool flag=0; 
    scanf("%s",bh);
    for(int i=0;i<4617;i++)
    scanf("%s",dic[i]);
    for(int i=0;i<4617;i++)
        if(check(i)){ 
        cout<<dic[i]<<endl;
        flag=1; 
                } 
    if(!flag) cout<<"NONE"<<endl;
    return 0;
}