POJ 1002(不用排序的方法)（简单的字符串处理程序）

来源：互联网发布：java装饰模式和注解编辑：程序博客网时间：2024/05/20 22:41

#include <iostream>#include <cstring>using namespace std;int flag[10][10][10][10][10][10][10];int main(){char map[30] = "2223334445556667#77888999";char str[41];char result[8];int testCount,resultCount;scanf("%d",&testCount);while(testCount--){scanf("%s",str);resultCount = -1;for(int i = 0; i < strlen(str); ++i){if(str[i] == 'Q')continue;if( str[i] >= '0' && str[i] <= '9'){result[++resultCount] = str[i];}else if( str[i] >= 'A' && str[i] <= 'Y'){result[++resultCount] = map[ str[i]-65 ];}}++flag[ result[0] - 48 ][ result[1] - 48 ][ result[2] - 48 ][ result[3] - 48 ][ result[4] - 48 ][ result[5] - 48 ][ result[6] - 48 ];}int Sflag = 0;int a1,a2,a3,a4,a5,a6,a7;for(a1=0; a1<10; ++a1){for(a2=0; a2<10; ++a2){for(a3=0; a3<10; ++a3){for(a4=0; a4<10; ++a4){for(a5=0; a5<10; ++a5){for(a6=0; a6<10; ++a6){for(a7=0; a7<10; ++a7){if(flag[a1][a2][a3][a4][a5][a6][a7] >= 2){printf("%d%d%d-%d%d%d%d %d\n",a1,a2,a3,a4,a5,a6,a7, flag[a1][a2][a3][a4][a5][a6][a7]);Sflag = 1;}}}}}}}}if(Sflag == 0)printf("No duplicates.\n");  }

阅读全文

0 0