Category

Development Platform
Home > SourceCode/Document > Mathimatics-Numerical algorithms > Algorithm > View Code
switch.c
Package: C语言精彩编程百例_源代码.rar　[view]
Upload User: bjtelijie
Upload Date: 2010-01-01
Package Size: 87k
Code Size: 2k
Category:

Algorithm

Development Platform:

Visual C++

switch.c：Code Content
  1. # include <stdio.h>
  3. void main()
  4. {
  5. int num;
  6. /* 下面定义的各变量，分别代表个位，十位，百位，千位，万位，十万位以及位数 */
  7. int indiv, ten, hundred, thousand; 
  8. int ten_thousand, hundred_thousand, place;
  10. printf("请输入一个整数(0～999999)：");
  11. scanf("%d", &num);
  13. /* 判断变量num的位数 */
  14. if(num > 99999)
  15. place = 6;
  16. else if(num > 9999)
  17. place = 5;
  18. else if(num > 999)
  19. place = 4;
  20. else if(num > 99)
  21. place = 3;
  22. else if(num > 9)
  23. place = 2;
  24. else
  25. place = 1;
  26. printf("place = %dn", place);
  28. printf("每位数字为：");
  30. /* 求出num在各位上的值 */
  31. hundred_thousand = num/100000;
  32. ten_thousand = (num - hundred_thousand*100000)/10000;
  33. thousand = (num - hundred_thousand*100000 - ten_thousand*10000)/1000;
  34. hundred = (num - hundred_thousand*100000 - ten_thousand*10000 
  35.       - thousand*1000)/100;
  36. ten = (num - hundred_thousand*100000 - ten_thousand*10000 
  37.   - thousand*1000 - hundred*100)/10;
  38. indiv = num - hundred_thousand*100000 - ten_thousand*10000 
  39.     - thousand*1000 - hundred*100 - ten*10;
  41. /* 判断变量num的位数，并根据位数做出相应的输出 */
  42. switch(place)
  43. {
  44. case 1: printf("%d", indiv);
  45.     printf("n反序数字为：");
  46. printf("%dn", indiv);
  47. break;
  48.     case 2: printf("%d, %d", ten, indiv);
  49.     printf("n反序数字为：");
  50. printf("%d%dn", indiv, ten);
  51. break;
  52. case 3: printf("%d, %d, %d", hundred, ten, indiv);
  53.     printf("n反序数字为：");
  54. printf("%d%d%dn", indiv, ten, hundred);
  55. break;
  56. case 4: printf("%d, %d, %d, %d", thousand, hundred, ten, indiv);
  57.     printf("n反序数字为：");
  58. printf("%d%d%d%dn", indiv, ten, hundred, thousand);
  59. break;
  60. case 5: printf("%d, %d, %d, %d, %d", ten_thousand, thousand, 
  61.    hundred, ten, indiv);
  62.     printf("n反序数字为：");
  63. printf("%d%d%d%d%dn", indiv, ten, hundred, 
  64.     thousand, ten_thousand);
  65. break;
  66. case 6: printf("%d, %d, %d, %d, %d, %d", hundred_thousand, 
  67.    ten_thousand, thousand, hundred, ten, indiv);
  68.     printf("n反序数字为：");
  69. printf("%d%d%d%d%d%dn", indiv, ten, hundred, thousand,
  70.     ten_thousand, hundred_thousand);
  71. break;
  72. default: printf("Not find.n");
  73.      break;
  74. }
  75. }