• C++ 代码输出春天的春

    1. #define _CRT_SECURE_NO_WARNINGS
    2. #include 
    3. #include
    4. using namespace std;
    5. //#include"complex.hpp"
    6.  
    7. #define F(i,a,b) for(i=a;i
    8. void Line()
    9. {//--123456789012345678901234--
    10. 	int i;
    11. 	cout << "--";
    12. 	F(i, 1, 25)
    13. 		cout << i % 10;
    14. 	cout << "--" << endl;
    15. }
    16. void Cnum(int n)
    17. {//输出01 02  22不够则0补齐的功能
    18. 	n < 10?	cout << '0' << n:cout << n;	
    19. }
    20. void cpy(char ch[], char c[], int start)
    21. {//第一个参数目标字符串，第二个参数原字符串，第三个参数起始位置
    22. 	strcpy(&ch[start - 1], c);
    23. }
    24. void pLine(char ch[],int num)
    25. {//第一个参数字符串，第二个参数行编号	
    26. 	Cnum(num); 	for (int i = 0; i < 24; i++)if (ch[i] == '*')cout << '*';else cout << ' '; 	Cnum(num);	cout << endl;
    27. }
    28. int main()
    29. {
    30. 	int i;
    31. 	char chun[24][24] = {'0'};
    32. 	char ch1[] = "*";
    33. 	char ch2[] = "**";
    34. 	char ch3[] = "***";
    35. 	char ch4[] = "****";
    36. 	char ch5[] = "*****";
    37. 	char ch11[] = "***********";
    38. 	char ch13[] = "*************";
    39. 	char ch17[] = "*****************";
    40. 	char ch22[] = "**********************";
    41. 	cpy(chun[0], ch1, 11);
    42. 	cpy(chun[1], ch3, 11);
    43. 	cpy(chun[2], ch2, 11);
    44. 	cpy(chun[2], ch2, 17);
    45. 	cpy(chun[3], ch17, 3);
    46. 	cpy(chun[4], ch2, 10);
    47. 	cpy(chun[5], ch2, 10);
    48. 	cpy(chun[5], ch2, 18);
    49. 	cpy(chun[6], ch17, 4);
    50. 	cpy(chun[7], ch2, 9);
    51. 	cpy(chun[8], ch2, 9);
    52. 	cpy(chun[8], ch2, 19);
    53. 	cpy(chun[9], ch22, 2);
    54. 	cpy(chun[10], ch2, 8);
    55. 	cpy(chun[10], ch1, 15);
    56. 	cpy(chun[11], ch2, 7);
    57. 	cpy(chun[11], ch2, 15);
    58. 	cpy(chun[12], ch2, 7);
    59. 	cpy(chun[12], ch2, 16);
    60. 	cpy(chun[13], ch13, 6);
    61. 	cpy(chun[14], ch4, 5);
    62. 	cpy(chun[14], ch5, 16);
    63.  
    64. 	cpy(chun[15], ch2, 4);
    65. 	cpy(chun[15], ch2, 7);
    66. 	cpy(chun[15], ch2, 16);
    67. 	cpy(chun[15], ch4, 20);
    68.  
    69. 	cpy(chun[16], ch1, 3);
    70. 	cpy(chun[16], ch2, 7);
    71. 	cpy(chun[16], ch2, 16);
    72. 	cpy(chun[16], ch1, 21);
    73.  
    74. 	cpy(chun[17], ch1, 2);
    75. 	cpy(chun[17], ch11, 7);
    76.  
    77. 	cpy(chun[18], ch2, 7);
    78. 	cpy(chun[18], ch2, 16);
    79.  
    80. 	cpy(chun[19], ch2, 7);
    81. 	cpy(chun[19], ch2, 16);
    82.  
    83. 	cpy(chun[20], ch2, 7);
    84. 	cpy(chun[20], ch2, 16);
    85.  
    86. 	cpy(chun[21], ch11, 7);
    87.  
    88. 	cpy(chun[22], ch2, 7);
    89. 	cpy(chun[22], ch2, 16);
    90.  
    91. 	cpy(chun[23], ch1, 7);
    92. 	cpy(chun[23], ch1, 17);
    93.  
    94. 	Line();
    95. 	F(i,0,24) pLine(chun[i],i+1);
    96.  
    97. 	Line();
    98.  
    99.     return 0;
    100. }
    101.  
    1. #define _CRT_SECURE_NO_WARNINGS
    2. #include 
    3. #include
    4. #include 
    5. using namespace std;
    6. //#include"complex.hpp"
    7.  
    8. #define F(i,a,b) for(i=a;i
    9. void Line()
    10. {//--123456789012345678901234--
    11. 	int i;
    12. 	cout << "--";
    13. 	F(i, 1, 25)
    14. 		cout << i % 10;
    15. 	cout << "--" << endl;
    16. }
    17. void Cnum(int n)
    18. {//输出01 02  22不够则0补齐的功能
    19. 	n < 10?	cout << '0' << n:cout << n;	
    20. }
    21. void cpy(char ch[], char c[], int start)
    22. {//第一个参数目标字符串，第二个参数原字符串，第三个参数起始位置
    23. 	strcpy(&ch[start - 1], c);
    24. }
    25. void pLine(char ch[],int num)
    26. {//第一个参数字符串，第二个参数行编号	
    27. 	Cnum(num); 	for (int i = 0; i < 24; i++)if (ch[i] == '*')cout << '*';else cout << ' '; 	Cnum(num);	cout << endl;
    28. }
    29. int main()
    30. {
    31. 	int i;
    32. 	char chun[24][24] = {'0'};
    33. 	char ch[24] = {'0'};
    34. 	char ch1[] = "*";
    35. 	char ch2[] = "**";
    36. 	char ch3[] = "***";
    37. 	char ch4[] = "****";
    38. 	char ch5[] = "*****";
    39. 	char ch11[] = "***********";
    40. 	char ch13[] = "*************";
    41. 	char ch17[] = "*****************";
    42. 	char ch22[] = "**********************";
    43. 	cpy(chun[0], ch1, 11);
    44. 	cpy(chun[1], ch3, 11);
    45. 	cpy(chun[2], ch2, 11);
    46. 	cpy(chun[2], ch2, 17);
    47. 	cpy(chun[3], ch17, 3);
    48. 	cpy(chun[4], ch2, 10);
    49. 	cpy(chun[5], ch2, 10);
    50. 	cpy(chun[5], ch2, 18);
    51. 	cpy(chun[6], ch17, 4);
    52. 	cpy(chun[7], ch2, 9);
    53. 	cpy(chun[8], ch2, 9);
    54. 	cpy(chun[8], ch2, 19);
    55. 	cpy(chun[9], ch22, 2);
    56. 	cpy(chun[10], ch2, 8);
    57. 	cpy(chun[10], ch1, 15);
    58. 	cpy(chun[11], ch2, 7);
    59. 	cpy(chun[11], ch2, 15);
    60. 	cpy(chun[12], ch2, 7);
    61. 	cpy(chun[12], ch2, 16);
    62. 	cpy(chun[13], ch13, 6);
    63. 	cpy(chun[14], ch4, 5);
    64. 	cpy(chun[14], ch5, 16);
    65.  
    66. 	cpy(chun[15], ch2, 4);
    67. 	cpy(chun[15], ch2, 7);
    68. 	cpy(chun[15], ch2, 16);
    69. 	cpy(chun[15], ch4, 20);
    70.  
    71. 	cpy(chun[16], ch1, 3);
    72. 	cpy(chun[16], ch2, 7);
    73. 	cpy(chun[16], ch2, 16);
    74. 	cpy(chun[16], ch1, 21);
    75.  
    76. 	cpy(chun[17], ch1, 2);
    77. 	cpy(chun[17], ch11, 7);
    78.  
    79. 	cpy(chun[18], ch2, 7);
    80. 	cpy(chun[18], ch2, 16);
    81.  
    82. 	cpy(chun[19], ch2, 7);
    83. 	cpy(chun[19], ch2, 16);
    84.  
    85. 	cpy(chun[20], ch2, 7);
    86. 	cpy(chun[20], ch2, 16);
    87.  
    88. 	cpy(chun[21], ch11, 7);
    89.  
    90. 	cpy(chun[22], ch2, 7);
    91. 	cpy(chun[22], ch2, 16);
    92.  
    93. 	cpy(chun[23], ch1, 7);
    94. 	cpy(chun[23], ch1, 17);
    95.  
    96. 	Line();
    97. 	F(i,0,24) pLine(chun[i],i+1);
    98. 	Line();
    99.  
    100. 	int n = 0;
    101. 	while (1)
    102. 	{	
    103. 			system("cls");		
    104.  
    105. 		Line();
    106. 		F(i, 0, n) pLine(chun[i], i + 1);
    107. 		F(i, n, 24) pLine(ch, i + 1);
    108. 		Line();
    109. 		n++; n %= 25;
    110. 		if (!n)
    111. 			Sleep(1000);
    112. 		else
    113. 			Sleep(50);
    114. 	}
    115.     return 0;
    116. }
    117.

  • 相关阅读:
    软件设计模式系列之三———工厂方法模式
    最高奖励5亿元，杭州出台政策，打造万亿级智能物联产业生态圈
    KubeGems 启用 Nacos 配置中心
    卡塔尔世界杯在哪里可以看直播？
    【数据结构】HashMap 和 HashSet
    2023天津科技大学计算机考研信息汇总
    【网络安全篇】php伪协议-漏洞及其原理
    Linux基础命令大全
    Python蓝桥杯---数列求值
    Nacos中服务删除不了，怎么办？
  • 原文地址：https://blog.csdn.net/laocooon/article/details/126450722