fork download
copy 
  1. import java.io.*;
  2. import java.text.DecimalFormat;
  3. import java.util.*;
  4. public class Main{
  5. 	static boolean gameOver;
  6. 	static boolean firstTurn ;
  7. 	public static void main(String[] args) throws Throwable {
  8. 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  9. 		PrintWriter out = new PrintWriter(System.out);
  10. 		while(true)
  11. 		{
  12. 			String xx = br.readLine();
  13. 			if(xx.charAt(0)=='#')
  14. 				break;
  15. 			Deque<String> nonD = new LinkedList<String>();
  16. 			Deque<String> D = new LinkedList<String>();
  17. 			StringTokenizer st = new StringTokenizer(xx);
  18. 			boolean lastD = true;
  19. 			for (int i = 0; i < 13; i++) {
  20. 				if(lastD)
  21. 					nonD.add(st.nextToken());
  22. 				else
  23. 					D.add(st.nextToken());
  24. 				lastD = !lastD;
  25. 			}
  26. 			for (int i = 0; i < 3; i++) {
  27.  
  28. 				st = new StringTokenizer(br.readLine());
  29. 				for (int j = 0; j < 13; j++) 
  30. 				{
  31. 					if(lastD)
  32. 						nonD.add(st.nextToken());
  33. 					else
  34. 						D.add(st.nextToken());
  35. 					lastD = !lastD;
  36. 				}
  37. 			}
  38. 			Deque<String> heap = new LinkedList<String>();
  39. 			gameOver = false;
  40. 			firstTurn = true;
  41. 			boolean winner = true;
  42. 			while(true)
  43. 			{				
  44. 				if(firstTurn)
  45. 				{
  46. 					if(nonD.isEmpty() )
  47. 					{
  48. 						winner = false;
  49. 						break;
  50. 					}
  51. 					if(gameOver)
  52. 					{
  53. 						if(nonD.isEmpty())
  54. 							winner = false;
  55. 						else
  56. 							winner = true;
  57.  
  58. 						break;
  59. 					}
  60. 					String card = nonD.pollLast();
  61. 					heap.add(card);
  62. 					firstTurn = false;
  63. 					switch(card.charAt(1))
  64. 					{
  65. 					case 'A':
  66. 						firstTurn = !firstTurn;
  67. 						simulate(D, nonD, heap, 4);
  68. 						break;
  69. 					case 'K':
  70. 						firstTurn = !firstTurn;
  71. 						simulate(D, nonD, heap, 3);
  72. 						break;
  73. 					case 'Q':
  74. 						firstTurn = !firstTurn;
  75. 						simulate(D, nonD, heap, 2);
  76. 						break;
  77. 					case 'J':
  78. 						firstTurn = !firstTurn;
  79. 						simulate(D, nonD, heap, 1);
  80. 						break;
  81. 					default:
  82. 						break;
  83. 					}
  84. 				}
  85. 				if(!firstTurn)
  86. 				{
  87. 					if(D.isEmpty() )
  88. 					{
  89. 						winner = true;
  90. 						break;
  91. 					}
  92. 					if(gameOver)
  93. 					{
  94. 						if(nonD.isEmpty())
  95. 							winner = false;
  96. 						else
  97. 							winner = true;
  98.  
  99. 						break;
  100. 					}
  101. 					firstTurn = true;
  102. 					String card = D.pollLast();
  103. 					heap.add(card);
  104. 					switch(card.charAt(1))
  105. 					{
  106. 					case 'A':
  107. 						firstTurn = !firstTurn;
  108. 						simulate(nonD, D, heap, 4);
  109. 						break;
  110. 					case 'K':
  111. 						firstTurn = !firstTurn;
  112. 						simulate(nonD, D, heap, 3);
  113. 						break;
  114. 					case 'Q':
  115. 						firstTurn = !firstTurn;
  116. 						simulate(nonD, D, heap, 2);
  117. 						break;
  118. 					case 'J':
  119. 						firstTurn = !firstTurn;
  120. 						simulate(nonD, D, heap, 1);
  121. 						break;
  122. 					default:
  123. 						break;
  124. 					}
  125. 				}
  126. 			}
  127. 			if(!winner)
  128. 			{
  129. 				String ans = (D.size()<10)? " "+D.size() : D.size()+""; 
  130. 				out.append("1 "+ans+"\n");
  131. 				//out.flush();
  132. 			}
  133. 			else
  134. 			{
  135. 				String ans = (nonD.size()<10)? " "+nonD.size() :nonD.size()+""; 
  136. 				out.append("2 "+ans+"\n");
  137. 				//out.flush();
  138. 			}
  139. 		}
  140. 		out.flush();
  141. 	}
  142. 	public static void simulate(Deque<String> first ,Deque<String> sec,Deque<String> heap,int counter)
  143. 	{
  144.  
  145. 		while(counter-->0)
  146. 		{
  147. 			if(first.isEmpty())
  148. 			{
  149. 				gameOver = true;
  150. 				return;
  151. 			}
  152. 			String card = first.pollLast();
  153. 			heap.add(card);
  154. 			switch (card.charAt(1)) {
  155. 			case 'A':
  156. 				firstTurn = !firstTurn;
  157. 				simulate(sec, first, heap, 4);
  158. 				return;
  159. 			case 'K':
  160. 				firstTurn = !firstTurn;
  161. 				simulate(sec, first, heap, 3);
  162. 				return;
  163. 			case 'Q':
  164. 				firstTurn = !firstTurn;
  165. 				simulate(sec, first, heap, 2);
  166. 				return;
  167. 			case 'J':
  168. 				firstTurn = !firstTurn;
  169. 				simulate(sec, first, heap, 1);
  170. 				return;
  171. 			default:
  172. 				break;
  173. 			}
  174. 		}
  175. 		takeHeap(sec, heap);
  176.  
  177. 	}
  178. 	public static void takeHeap(Deque<String>player,Deque<String>heap)
  179. 	{
  180. 		while(!heap.isEmpty())
  181. 		{
  182. 			player.offerFirst(heap.pollFirst());
  183. 		}
  184. 	}
  185. }
  186.  
Success #stdin #stdout 0.04s 711168KB
comments (?)
stdin
copy 
HA H3 H4 CA SK S5 C5 S6 C4 D5 H7 HJ HQ
D4 D7 SJ DT H6 S9 CT HK C8 C9 D6 CJ C6
S8 D8 C2 S2 S3 C7 H5 DJ S4 DQ DK D9 D3
H9 DA SA CK CQ C3 HT SQ H8 S7 ST H2 D2
#
stdout
copy 
1 44
https://ideone.com/LJWUWw
language:
Java (HotSpot 12)
created:
8 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!