当前位置:   article > 正文

元旦快乐(修改版)_元旦快乐代码c++

元旦快乐代码c++
  1. #include<iostream>
  2. using namespace std;
  3. #define NYR 24
  4. #define NYC 47
  5. #define SPEED 10000
  6. void deLay(int d){
  7. float p, q;
  8. for (p = 0; p < d; p = p + 0.001){
  9. q = q + 0.01;
  10. }
  11. }
  12. //yuan
  13. void yuan(){
  14. char aone[NYR][NYC];
  15. int i, j, m;
  16. for (i=0;i<NYR;i++){
  17. for (j=0;j<NYC;j++){
  18. aone[i][j] = ' ';
  19. }
  20. }
  21. for (i=0;i<NYR;i++){
  22. if (i == 3 || i == 4){
  23. for (m=10; m<=37;m++){
  24. aone[i][m] = 'X';
  25. }
  26. }
  27. if (i == 9 || i == 10){
  28. for (m=6; m<=41;m++){
  29. aone[i][m] = 'X';
  30. }
  31. }
  32. if (i == 11 || i == 12 || i == 13){
  33. for (m=17; m<=19;m++){
  34. aone[i][m] = 'X';
  35. }
  36. for (m=27; m<=29;m++){
  37. aone[i][m] = 'X';
  38. }
  39. }
  40. if (i == 14){
  41. for (m=16; m<=18;m++){
  42. aone[i][m] = 'X';
  43. }
  44. for (m=27; m<=29;m++){
  45. aone[i][m] = 'X';
  46. }
  47. }
  48. if (i == 15){
  49. for (m=15; m<=18;m++){
  50. aone[i][m] = 'X';
  51. }
  52. for (m=27; m<=29;m++){
  53. aone[i][m] = 'X';
  54. }
  55. aone[i][39] = 'X';
  56. }
  57. if (i == 16){
  58. for (m=14; m<=17;m++){
  59. aone[i][m] = 'X';
  60. }
  61. for (m=27; m<=29;m++){
  62. aone[i][m] = 'X';
  63. }
  64. for (m=39; m<=41;m++){
  65. aone[i][m] = 'X';
  66. }
  67. }
  68. if (i == 17){
  69. for (m=12; m<=16;m++){
  70. aone[i][m] = 'X';
  71. }
  72. for (m=27; m<=29;m++){
  73. aone[i][m] = 'X';
  74. }
  75. for (m=39; m<=41;m++){
  76. aone[i][m] = 'X';
  77. }
  78. }
  79. if (i == 18){
  80. for (m=10; m<=14;m++){
  81. aone[i][m] = 'X';
  82. }
  83. for (m=27; m<=29;m++){
  84. aone[i][m] = 'X';
  85. }
  86. for (m=38; m<=41;m++){
  87. aone[i][m] = 'X';
  88. }
  89. }
  90. if (i == 19){
  91. for (m=6; m<=12;m++){
  92. aone[i][m] = 'X';
  93. }
  94. for (m=27; m<=40;m++){
  95. aone[i][m] = 'X';
  96. }
  97. }
  98. if (i == 20){
  99. aone[i][6] = 'X';
  100. aone[i][7] = 'X';
  101. for (m=29; m<=39;m++){
  102. aone[i][m] = 'X';
  103. }
  104. }
  105. }
  106. for (i=0;i<NYR;i++){
  107. for (j=0;j<NYC;j++){
  108. cout << aone[i][j];
  109. }
  110. void deLay(int);
  111. deLay(SPEED);
  112. cout << endl;
  113. }
  114. }
  115. // dan
  116. void dan(){
  117. char atwo[NYR][NYC];
  118. int i, j, m;
  119. for (i=0;i<NYR;i++){
  120. for (j=0;j<NYC;j++){
  121. atwo[i][j] = ' ';
  122. }
  123. }
  124. for (i=0;i<NYR;i++){
  125. if (i == 3 || i == 8 || i == 14){
  126. for (m=11; m<=35;m++){
  127. atwo[i][m] = 'X';
  128. }
  129. }
  130. if (i == 4 || i == 5 || i == 6 || i == 7 || i == 9 || i == 10 || i == 11 || i == 12 || i == 13){
  131. for (m=11; m<=13;m++){
  132. atwo[i][m] = 'X';
  133. }
  134. for (m=33; m<=35;m++){
  135. atwo[i][m] = 'X';
  136. }
  137. }
  138. if (i == 18 || i == 19){
  139. for (m=5; m<=41;m++){
  140. atwo[i][m] = 'X';
  141. }
  142. }
  143. }
  144. for (i=0;i<NYR;i++){
  145. for (j=0;j<NYC;j++){
  146. cout << atwo[i][j];
  147. }
  148. void deLay(int);
  149. deLay(SPEED);
  150. cout << endl;
  151. }
  152. }
  153. // kuai
  154. void kuai(){
  155. char athree[NYR][NYC];
  156. int i, j, m;
  157. for (i=0;i<NYR;i++){
  158. for (j=0;j<NYC;j++){
  159. athree[i][j] = ' ';
  160. }
  161. }
  162. for (i=0;i<NYR;i++){
  163. if (i == 2 || i == 3 || i == 4){
  164. for (m=11; m<=13;m++){
  165. athree[i][m] = 'X';
  166. }
  167. for (m=27; m<=29;m++){
  168. athree[i][m] = 'X';
  169. }
  170. }
  171. if (i == 5){
  172. for (m=11; m<=13;m++){
  173. athree[i][m] = 'X';
  174. }
  175. for (m=20; m<=38;m++){
  176. athree[i][m] = 'x';
  177. }
  178. }
  179. if (i == 6){
  180. for (m=6; m<=8;m++){
  181. athree[i][m] = 'X';
  182. }
  183. for (m=11; m<=13;m++){
  184. athree[i][m] = 'X';
  185. }
  186. for (m=15; m<=16;m++){
  187. athree[i][m] = 'X';
  188. }
  189. for (m=20; m<=38;m++){
  190. athree[i][m] = 'X';
  191. }
  192. }
  193. if (i == 7){
  194. for (m=6; m<=8;m++){
  195. athree[i][m] = 'X';
  196. }
  197. for (m=11; m<=13;m++){
  198. athree[i][m] = 'X';
  199. }
  200. for (m=15; m<=17;m++){
  201. athree[i][m] = 'X';
  202. }
  203. for (m=27; m<=29;m++){
  204. athree[i][m] = 'X';
  205. }
  206. for (m=36; m<=38;m++){
  207. athree[i][m] = 'X';
  208. }
  209. }
  210. if (i == 8){
  211. for (m=6; m<=8;m++){
  212. athree[i][m] = 'X';
  213. }
  214. for (m=11; m<=13;m++){
  215. athree[i][m] = 'X';
  216. }
  217. for (m=16; m<=18;m++){
  218. athree[i][m] = 'X';
  219. }
  220. for (m=27; m<=29;m++){
  221. athree[i][m] = 'X';
  222. }
  223. for (m=36; m<=38;m++){
  224. athree[i][m] = 'X';
  225. }
  226. }
  227. if (i == 9){
  228. for (m=6; m<=8;m++){
  229. athree[i][m] = 'X';
  230. }
  231. for (m=11; m<=13;m++){
  232. athree[i][m] = 'X';
  233. }
  234. for (m=16; m<=19;m++){
  235. athree[i][m] = 'X';
  236. }
  237. for (m=27; m<=29;m++){
  238. athree[i][m] = 'X';
  239. }
  240. for (m=36; m<=38;m++){
  241. athree[i][m] = 'X';
  242. }
  243. }
  244. if (i == 10){
  245. for (m=5; m<=7;m++){
  246. athree[i][m] = 'X';
  247. }
  248. for (m=11; m<=13;m++){
  249. athree[i][m] = 'X';
  250. }
  251. for (m=17; m<=18;m++){
  252. athree[i][m] = 'x';
  253. }
  254. for (m=26; m<=28;m++){
  255. athree[i][m] = 'X';
  256. }
  257. for (m=36; m<=38;m++){
  258. athree[i][m] = 'X';
  259. }
  260. }
  261. if (i == 11){
  262. for (m=4; m<=6;m++){
  263. athree[i][m] = 'X';
  264. }
  265. for (m=11; m<=13;m++){
  266. athree[i][m] = 'X';
  267. }
  268. for (m=18; m<=25;m++){
  269. athree[i][m] = 'x';
  270. }
  271. for (m=26; m<=28;m++){
  272. athree[i][m] = 'X';
  273. }
  274. for (m=29; m<=35;m++){
  275. athree[i][m] = 'x';
  276. }
  277. for (m=36; m<=38;m++){
  278. athree[i][m] = 'X';
  279. }
  280. for (m=39; m<=41;m++){
  281. athree[i][m] = 'x';
  282. }
  283. }
  284. if (i == 12){
  285. for (m=11; m<=13;m++){
  286. athree[i][m] = 'X';
  287. }
  288. for (m=18; m<=41;m++){
  289. athree[i][m] = 'X';
  290. }
  291. }
  292. if (i == 13){
  293. for (m=11; m<=13;m++){
  294. athree[i][m] = 'X';
  295. }
  296. for (m=25; m<=30;m++){
  297. athree[i][m] = 'X';
  298. }
  299. }
  300. if (i == 14){
  301. for (m=11; m<=13;m++){
  302. athree[i][m] = 'X';
  303. }
  304. for (m=25; m<=27;m++){
  305. athree[i][m] = 'X';
  306. }
  307. for (m=29; m<=31;m++){
  308. athree[i][m] = 'X';
  309. }
  310. }
  311. if (i == 15){
  312. for (m=11; m<=13;m++){
  313. athree[i][m] = 'X';
  314. }
  315. for (m=24; m<=26;m++){
  316. athree[i][m] = 'X';
  317. }
  318. for (m=30; m<=33;m++){
  319. athree[i][m] = 'X';
  320. }
  321. }
  322. if (i == 16){
  323. for (m=11; m<=13;m++){
  324. athree[i][m] = 'X';
  325. }
  326. for (m=23; m<=25;m++){
  327. athree[i][m] = 'X';
  328. }
  329. for (m=32; m<=34;m++){
  330. athree[i][m] = 'X';
  331. }
  332. }
  333. if (i == 17){
  334. for (m=11; m<=13;m++){
  335. athree[i][m] = 'X';
  336. }
  337. for (m=21; m<=24;m++){
  338. athree[i][m] = 'X';
  339. }
  340. for (m=33; m<=36;m++){
  341. athree[i][m] = 'X';
  342. }
  343. }
  344. if (i == 18){
  345. for (m=11; m<=13;m++){
  346. athree[i][m] = 'X';
  347. }
  348. for (m=19; m<=22;m++){
  349. athree[i][m] = 'X';
  350. }
  351. for (m=35; m<=38;m++){
  352. athree[i][m] = 'X';
  353. }
  354. }
  355. if (i == 19){
  356. for (m=11; m<=13;m++){
  357. athree[i][m] = 'X';
  358. }
  359. for (m=16; m<=21;m++){
  360. athree[i][m] = 'X';
  361. }
  362. for (m=37; m<=42;m++){
  363. athree[i][m] = 'X';
  364. }
  365. }
  366. if (i == 20){
  367. for (m=11; m<=13;m++){
  368. athree[i][m] = 'X';
  369. }
  370. for (m=17; m<=18;m++){
  371. athree[i][m] = 'X';
  372. }
  373. for (m=40; m<=40;m++){
  374. athree[i][m] = 'X';
  375. }
  376. }
  377. }
  378. for (i=0;i<NYR;i++){
  379. for (j=0;j<NYC;j++){
  380. cout << athree[i][j];
  381. }
  382. void deLay(int);
  383. deLay(SPEED);
  384. cout << endl;
  385. }
  386. }
  387. // le
  388. void le(){
  389. char afour[NYR][NYC];
  390. int i, j, m;
  391. for (i=0;i<NYR;i++){
  392. for (j=0;j<NYC;j++){
  393. afour[i][j] = ' ';
  394. }
  395. if (i == 2){
  396. for (m=34; m<=35;m++){
  397. afour[i][m] = 'X';
  398. }
  399. }
  400. if (i == 3){
  401. for (m=23; m<=36;m++){
  402. afour[i][m] = 'X';
  403. }
  404. }
  405. if (i == 4){
  406. for (m=10; m<=27;m++){
  407. afour[i][m] = 'X';
  408. }
  409. }
  410. if (i == 5){
  411. for (m=9; m<=11;m++){
  412. afour[i][m] = 'X';
  413. }
  414. }
  415. if (i == 6){
  416. for (m=9; m<=11;m++){
  417. afour[i][m] = 'X';
  418. }
  419. for (m=22; m<=24;m++){
  420. afour[i][m] = 'X';
  421. }
  422. }
  423. if (i == 7 || i == 8 || i == 9){
  424. for (m=8; m<=10;m++){
  425. afour[i][m] = 'X';
  426. }
  427. for (m=22; m<=24;m++){
  428. afour[i][m] = 'X';
  429. }
  430. }
  431. if (i == 10){
  432. for (m=7; m<=9;m++){
  433. afour[i][m] = 'X';
  434. }
  435. for (m=10; m<=21;m++){
  436. afour[i][m] = 'x';
  437. }
  438. for (m=22; m<=24;m++){
  439. afour[i][m] = 'X';
  440. }
  441. for (m=25; m<=39;m++){
  442. afour[i][m] = 'x';
  443. }
  444. }
  445. if (i == 11){
  446. for (m=7; m<=39;m++){
  447. afour[i][m] = 'X';
  448. }
  449. }
  450. if (i == 12){
  451. for (m=22; m<=24;m++){
  452. afour[i][m] = 'X';
  453. }
  454. }
  455. if (i == 13){
  456. for (m=12; m<=13;m++){
  457. afour[i][m] = 'X';
  458. }
  459. for (m=22; m<=24;m++){
  460. afour[i][m] = 'X';
  461. }
  462. for (m=31; m<=33;m++){
  463. afour[i][m] = 'X';
  464. }
  465. }
  466. if (i == 14){
  467. for (m=11; m<=13;m++){
  468. afour[i][m] = 'X';
  469. }
  470. for (m=22; m<=24;m++){
  471. afour[i][m] = 'X';
  472. }
  473. for (m=32; m<=34;m++){
  474. afour[i][m] = 'X';
  475. }
  476. }
  477. if (i == 15){
  478. for (m=10; m<=12;m++){
  479. afour[i][m] = 'X';
  480. }
  481. for (m=22; m<=24;m++){
  482. afour[i][m] = 'X';
  483. }
  484. for (m=33; m<=35;m++){
  485. afour[i][m] = 'X';
  486. }
  487. }
  488. if (i == 16){
  489. for (m=9; m<=11;m++){
  490. afour[i][m] = 'X';
  491. }
  492. for (m=22; m<=24;m++){
  493. afour[i][m] = 'X';
  494. }
  495. for (m=34; m<=36;m++){
  496. afour[i][m] = 'X';
  497. }
  498. }
  499. if (i == 17){
  500. for (m=7; m<=10;m++){
  501. afour[i][m] = 'X';
  502. }
  503. for (m=22; m<=24;m++){
  504. afour[i][m] = 'X';
  505. }
  506. for (m=35; m<=38;m++){
  507. afour[i][m] = 'X';
  508. }
  509. }
  510. if (i == 18){
  511. for (m=6; m<=9;m++){
  512. afour[i][m] = 'X';
  513. }
  514. for (m=22; m<=24;m++){
  515. afour[i][m] = 'X';
  516. }
  517. for (m=36; m<=39;m++){
  518. afour[i][m] = 'X';
  519. }
  520. }
  521. if (i == 19){
  522. for (m=6; m<=7;m++){
  523. afour[i][m] = 'X';
  524. }
  525. for (m=15; m<=21;m++){
  526. afour[i][m] = 'x';
  527. }
  528. for (m=22; m<=24;m++){
  529. afour[i][m] = 'X';
  530. }
  531. for (m=37; m<=39;m++){
  532. afour[i][m] = 'X';
  533. }
  534. }
  535. if (i == 20){
  536. for (m=16; m<=23;m++){
  537. afour[i][m] = 'X';
  538. }
  539. }
  540. }
  541. for (i=0;i<NYR;i++){
  542. for (j=0;j<NYC;j++){
  543. cout << afour[i][j];
  544. }
  545. void deLay(int);
  546. deLay(SPEED);
  547. cout << endl;
  548. }
  549. }
  550. // HAPPY NEW YEAR
  551. void happynewyear(){
  552. char afive[NYR][NYC];
  553. int i, j, m;
  554. for (i=0;i<NYR;i++){
  555. for (j=0;j<NYC;j++){
  556. afive[i][j] = ' ';
  557. }
  558. // HAPPY
  559. if (i == 2){
  560. for (m=2; m<=3;m++){
  561. afive[i][m] = 'X';
  562. }
  563. for (m=8; m<=9;m++){
  564. afive[i][m] = 'X';
  565. }
  566. for (m=14; m<=16;m++){
  567. afive[i][m] = 'X';
  568. }
  569. for (m=21; m<=22;m++){
  570. afive[i][m] = 'X';
  571. }
  572. for (m=23; m<=25;m++){
  573. afive[i][m] = 'X';
  574. }
  575. for (m=26; m<=27;m++){
  576. afive[i][m] = 'X';
  577. }
  578. for (m=30; m<=31;m++){
  579. afive[i][m] = 'X';
  580. }
  581. for (m=32; m<=34;m++){
  582. afive[i][m] = 'X';
  583. }
  584. for (m=35; m<=36;m++){
  585. afive[i][m] = 'X';
  586. }
  587. for (m=39; m<=40;m++){
  588. afive[i][m] = 'X';
  589. }
  590. for (m=45; m<=46;m++){
  591. afive[i][m] = 'X';
  592. }
  593. }
  594. if (i == 3){
  595. for (m=2; m<=3;m++){
  596. afive[i][m] = 'X';
  597. }
  598. for (m=8; m<=9;m++){
  599. afive[i][m] = 'X';
  600. }
  601. for (m=13; m<=14;m++){
  602. afive[i][m] = 'X';
  603. }
  604. for (m=16; m<=17;m++){
  605. afive[i][m] = 'X';
  606. }
  607. for (m=21; m<=22;m++){
  608. afive[i][m] = 'X';
  609. }
  610. for (m=26; m<=27;m++){
  611. afive[i][m] = 'X';
  612. }
  613. for (m=30; m<=31;m++){
  614. afive[i][m] = 'X';
  615. }
  616. for (m=35; m<=36;m++){
  617. afive[i][m] = 'X';
  618. }
  619. for (m=40; m<=41;m++){
  620. afive[i][m] = 'X';
  621. }
  622. for (m=44; m<=45;m++){
  623. afive[i][m] = 'X';
  624. }
  625. }
  626. if (i == 4){
  627. for (m=2; m<=9;m++){
  628. afive[i][m] = 'X';
  629. }
  630. for (m=12; m<=13;m++){
  631. afive[i][m] = 'X';
  632. }
  633. for (m=17; m<=18;m++){
  634. afive[i][m] = 'X';
  635. }
  636. for (m=21; m<=22;m++){
  637. afive[i][m] = 'X';
  638. }
  639. for (m=23; m<=25;m++){
  640. afive[i][m] = 'X';
  641. }
  642. for (m=26; m<=27;m++){
  643. afive[i][m] = 'X';
  644. }
  645. for (m=30; m<=31;m++){
  646. afive[i][m] = 'X';
  647. }
  648. for (m=32; m<=34;m++){
  649. afive[i][m] = 'X';
  650. }
  651. for (m=35; m<=36;m++){
  652. afive[i][m] = 'X';
  653. }
  654. for (m=41; m<=44;m++){
  655. afive[i][m] = 'X';
  656. }
  657. }
  658. if (i == 5){
  659. for (m=2; m<=3;m++){
  660. afive[i][m] = 'X';
  661. }
  662. for (m=8; m<=9;m++){
  663. afive[i][m] = 'X';
  664. }
  665. for (m=12; m<=18;m++){
  666. afive[i][m] = 'X';
  667. }
  668. for (m=21; m<=22;m++){
  669. afive[i][m] = 'X';
  670. }
  671. for (m=30; m<=31;m++){
  672. afive[i][m] = 'X';
  673. }
  674. for (m=42; m<=43;m++){
  675. afive[i][m] = 'X';
  676. }
  677. }
  678. if (i == 6){
  679. for (m=2; m<=3;m++){
  680. afive[i][m] = 'X';
  681. }
  682. for (m=8; m<=9;m++){
  683. afive[i][m] = 'X';
  684. }
  685. for (m=11; m<=12;m++){
  686. afive[i][m] = 'X';
  687. }
  688. for (m=18; m<=19;m++){
  689. afive[i][m] = 'X';
  690. }
  691. for (m=21; m<=22;m++){
  692. afive[i][m] = 'X';
  693. }
  694. for (m=30; m<=31;m++){
  695. afive[i][m] = 'X';
  696. }
  697. for (m=42; m<=43;m++){
  698. afive[i][m] = 'X';
  699. }
  700. }
  701. //NEW
  702. if (i == 9){
  703. for (m=9; m<=11;m++){
  704. afive[i][m] = 'X';
  705. }
  706. for (m=16; m<=17;m++){
  707. afive[i][m] = 'X';
  708. }
  709. for (m=19; m<=25;m++){
  710. afive[i][m] = 'X';
  711. }
  712. for (m=27; m<=28;m++){
  713. afive[i][m] = 'X';
  714. }
  715. for (m=32; m<=34;m++){
  716. afive[i][m] = 'X';
  717. }
  718. for (m=38; m<=39;m++){
  719. afive[i][m] = 'X';
  720. }
  721. }
  722. if (i == 10){
  723. for (m=9; m<=12;m++){
  724. afive[i][m] = 'X';
  725. }
  726. for (m=16; m<=17;m++){
  727. afive[i][m] = 'X';
  728. }
  729. for (m=19; m<=20;m++){
  730. afive[i][m] = 'X';
  731. }
  732. for (m=28; m<=29;m++){
  733. afive[i][m] = 'X';
  734. }
  735. for (m=32; m<=34;m++){
  736. afive[i][m] = 'X';
  737. }
  738. for (m=37; m<=38;m++){
  739. afive[i][m] = 'X';
  740. }
  741. }
  742. if (i == 11){
  743. for (m=9; m<=10;m++){
  744. afive[i][m] = 'X';
  745. }
  746. for (m=12; m<=13;m++){
  747. afive[i][m] = 'X';
  748. }
  749. for (m=16; m<=17;m++){
  750. afive[i][m] = 'X';
  751. }
  752. for (m=19; m<=25;m++){
  753. afive[i][m] = 'X';
  754. }
  755. for (m=28; m<=29;m++){
  756. afive[i][m] = 'X';
  757. }
  758. for (m=31; m<=32;m++){
  759. afive[i][m] = 'X';
  760. }
  761. for (m=34; m<=35;m++){
  762. afive[i][m] = 'X';
  763. }
  764. for (m=37; m<=38;m++){
  765. afive[i][m] = 'X';
  766. }
  767. }
  768. if (i == 12){
  769. for (m=9; m<=10;m++){
  770. afive[i][m] = 'X';
  771. }
  772. for (m=14; m<=17;m++){
  773. afive[i][m] = 'X';
  774. }
  775. for (m=19; m<=20;m++){
  776. afive[i][m] = 'X';
  777. }
  778. for (m=29; m<=31;m++){
  779. afive[i][m] = 'X';
  780. }
  781. for (m=35; m<=37;m++){
  782. afive[i][m] = 'X';
  783. }
  784. }
  785. if (i == 13){
  786. for (m=9; m<=10;m++){
  787. afive[i][m] = 'X';
  788. }
  789. for (m=15; m<=17;m++){
  790. afive[i][m] = 'X';
  791. }
  792. for (m=19; m<=25;m++){
  793. afive[i][m] = 'X';
  794. }
  795. for (m=30; m<=31;m++){
  796. afive[i][m] = 'X';
  797. }
  798. for (m=35; m<=36;m++){
  799. afive[i][m] = 'X';
  800. }
  801. }
  802. //YEAR
  803. if (i == 16){
  804. for (m=5; m<=6;m++){
  805. afive[i][m] = 'X';
  806. }
  807. for (m=12; m<=13;m++){
  808. afive[i][m] = 'X';
  809. }
  810. for (m=15; m<=21;m++){
  811. afive[i][m] = 'X';
  812. }
  813. for (m=26; m<=28;m++){
  814. afive[i][m] = 'X';
  815. }
  816. for (m=33; m<=39;m++){
  817. afive[i][m] = 'X';
  818. }
  819. for (m=44; m<=45;m++){
  820. afive[i][m] = 'X';
  821. }
  822. }
  823. if (i == 17){
  824. for (m=6; m<=7;m++){
  825. afive[i][m] = 'X';
  826. }
  827. for (m=11; m<=12;m++){
  828. afive[i][m] = 'X';
  829. }
  830. for (m=15; m<=16;m++){
  831. afive[i][m] = 'X';
  832. }
  833. for (m=25; m<=26;m++){
  834. afive[i][m] = 'X';
  835. }
  836. for (m=28; m<=29;m++){
  837. afive[i][m] = 'X';
  838. }
  839. for (m=33; m<=34;m++){
  840. afive[i][m] = 'X';
  841. }
  842. for (m=39; m<=40;m++){
  843. afive[i][m] = 'X';
  844. }
  845. for (m=44; m<=45;m++){
  846. afive[i][m] = 'X';
  847. }
  848. }
  849. if (i == 18){
  850. for (m=8; m<=10;m++){
  851. afive[i][m] = 'X';
  852. }
  853. for (m=15; m<=21;m++){
  854. afive[i][m] = 'X';
  855. }
  856. for (m=24; m<=25;m++){
  857. afive[i][m] = 'X';
  858. }
  859. for (m=29; m<=30;m++){
  860. afive[i][m] = 'X';
  861. }
  862. for (m=33; m<=39;m++){
  863. afive[i][m] = 'X';
  864. }
  865. for (m=44; m<=45;m++){
  866. afive[i][m] = 'X';
  867. }
  868. }
  869. if (i == 19){
  870. for (m=8; m<=10;m++){
  871. afive[i][m] = 'X';
  872. }
  873. for (m=15; m<=16;m++){
  874. afive[i][m] = 'X';
  875. }
  876. for (m=24; m<=30;m++){
  877. afive[i][m] = 'X';
  878. }
  879. for (m=33; m<=34;m++){
  880. afive[i][m] = 'X';
  881. }
  882. for (m=38; m<=40;m++){
  883. afive[i][m] = 'X';
  884. }
  885. }
  886. if (i == 20){
  887. for (m=8; m<=10;m++){
  888. afive[i][m] = 'X';
  889. }
  890. for (m=15; m<=21;m++){
  891. afive[i][m] = 'X';
  892. }
  893. for (m=23; m<=24;m++){
  894. afive[i][m] = 'X';
  895. }
  896. for (m=30; m<=31;m++){
  897. afive[i][m] = 'X';
  898. }
  899. for (m=33; m<=34;m++){
  900. afive[i][m] = 'X';
  901. }
  902. for (m=39; m<=41;m++){
  903. afive[i][m] = 'X';
  904. }
  905. for (m=44; m<=45;m++){
  906. afive[i][m] = 'X';
  907. }
  908. }
  909. }
  910. for (i=0;i<NYR;i++){
  911. for (j=0;j<NYC;j++){
  912. cout << afive[i][j];
  913. }
  914. void deLay(int);
  915. deLay(SPEED);
  916. cout << endl;
  917. }
  918. }
  919. // main functions
  920. int main(){
  921. yuan();
  922. dan();
  923. kuai();
  924. le();
  925. happynewyear();
  926. cout<< "元旦快乐" << endl << "Happy New Year 2023"<< endl <<"Made by 盖子的盖" << endl<< "2023.1.1" << endl << endl;
  927. }

声明:本文内容由网友自发贡献,不代表【wpsshop博客】立场,版权归原作者所有,本站不承担相应法律责任。如您发现有侵权的内容,请联系我们。转载请注明出处:https://www.wpsshop.cn/w/小丑西瓜9/article/detail/96378
推荐阅读
相关标签
  

闽ICP备14008679号