Advertisement
Guest User

print numbers in digital form

a guest
Jan 27th, 2020
90
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 5.29 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. const short n = 5, m = 3;
  8. char arr[n][m]{};
  9.  
  10. short data = 0;
  11. cout << "Reqemi daxil edin: ";
  12. cin >> data;
  13.  
  14. // not working
  15. /*switch (data)
  16. {
  17. case 0:
  18. {
  19. char arr2[n][m] =
  20. {
  21. {1,1,1},
  22. {1,0,1},
  23. {1,0,1},
  24. {1,0,1},
  25. {1,1,1},
  26. };
  27. for (short i = 0; i < m * n; i++)
  28. {
  29. if (arr2[0][i] == 1)
  30. {
  31. arr[0][i] = 178;
  32. }
  33. else
  34. {
  35. arr[0][i] = 255;
  36. }
  37. }
  38. break;
  39. }
  40. case 1:
  41. {
  42. short one[10] = { 0,1,3,4,6,7,9,10,12,13 };
  43. for (short i = 0; i < m * n; i++)
  44. {
  45. arr[0][i] = 178;
  46. for (short j = 0; j < 10; j++)
  47. {
  48. if (i == one[j])
  49. {
  50. arr[0][i] = 255;
  51. break;
  52. }
  53. }
  54. }
  55. break;
  56. }
  57. case 2:
  58. {
  59. short two[4] = { 3,4,10,11 };
  60. for (short i = 0; i < m * n; i++)
  61. {
  62. arr[0][i] = 178;
  63. for (short j = 0; j < 4; j++)
  64. {
  65. if (i == two[j])
  66. {
  67. arr[0][i] = 255;
  68. break;
  69. }
  70. }
  71. }
  72. break;
  73. }
  74. case 3:
  75. {
  76. short three[4] = { 3,4,9,10 };
  77. for (short i = 0; i < m * n; i++)
  78. {
  79. arr[0][i] = 178;
  80. for (short j = 0; j < 4; j++)
  81. {
  82. if (i == three[j])
  83. {
  84. arr[0][i] = 255;
  85. break;
  86. }
  87. }
  88. }
  89. break;
  90. }
  91. case 4:
  92. {
  93. short four[6] = { 1,4,9,10,12,13 };
  94. for (short i = 0; i < m * n; i++)
  95. {
  96. arr[0][i] = 178;
  97. for (short j = 0; j < 6; j++)
  98. {
  99. if (i == four[j])
  100. {
  101. arr[0][i] = 255;
  102. break;
  103. }
  104. }
  105. }
  106. break;
  107. }
  108. case 5:
  109. {
  110. short five[4] = { 4,5,9,10 };
  111. for (short i = 0; i < m * n; i++)
  112. {
  113. arr[0][i] = 178;
  114. for (short j = 0; j < 4; j++)
  115. {
  116. if (i == five[j])
  117. {
  118. arr[0][i] = 255;
  119. break;
  120. }
  121. }
  122. }
  123. break;
  124. }
  125. case 6:
  126. {
  127. short six[3] = { 4,5,10 };
  128. for (short i = 0; i < m * n; i++)
  129. {
  130. arr[0][i] = 178;
  131. for (short j = 0; j < 3; j++)
  132. {
  133. if (i == six[j])
  134. {
  135. arr[0][i] = 255;
  136. break;
  137. }
  138. }
  139. }
  140. break;
  141. }
  142. case 7:
  143. {
  144. short seven[8] = { 3,4,6,7,9,10,12,13 };
  145. for (short i = 0; i < m * n; i++)
  146. {
  147. arr[0][i] = 178;
  148. for (short j = 0; j < 8; j++)
  149. {
  150. if (i == seven[j])
  151. {
  152. arr[0][i] = 255;
  153. break;
  154. }
  155. }
  156. }
  157. break;
  158. }
  159. case 8:
  160. {
  161. short eight[2] = { 4,10 };
  162. for (short i = 0; i < m * n; i++)
  163. {
  164. arr[0][i] = 178;
  165. for (short j = 0; j < 2; j++)
  166. {
  167. if (i == eight[j])
  168. {
  169. arr[0][i] = 255;
  170. break;
  171. }
  172. }
  173. }
  174. break;
  175. }
  176. case 9:
  177. {
  178. short nine[3] = { 4,9,10 };
  179. for (short i = 0; i < m * n; i++)
  180. {
  181. arr[0][i] = 178;
  182. for (short j = 0; j < 3; j++)
  183. {
  184. if (i == nine[j])
  185. {
  186. arr[0][i] = 255;
  187. break;
  188. }
  189. }
  190. }
  191. break;
  192. }
  193. }
  194. */
  195.  
  196. switch (data)
  197. {
  198. case 0:
  199. {
  200. short three[3] = { 4,7,10 };
  201. for (short i = 0; i < m * n; i++)
  202. {
  203. arr[0][i] = 178;
  204. for (short j = 0; j < 3; j++)
  205. {
  206. if (i == three[j])
  207. {
  208. arr[0][i] = 255;
  209. break;
  210. }
  211. }
  212. }
  213. break;
  214. }
  215. case 1:
  216. {
  217. short one[10] = { 0,1,3,4,6,7,9,10,12,13 };
  218. for (short i = 0; i < m * n; i++)
  219. {
  220. arr[0][i] = 178;
  221. for (short j = 0; j < 10; j++)
  222. {
  223. if (i == one[j])
  224. {
  225. arr[0][i] = 255;
  226. break;
  227. }
  228. }
  229. }
  230. break;
  231. }
  232. case 2:
  233. {
  234. short two[4] = { 3,4,10,11 };
  235. for (short i = 0; i < m * n; i++)
  236. {
  237. arr[0][i] = 178;
  238. for (short j = 0; j < 4; j++)
  239. {
  240. if (i == two[j])
  241. {
  242. arr[0][i] = 255;
  243. break;
  244. }
  245. }
  246. }
  247. break;
  248. }
  249. case 3:
  250. {
  251. short three[4] = { 3,4,9,10 };
  252. for (short i = 0; i < m * n; i++)
  253. {
  254. arr[0][i] = 178;
  255. for (short j = 0; j < 4; j++)
  256. {
  257. if (i == three[j])
  258. {
  259. arr[0][i] = 255;
  260. break;
  261. }
  262. }
  263. }
  264. break;
  265. }
  266. case 4:
  267. {
  268. short four[6] = { 1,4,9,10,12,13 };
  269. for (short i = 0; i < m * n; i++)
  270. {
  271. arr[0][i] = 178;
  272. for (short j = 0; j < 6; j++)
  273. {
  274. if (i == four[j])
  275. {
  276. arr[0][i] = 255;
  277. break;
  278. }
  279. }
  280. }
  281. break;
  282. }
  283. case 5:
  284. {
  285. short five[4] = { 4,5,9,10 };
  286. for (short i = 0; i < m * n; i++)
  287. {
  288. arr[0][i] = 178;
  289. for (short j = 0; j < 4; j++)
  290. {
  291. if (i == five[j])
  292. {
  293. arr[0][i] = 255;
  294. break;
  295. }
  296. }
  297. }
  298. break;
  299. }
  300. case 6:
  301. {
  302. short six[3] = { 4,5,10 };
  303. for (short i = 0; i < m * n; i++)
  304. {
  305. arr[0][i] = 178;
  306. for (short j = 0; j < 3; j++)
  307. {
  308. if (i == six[j])
  309. {
  310. arr[0][i] = 255;
  311. break;
  312. }
  313. }
  314. }
  315. break;
  316. }
  317. case 7:
  318. {
  319. short seven[8] = { 3,4,6,7,9,10,12,13 };
  320. for (short i = 0; i < m * n; i++)
  321. {
  322. arr[0][i] = 178;
  323. for (short j = 0; j < 8; j++)
  324. {
  325. if (i == seven[j])
  326. {
  327. arr[0][i] = 255;
  328. break;
  329. }
  330. }
  331. }
  332. break;
  333. }
  334. case 8:
  335. {
  336. short eight[2] = { 4,10 };
  337. for (short i = 0; i < m * n; i++)
  338. {
  339. arr[0][i] = 178;
  340. for (short j = 0; j < 2; j++)
  341. {
  342. if (i == eight[j])
  343. {
  344. arr[0][i] = 255;
  345. break;
  346. }
  347. }
  348. }
  349. break;
  350. }
  351. case 9:
  352. {
  353. short nine[3] = { 4,9,10 };
  354. for (short i = 0; i < m * n; i++)
  355. {
  356. arr[0][i] = 178;
  357. for (short j = 0; j < 3; j++)
  358. {
  359. if (i == nine[j])
  360. {
  361. arr[0][i] = 255;
  362. break;
  363. }
  364. }
  365. }
  366. break;
  367. }
  368. }
  369.  
  370.  
  371. for (short i = 0; i < n; i++)
  372. {
  373. for (short j = 0; j < m; j++)
  374. {
  375. cout << arr[i][j];
  376. }
  377. cout << endl;
  378. }
  379. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement