API tools faq
paste
Guest User

Untitled

a guest
May 21st, 2018
85
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.71 KB | None | 0 0
raw download clone embed print report
  1. #include <iostream>
  2. /* 1 2 3
  3. 4 5 6
  4. 7 8 9
  5. 1=2\4 2=1\5\3 3=2\6 4=1\5\7 5=2\4\6\8 6=3\5\9 7=4\8 8=5\7\9 9=6\8
  6. */
  7. int main(int argc, char** argv)
  8. {
  9. int T,num1,num2,num3,pos[8],inpos[8],posn=0,inposn=0,haspt=0;
  10. scanf("%d",&T);
  11. for(int i=1;i<=T;i++)
  12. {
  13. int posn=0,inposn=0,haspt=0;
  14. if(i>1)
  15. {
  16. printf("\n");
  17. }
  18. scanf("%d %d %d",&num1,&num2,&num3);
  19. switch(num1)
  20. {
  21. case 1:
  22. pos[posn]=2;
  23. posn++;
  24. pos[posn]=4;
  25. posn++;
  26. break;
  27. case 2:
  28. pos[posn]=1;
  29. posn++;
  30. pos[posn]=3;
  31. posn++;
  32. pos[posn]=5;
  33. posn++;
  34. break;
  35. case 3:
  36. pos[posn]=2;
  37. posn++;
  38. pos[posn]=6;
  39. posn++;
  40. break;
  41. case 4:
  42. pos[posn]=1;
  43. posn++;
  44. pos[posn]=5;
  45. posn++;
  46. pos[posn]=7;
  47. posn++;
  48. break;
  49. case 5:
  50. pos[posn]=2;
  51. posn++;
  52. pos[posn]=4;
  53. posn++;
  54. pos[posn]=6;
  55. posn++;
  56. pos[posn]=8;
  57. posn++;
  58. break;
  59. case 6:
  60. pos[posn]=3;
  61. posn++;
  62. pos[posn]=5;
  63. posn++;
  64. pos[posn]=9;
  65. posn++;
  66. break;
  67. case 7:
  68. pos[posn]=4;
  69. posn++;
  70. pos[posn]=8;
  71. posn++;
  72. break;
  73. case 8:
  74. pos[posn]=5;
  75. posn++;
  76. pos[posn]=7;
  77. posn++;
  78. pos[posn]=9;
  79. posn++;
  80. break;
  81. case 9:
  82. pos[posn]=6;
  83. posn++;
  84. pos[posn]=8;
  85. posn++;
  86. break;
  87. }
  88. switch(num2)
  89. {
  90. case 1:
  91. inpos[inposn]=2;
  92. inposn++;
  93. inpos[inposn]=4;
  94. inposn++;
  95. break;
  96. case 2:
  97. inpos[inposn]=1;
  98. inposn++;
  99. inpos[inposn]=3;
  100. inposn++;
  101. inpos[inposn]=5;
  102. inposn++;
  103. break;
  104. case 3:
  105. inpos[inposn]=2;
  106. inposn++;
  107. inpos[inposn]=6;
  108. inposn++;
  109. break;
  110. case 4:
  111. inpos[inposn]=1;
  112. inposn++;
  113. inpos[inposn]=5;
  114. inposn++;
  115. inpos[inposn]=7;
  116. inposn++;
  117. break;
  118. case 5:
  119. inpos[inposn]=2;
  120. inposn++;
  121. inpos[inposn]=4;
  122. inposn++;
  123. inpos[inposn]=6;
  124. inposn++;
  125. inpos[inposn]=8;
  126. inposn++;
  127. break;
  128. case 6:
  129. inpos[inposn]=3;
  130. inposn++;
  131. inpos[inposn]=5;
  132. inposn++;
  133. inpos[inposn]=9;
  134. inposn++;
  135. break;
  136. case 7:
  137. inpos[inposn]=4;
  138. inposn++;
  139. inpos[inposn]=8;
  140. inposn++;
  141. break;
  142. case 8:
  143. inpos[inposn]=5;
  144. inposn++;
  145. inpos[inposn]=7;
  146. inposn++;
  147. inpos[inposn]=9;
  148. inposn++;
  149. break;
  150. case 9:
  151. inpos[inposn]=6;
  152. inposn++;
  153. inpos[inposn]=8;
  154. inposn++;
  155. break;
  156. }
  157. switch(num3)
  158. {
  159. case 1:
  160. inpos[inposn]=2;
  161. inposn++;
  162. inpos[inposn]=4;
  163. inposn++;
  164. break;
  165. case 2:
  166. inpos[inposn]=1;
  167. inposn++;
  168. inpos[inposn]=3;
  169. inposn++;
  170. inpos[inposn]=5;
  171. inposn++;
  172. break;
  173. case 3:
  174. inpos[inposn]=2;
  175. inposn++;
  176. inpos[inposn]=6;
  177. inposn++;
  178. break;
  179. case 4:
  180. inpos[inposn]=1;
  181. inposn++;
  182. inpos[inposn]=5;
  183. inposn++;
  184. inpos[inposn]=7;
  185. inposn++;
  186. break;
  187. case 5:
  188. inpos[inposn]=2;
  189. inposn++;
  190. inpos[inposn]=4;
  191. inposn++;
  192. inpos[inposn]=6;
  193. inposn++;
  194. inpos[inposn]=8;
  195. inposn++;
  196. break;
  197. case 6:
  198. inpos[inposn]=3;
  199. inposn++;
  200. inpos[inposn]=5;
  201. inposn++;
  202. inpos[inposn]=9;
  203. inposn++;
  204. break;
  205. case 7:
  206. inpos[inposn]=4;
  207. inposn++;
  208. inpos[inposn]=8;
  209. inposn++;
  210. break;
  211. case 8:
  212. inpos[inposn]=5;
  213. inposn++;
  214. inpos[inposn]=7;
  215. inposn++;
  216. inpos[inposn]=9;
  217. inposn++;
  218. break;
  219. case 9:
  220. inpos[inposn]=6;
  221. inposn++;
  222. inpos[inposn]=8;
  223. inposn++;
  224. break;
  225. }
  226. for(int i=0;i<=posn-1;i++)
  227. {
  228. for(int j=0;j<=inposn-1;j++)
  229. {
  230. if(pos[i]==inpos[j])
  231. {
  232. pos[i]=0;
  233. inpos[j]=0;
  234. }
  235. }
  236. }
  237. for(int i=0;i<=posn-1;i++)
  238. {
  239. for(int j=0;j<=inposn-1;j++)
  240. {
  241. if((pos[i]!=inpos[j])&&(pos[i]!=0))
  242. {
  243. printf("%d ",pos[i]);
  244. haspt++;
  245. pos[i]=0;
  246. }
  247. }
  248. }
  249. if(haspt==0)
  250. {
  251. printf("Empty");
  252. }
  253. }
  254.  
  255. return 0;
  256. }
Add Comment
Please, Sign In to add comment
Public Pastes
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!