juinda

Untitled

Oct 30th, 2016
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.83 KB | None | 0 0
  1. // 20161027phonenum1.cpp : 定義主控台應用程式的進入點。
  2. //
  3.  
  4. #include "stdio.h"
  5. #include<stdlib.h>
  6.  
  7. int main()
  8. {
  9. char a[100];
  10. int num[7] ;
  11. char eng[8][3] = { {'A','B','C'},
  12. {'D','E','F'},
  13. {'G','H','I'},
  14. {'J','K','L'},
  15. {'M','N','O'},
  16. {'P','R','S'},
  17. {'T','U','V'},
  18. {'W','X','Y'} };
  19. while (gets(a) != NULL)
  20. {
  21. int i = 0, j = 0;
  22. while (a[i] != '\0')
  23. {
  24. if (a[i] <= 57 && a[i] >= 50)
  25. {
  26. num[j] = a[i] - 50;
  27. j++;
  28. if (j == 7)break;
  29. }
  30. else if (a[i] == '0' || a[i] == '1')
  31. {
  32. break;
  33. }
  34. i++;
  35. }
  36. if (a[i] == '0' || a[i] == '1')
  37. {
  38. puts("Can't print a word!");
  39. continue;
  40. }
  41. else if (j == 0)
  42. {
  43. puts("None.");
  44. continue;
  45. }
  46. for (int k = 0; k < 3; k++)
  47. {
  48. if (j == 1)printf("%c\n", eng[num[0]][k]);
  49. for (int l = 0; l < 3; l++)
  50. {
  51. if (j == 2)printf("%c%c\n", eng[num[0]][k], eng[num[1]][l]);
  52. for (int m = 0; m < 3; m++)
  53. {
  54. if (j == 3)printf("%c%c%c\n", eng[num[0]][k], eng[num[1]][l], eng[num[2]][m]);
  55. for (int n = 0; n < 3; n++)
  56. {
  57. if (j == 4)printf("%c%c%c%c\n", eng[num[0]][k], eng[num[1]][l], eng[num[2]][m],eng[num[3]][n]);
  58. for (int o = 0; o < 3; o++)
  59. {
  60. if (j == 5)printf("%c%c%c%c%c\n", eng[num[0]][k], eng[num[1]][l], eng[num[2]][m], eng[num[3]][n], eng[num[4]][o]);
  61. for (int p = 0; p < 3; p++)
  62. {
  63. if (j == 6)printf("%c%c%c%c%c%c\n", eng[num[0]][k], eng[num[1]][l], eng[num[2]][m], eng[num[3]][n], eng[num[4]][o],eng[num[5]][p]);
  64. for (int q = 0; q < 3; q++)
  65. {
  66. if (j == 7)printf("%c%c%c%c%c%c%c\n", eng[num[0]][k], eng[num[1]][l], eng[num[2]][m], eng[num[3]][n], eng[num[4]][o], eng[num[5]][p], eng[num[6]][q]);
  67. }
  68. }
  69. }
  70. }
  71. }
  72. }
  73. }
  74. }
  75. }
Advertisement
Add Comment
Please, Sign In to add comment