0
Your rating: None

CodeChef submission 108893 (C++ 4.0.0-8)

CodeChef submission 108893 (C++ 4.0.0-8) plaintext list. Status: AC, problem HX, contest OCT09. By ron (Surendra), 2009-10-11 14:55:51.
  1. /*	
  2.  
  3. 	SURENDRA KUMAR MEENA	
  4.  
  5. */
  6. #include <vector>
  7. #include <list>
  8. #include <map>
  9. #include <set>
  10. #include <deque>
  11. #include <stack>
  12. #include <bitset>
  13. #include <algorithm>
  14. #include <functional>
  15. #include <numeric>
  16. #include <utility>
  17. #include <queue>
  18. #include <sstream>
  19. #include <iostream>
  20. #include <iomanip>
  21. #include <cstdio>
  22. #include <cmath>
  23. #include <cstring>
  24. #include <cstdlib>
  25. #include <ctime>
  26. using namespace std;
  27. #define R(i,m,n)	for(int i=m;i>=n;i--)
  28. #define FF(i,m,n)	for(int i=m;i<n;i++)
  29. #define F(i,n)	FF(i,0,n)
  30. #define CLR(s,v) memset(s,v,sizeof(s))
  31. #define S(t)	scanf("%d",&t)
  32.  
  33. double a[2010][2010];
  34. double Val[10];
  35. char out[10000000];
  36. char b[2010];
  37. char b2[2010];
  38. char b3[2010];
  39. char b4[2010];
  40. const char T4[3]={'0','1','1'};
  41. char b5[2010];
  42. const char T5[3]={'1','0','1'};
  43. char b6[2010];
  44. const char T6[3]={'1','1','0'};
  45. char b7[2010];
  46. const char T7[5]={'1','0','1','1','0'};
  47. char b8[2010];
  48. const char T8[5]={'1','1','0','1','0'};
  49. char b9[2010];
  50. const char T9[8]={'1','0','1','1','0','1','1','1'};
  51. char b10[2010];
  52. const char T10[6]={'1','0','0','1','1','0'};
  53. char b11[2010];
  54. char b12[2010];
  55. int ot;
  56. char s[10][2010][2010];
  57. int n;
  58. double v1,v2,v3,v4,v5,v6,v7,v8,v9,v10,v11,v12,v13,v14,v15,v16,v17,v18,v19,v20,v21,v22,v23,v24;
  59.  
  60. void Print(int pos){
  61. 	cout<<" *************** OUTPUT "<<pos<<" **********\n";
  62. 	F(i,n){
  63. 		F(j,n)	cout<<s[pos][i][j];
  64. 		cout<<endl;
  65. 	}
  66. 	cout<<" ***************END OF OUTPUT **********\n";
  67. }
  68.  
  69. bool ToBeSet(int pos,int& i,int &j){
  70. 	v1=v2=0;
  71. 	if(i%2){
  72. 		if(s[pos][i-1][j]=='1')					v1+=a[i-1][j]*a[i][j];
  73. 		else									v2+=a[i-1][j]*a[i][j];
  74. 		if(i+1<n){
  75. 			if(s[pos][i+1][j]=='1')				v1+=a[i+1][j]*a[i][j];
  76. 			else								v2+=a[i+1][j]*a[i][j];
  77. 		}
  78. 		if(j+1<n){
  79. 			if(s[pos][i-1][j+1]=='1')			v1+=a[i-1][j+1]*a[i][j];
  80. 			else								v2+=a[i-1][j+1]*a[i][j];
  81. 			if(i+1<n){
  82. 				if(s[pos][i+1][j+1]=='1')		v1+=a[i+1][j+1]*a[i][j];
  83. 				else							v2+=a[i+1][j+1]*a[i][j];
  84. 			}
  85. 		}
  86. 	}
  87. 	else{
  88. 		if(i){
  89. 			if(s[pos][i-1][j]=='1')				v1+=a[i-1][j]*a[i][j];
  90. 			else								v2+=a[i-1][j]*a[i][j];
  91. 			if(j-1>=0){
  92. 				if(s[pos][i-1][j-1]=='1')		v1+=a[i-1][j-1]*a[i][j];
  93. 				else							v2+=a[i-1][j-1]*a[i][j];
  94. 			}
  95. 		}
  96. 		if(i+1<n){
  97. 			if(s[pos][i+1][j]=='1')				v1+=a[i+1][j]*a[i][j];
  98. 			else								v2+=a[i+1][j]*a[i][j];
  99. 			if(j-1>=0){
  100. 				if(s[pos][i+1][j-1]=='1')		v1+=a[i+1][j-1]*a[i][j];
  101. 				else							v2+=a[i+1][j-1]*a[i][j];
  102. 			}
  103. 		}
  104. 	}
  105. 	if(j-1>=0){
  106. 		if(s[pos][i][j-1]=='1')					v1+=a[i][j-1]*a[i][j];
  107. 		else									v2+=a[i][j-1]*a[i][j];
  108. 	}
  109. 	if(j+1<n){
  110. 		if(s[pos][i][j+1]=='1')					v1+=a[i][j+1]*a[i][j];
  111. 		else									v2+=a[i][j+1]*a[i][j];
  112. 	}
  113. 	return (v1>v2?0:1);
  114. }
  115.  
  116. void ToGood(int pos){
  117. 	F(i,n){
  118. 		F(j,n){
  119. 			if(ToBeSet(pos,i,j))	s[pos][i][j]='1';
  120. 			else					s[pos][i][j]='0';
  121. 		}
  122. 	}
  123. }
  124.  
  125. void ToGood2(int pos){
  126. 	R(i,n-1,0){
  127. 		R(j,n-1,0){
  128. 			if(ToBeSet(pos,i,j))	s[pos][i][j]='1';
  129. 			else					s[pos][i][j]='0';
  130. 		}
  131. 	}
  132. }
  133.  
  134. void ToGood3(int pos){
  135. 	F(j,n){
  136. 		F(i,n){
  137. 			if(ToBeSet(pos,i,j))	s[pos][i][j]='1';
  138. 			else					s[pos][i][j]='0';
  139. 		}
  140. 	}
  141. }
  142. double Calc(int pos){
  143. 	double ret=0;
  144. 	F(i,n)F(j,n){
  145. 		if(i%2){
  146. 			if(s[pos][i-1][j]==s[pos][i][j])				ret+=a[i-1][j]*a[i][j];
  147. 			if(j+1<n && s[pos][i-1][j+1]==s[pos][i][j])		ret+=a[i-1][j+1]*a[i][j];
  148. 		}
  149. 		else if(i){
  150. 			if(s[pos][i-1][j]==s[pos][i][j])				ret+=a[i-1][j]*a[i][j];
  151. 			if(j-1>=0 && s[pos][i-1][j-1]==s[pos][i][j])	ret+=a[i-1][j-1]*a[i][j];
  152. 		}
  153. 		if(j-1>=0 && s[pos][i][j-1]==s[pos][i][j])			ret+=a[i][j-1]*a[i][j];
  154. 	}
  155. 	return ret;
  156. }
  157.  
  158. double fn0(){
  159. 	int r;
  160. 	double mn;
  161. 	F(j,n)	s[0][0][j]=((j%2)?'1':'0');
  162. 	FF(i,1,n){
  163. 		v1=v2=v3=v4=v5=v6=v7=v8=v9=v10=v11=v12=v13=v14=v15=v16=v17=v18=v19=v20=v21=v22=v23=v24=0;
  164. 		F(j,n){
  165. 			if(i%2){
  166. 				if(s[0][i-1][j]==b[j])				v1+=a[i-1][j]*a[i][j];
  167. 				else								v2+=a[i-1][j]*a[i][j];
  168. 				if(j+1<n){
  169. 					if(s[0][i-1][j+1]==b[j])		v1+=a[i-1][j+1]*a[i][j];
  170. 					else							v2+=a[i-1][j+1]*a[i][j];
  171. 				}
  172. 			}
  173. 			else{
  174. 				if(s[0][i-1][j]==b[j])				v1+=a[i-1][j]*a[i][j];
  175. 				else								v2+=a[i-1][j]*a[i][j];
  176. 				if(j-1>=0){
  177. 					if(s[0][i-1][j-1]==b[j])		v1+=a[i-1][j-1]*a[i][j];
  178. 					else							v2+=a[i-1][j-1]*a[i][j];
  179. 				}
  180. 			}
  181. 			if(j){
  182. 				if(s[0][i][j-1]==b[j])				v1+=a[i][j-1]*a[i][j];
  183. 				else								v2+=a[i][j-1]*a[i][j];
  184. 			}
  185.  
  186. 			//b2...
  187. 			if(i%2){
  188. 				if(s[0][i-1][j]==b2[j])				v3+=a[i-1][j]*a[i][j];
  189. 				else								v4+=a[i-1][j]*a[i][j];
  190. 				if(j+1<n){
  191. 					if(s[0][i-1][j+1]==b2[j])		v3+=a[i-1][j+1]*a[i][j];
  192. 					else							v4+=a[i-1][j+1]*a[i][j];
  193. 				}
  194. 			}
  195. 			else{
  196. 				if(s[0][i-1][j]==b2[j])				v3+=a[i-1][j]*a[i][j];
  197. 				else								v4+=a[i-1][j]*a[i][j];
  198. 				if(j-1>=0){
  199. 					if(s[0][i-1][j-1]==b2[j])		v3+=a[i-1][j-1]*a[i][j];
  200. 					else							v4+=a[i-1][j-1]*a[i][j];
  201. 				}
  202. 			}
  203. 			if(j){
  204. 				if(s[0][i][j-1]==b2[j])				v3+=a[i][j-1]*a[i][j];
  205. 				else								v4+=a[i][j-1]*a[i][j];
  206. 			}
  207. 		
  208. 			//b3...
  209. 			if(i%2){
  210. 				if(s[0][i-1][j]==b3[j])				v5+=a[i-1][j]*a[i][j];
  211. 				else								v6+=a[i-1][j]*a[i][j];
  212. 				if(j+1<n){
  213. 					if(s[0][i-1][j+1]==b3[j])		v5+=a[i-1][j+1]*a[i][j];
  214. 					else							v6+=a[i-1][j+1]*a[i][j];
  215. 				}
  216. 			}
  217. 			else{
  218. 				if(s[0][i-1][j]==b3[j])				v5+=a[i-1][j]*a[i][j];
  219. 				else								v6+=a[i-1][j]*a[i][j];
  220. 				if(j-1>=0){
  221. 					if(s[0][i-1][j-1]==b3[j])		v5+=a[i-1][j-1]*a[i][j];
  222. 					else							v6+=a[i-1][j-1]*a[i][j];
  223. 				}
  224. 			}
  225. 			if(j){
  226. 				if(s[0][i][j-1]==b3[j])				v5+=a[i][j-1]*a[i][j];
  227. 				else								v6+=a[i][j-1]*a[i][j];
  228. 			}
  229. 		
  230. 			//b4...
  231. 			if(i%2){
  232. 				if(s[0][i-1][j]==b4[j])				v7+=a[i-1][j]*a[i][j];
  233. 				else								v8+=a[i-1][j]*a[i][j];
  234. 				if(j+1<n){
  235. 					if(s[0][i-1][j+1]==b4[j])		v7+=a[i-1][j+1]*a[i][j];
  236. 					else							v8+=a[i-1][j+1]*a[i][j];
  237. 				}
  238. 			}
  239. 			else{
  240. 				if(s[0][i-1][j]==b4[j])				v7+=a[i-1][j]*a[i][j];
  241. 				else								v8+=a[i-1][j]*a[i][j];
  242. 				if(j-1>=0){
  243. 					if(s[0][i-1][j-1]==b4[j])		v7+=a[i-1][j-1]*a[i][j];
  244. 					else							v8+=a[i-1][j-1]*a[i][j];
  245. 				}
  246. 			}
  247. 			if(j){
  248. 				if(s[0][i][j-1]==b4[j])				v7+=a[i][j-1]*a[i][j];
  249. 				else								v8+=a[i][j-1]*a[i][j];
  250. 			}
  251.  
  252. 			//b5...
  253. 			if(i%2){
  254. 				if(s[0][i-1][j]==b5[j])				v9+=a[i-1][j]*a[i][j];
  255. 				else								v10+=a[i-1][j]*a[i][j];
  256. 				if(j+1<n){
  257. 					if(s[0][i-1][j+1]==b5[j])		v9+=a[i-1][j+1]*a[i][j];
  258. 					else							v10+=a[i-1][j+1]*a[i][j];
  259. 				}
  260. 			}
  261. 			else{
  262. 				if(s[0][i-1][j]==b5[j])				v9+=a[i-1][j]*a[i][j];
  263. 				else								v10+=a[i-1][j]*a[i][j];
  264. 				if(j-1>=0){
  265. 					if(s[0][i-1][j-1]==b5[j])		v9+=a[i-1][j-1]*a[i][j];
  266. 					else							v10+=a[i-1][j-1]*a[i][j];
  267. 				}
  268. 			}
  269. 			if(j){
  270. 				if(s[0][i][j-1]==b5[j])				v9+=a[i][j-1]*a[i][j];
  271. 				else								v10+=a[i][j-1]*a[i][j];
  272. 			}
  273.  
  274. 			//b6...
  275. 			if(i%2){
  276. 				if(s[0][i-1][j]==b6[j])				v11+=a[i-1][j]*a[i][j];
  277. 				else								v12+=a[i-1][j]*a[i][j];
  278. 				if(j+1<n){
  279. 					if(s[0][i-1][j+1]==b6[j])		v11+=a[i-1][j+1]*a[i][j];
  280. 					else							v12+=a[i-1][j+1]*a[i][j];
  281. 				}
  282. 			}
  283. 			else{
  284. 				if(s[0][i-1][j]==b6[j])				v11+=a[i-1][j]*a[i][j];
  285. 				else								v12+=a[i-1][j]*a[i][j];
  286. 				if(j-1>=0){
  287. 					if(s[0][i-1][j-1]==b6[j])		v11+=a[i-1][j-1]*a[i][j];
  288. 					else							v12+=a[i-1][j-1]*a[i][j];
  289. 				}
  290. 			}
  291. 			if(j){
  292. 				if(s[0][i][j-1]==b6[j])				v11+=a[i][j-1]*a[i][j];
  293. 				else								v12+=a[i][j-1]*a[i][j];
  294. 			}
  295.  
  296.  
  297. 			//b7...
  298. 			if(i%2){
  299. 				if(s[0][i-1][j]==b7[j])				v13+=a[i-1][j]*a[i][j];
  300. 				else								v14+=a[i-1][j]*a[i][j];
  301. 				if(j+1<n){
  302. 					if(s[0][i-1][j+1]==b7[j])		v13+=a[i-1][j+1]*a[i][j];
  303. 					else							v14+=a[i-1][j+1]*a[i][j];
  304. 				}
  305. 			}
  306. 			else{
  307. 				if(s[0][i-1][j]==b7[j])				v13+=a[i-1][j]*a[i][j];
  308. 				else								v14+=a[i-1][j]*a[i][j];
  309. 				if(j-1>=0){
  310. 					if(s[0][i-1][j-1]==b7[j])		v13+=a[i-1][j-1]*a[i][j];
  311. 					else							v14+=a[i-1][j-1]*a[i][j];
  312. 				}
  313. 			}
  314. 			if(j){
  315. 				if(s[0][i][j-1]==b7[j])				v13+=a[i][j-1]*a[i][j];
  316. 				else								v14+=a[i][j-1]*a[i][j];
  317. 			}
  318.  
  319.  
  320. 			//b8...
  321. 			if(i%2){
  322. 				if(s[0][i-1][j]==b8[j])				v15+=a[i-1][j]*a[i][j];
  323. 				else								v16+=a[i-1][j]*a[i][j];
  324. 				if(j+1<n){
  325. 					if(s[0][i-1][j+1]==b8[j])		v15+=a[i-1][j+1]*a[i][j];
  326. 					else							v16+=a[i-1][j+1]*a[i][j];
  327. 				}
  328. 			}
  329. 			else{
  330. 				if(s[0][i-1][j]==b8[j])				v15+=a[i-1][j]*a[i][j];
  331. 				else								v16+=a[i-1][j]*a[i][j];
  332. 				if(j-1>=0){
  333. 					if(s[0][i-1][j-1]==b8[j])		v15+=a[i-1][j-1]*a[i][j];
  334. 					else							v16+=a[i-1][j-1]*a[i][j];
  335. 				}
  336. 			}
  337. 			if(j){
  338. 				if(s[0][i][j-1]==b8[j])				v15+=a[i][j-1]*a[i][j];
  339. 				else								v16+=a[i][j-1]*a[i][j];
  340. 			}
  341.  
  342.  
  343. 			//b9...
  344. 			if(i%2){
  345. 				if(s[0][i-1][j]==b9[j])				v17+=a[i-1][j]*a[i][j];
  346. 				else								v18+=a[i-1][j]*a[i][j];
  347. 				if(j+1<n){
  348. 					if(s[0][i-1][j+1]==b9[j])		v17+=a[i-1][j+1]*a[i][j];
  349. 					else							v18+=a[i-1][j+1]*a[i][j];
  350. 				}
  351. 			}
  352. 			else{
  353. 				if(s[0][i-1][j]==b9[j])				v17+=a[i-1][j]*a[i][j];
  354. 				else								v18+=a[i-1][j]*a[i][j];
  355. 				if(j-1>=0){
  356. 					if(s[0][i-1][j-1]==b9[j])		v17+=a[i-1][j-1]*a[i][j];
  357. 					else							v18+=a[i-1][j-1]*a[i][j];
  358. 				}
  359. 			}
  360. 			if(j){
  361. 				if(s[0][i][j-1]==b9[j])				v17+=a[i][j-1]*a[i][j];
  362. 				else								v18+=a[i][j-1]*a[i][j];
  363. 			}
  364.  
  365. 			//b10...
  366. 			if(i%2){
  367. 				if(s[0][i-1][j]==b10[j])			v19+=a[i-1][j]*a[i][j];
  368. 				else								v20+=a[i-1][j]*a[i][j];
  369. 				if(j+1<n){
  370. 					if(s[0][i-1][j+1]==b10[j])		v19+=a[i-1][j+1]*a[i][j];
  371. 					else							v20+=a[i-1][j+1]*a[i][j];
  372. 				}
  373. 			}
  374. 			else{
  375. 				if(s[0][i-1][j]==b10[j])			v19+=a[i-1][j]*a[i][j];
  376. 				else								v20+=a[i-1][j]*a[i][j];
  377. 				if(j-1>=0){
  378. 					if(s[0][i-1][j-1]==b10[j])		v19+=a[i-1][j-1]*a[i][j];
  379. 					else							v20+=a[i-1][j-1]*a[i][j];
  380. 				}
  381. 			}
  382. 			if(j){
  383. 				if(s[0][i][j-1]==b10[j])			v19+=a[i][j-1]*a[i][j];
  384. 				else								v20+=a[i][j-1]*a[i][j];
  385. 			}
  386.  
  387.  
  388. 			//b11...
  389. 			if(i%2){
  390. 				if(s[0][i-1][j]==b11[j])			v21+=a[i-1][j]*a[i][j];
  391. 				else								v22+=a[i-1][j]*a[i][j];
  392. 				if(j+1<n){
  393. 					if(s[0][i-1][j+1]==b11[j])		v21+=a[i-1][j+1]*a[i][j];
  394. 					else							v22+=a[i-1][j+1]*a[i][j];
  395. 				}
  396. 			}
  397. 			else{
  398. 				if(s[0][i-1][j]==b11[j])			v21+=a[i-1][j]*a[i][j];
  399. 				else								v22+=a[i-1][j]*a[i][j];
  400. 				if(j-1>=0){
  401. 					if(s[0][i-1][j-1]==b11[j])		v21+=a[i-1][j-1]*a[i][j];
  402. 					else							v22+=a[i-1][j-1]*a[i][j];
  403. 				}
  404. 			}
  405. 			if(j){
  406. 				if(s[0][i][j-1]==b11[j])			v21+=a[i][j-1]*a[i][j];
  407. 				else								v22+=a[i][j-1]*a[i][j];
  408. 			}
  409.  
  410. 			//b12...
  411. 			if(i%2){
  412. 				if(s[0][i-1][j]==b12[j])			v23+=a[i-1][j]*a[i][j];
  413. 				else								v24+=a[i-1][j]*a[i][j];
  414. 				if(j+1<n){
  415. 					if(s[0][i-1][j+1]==b12[j])		v23+=a[i-1][j+1]*a[i][j];
  416. 					else							v24+=a[i-1][j+1]*a[i][j];
  417. 				}
  418. 			}
  419. 			else{
  420. 				if(s[0][i-1][j]==b12[j])			v23+=a[i-1][j]*a[i][j];
  421. 				else								v24+=a[i-1][j]*a[i][j];
  422. 				if(j-1>=0){
  423. 					if(s[0][i-1][j-1]==b12[j])		v23+=a[i-1][j-1]*a[i][j];
  424. 					else							v24+=a[i-1][j-1]*a[i][j];
  425. 				}
  426. 			}
  427. 			if(j){
  428. 				if(s[0][i][j-1]==b12[j])			v23+=a[i][j-1]*a[i][j];
  429. 				else								v24+=a[i][j-1]*a[i][j];
  430. 			}
  431. 		}
  432.  
  433.  
  434. 		r=1;
  435. 		//b...
  436. 		mn=v1;
  437. 		if(v2<mn){	mn=v2; r=2; }
  438. 		//b2...
  439. 		if(v3<mn){	mn=v3; r=3; }
  440. 		if(v4<mn){	mn=v4; r=4; }
  441. 		//b3...
  442. 		if(v5<mn){	mn=v5; r=5; }
  443. 		if(v6<mn){	mn=v6; r=6; }
  444. 		//b4...
  445. 		if(v7<mn){	mn=v7; r=7; }
  446. 		if(v8<mn){	mn=v8; r=8; }
  447. 		//b5...
  448. 		if(v9<mn){	mn=v9; r=9; }
  449. 		if(v10<mn){	mn=v10; r=10; }
  450. 		//b6...
  451. 		if(v11<mn){	mn=v11; r=11; }
  452. 		if(v12<mn){	mn=v12; r=12; }
  453. 		//b7...
  454. 		if(v13<mn){	mn=v13; r=13; }
  455. 		if(v14<mn){	mn=v14; r=14; }
  456. 		//b8...
  457. 		if(v15<mn){	mn=v15; r=15; }
  458. 		if(v16<mn){	mn=v16; r=16; }
  459. /*		//b9...
  460. 		if(v17<mn){	mn=v17; r=17; }
  461. 		if(v18<mn){	mn=v18; r=18; }*/
  462. 		//b10...
  463. 		if(v19<mn){	mn=v19; r=19; }
  464. 		if(v20<mn){	mn=v20; r=20; }
  465. 		//b11...
  466. 		if(v21<mn){	mn=v21; r=21; }
  467. 		if(v22<mn){	mn=v22; r=22; }
  468. 		//b12...
  469. 		if(v23<mn){	mn=v23; r=23; }
  470. 		if(v24<mn){	mn=v24; r=24; }
  471. 		
  472. 		//b...
  473. 		if(r==1)		F(j,n)	s[0][i][j]=b[j];
  474. 		else if(r==2)	F(j,n)	s[0][i][j]=(b[j]=='1'?'0':'1');
  475. 		//b2...
  476. 		else if(r==3)	F(j,n)	s[0][i][j]=b2[j];
  477. 		else if(r==4)	F(j,n)	s[0][i][j]=(b2[j]=='1'?'0':'1');
  478. 		//b3...
  479. 		else if(r==5)	F(j,n)	s[0][i][j]=b3[j];
  480. 		else if(r==6)	F(j,n)	s[0][i][j]=(b3[j]=='1'?'0':'1');
  481. //		else			F(j,n)	s[0][i][j]=(b3[j]=='1'?'0':'1');
  482. 		//b4...
  483. 		else if(r==7)	F(j,n)	s[0][i][j]=b4[j];
  484. 		else if(r==8)	F(j,n)	s[0][i][j]=(b4[j]=='1'?'0':'1');
  485. //		else			F(j,n)	s[0][i][j]=(b4[j]=='1'?'0':'1');
  486. 		//b5...
  487. 		else if(r==9)	F(j,n)	s[0][i][j]=b5[j];
  488. 		else if(r==10)	F(j,n)	s[0][i][j]=(b5[j]=='1'?'0':'1');
  489. 		//b6...
  490. 		else if(r==11)	F(j,n)	s[0][i][j]=b6[j];
  491. 		else if(r==12)	F(j,n)	s[0][i][j]=(b6[j]=='1'?'0':'1');
  492. 		//b7...
  493. 		else if(r==13)	F(j,n)	s[0][i][j]=b7[j];
  494. 		else if(r==14)	F(j,n)	s[0][i][j]=(b7[j]=='1'?'0':'1');
  495. 		//b8...
  496. 		else if(r==15)	F(j,n)	s[0][i][j]=b8[j];
  497. 		else if(r==16)	F(j,n)	s[0][i][j]=(b8[j]=='1'?'0':'1');
  498. /*		//b9...
  499. 		else if(r==17)	F(j,n)	s[0][i][j]=b9[j];
  500. 		else if(r==18)	F(j,n)	s[0][i][j]=(b9[j]=='1'?'0':'1');*/
  501. 		//b10...
  502. 		else if(r==19)	F(j,n)	s[0][i][j]=b10[j];
  503. 		else if(r==20)	F(j,n)	s[0][i][j]=(b10[j]=='1'?'0':'1');
  504. 		//b11...
  505. 		else if(r==21)	F(j,n)	s[0][i][j]=b11[j];
  506. 		else if(r==22)	F(j,n)	s[0][i][j]=(b11[j]=='1'?'0':'1');
  507. 		//b12...
  508. 		else if(r==23)	F(j,n)	s[0][i][j]=b12[j];
  509. 		else			F(j,n)	s[0][i][j]=(b12[j]=='1'?'0':'1');
  510. 	}
  511. 	F(i,3)		ToGood(0);
  512. 	if(n<1600)	ToGood(0);
  513. 	if(n<1200)	ToGood(0);
  514. 	return 0;
  515. }
  516.  
  517. double fn1(){
  518. 	F(i,n)F(j,n){
  519. 		if(i%2==0){
  520. 			if(j%2==0)	s[1][i][j]='1';
  521. 			else		s[1][i][j]='0';
  522. 		}
  523. 		else			s[1][i][j]='1';
  524. 	}
  525. 	F(i,4)			ToGood2(1);
  526. 	if(n<1600)		ToGood2(1);
  527. 	//if(n<1200)		
  528. 	return 0;
  529. //	return Calc(1);
  530. }
  531.  
  532.  
  533. double fn2(){
  534. 	F(i,n)F(j,n){
  535. 		if((i+j)%2)		s[2][i][j]='1';
  536. 		else			s[2][i][j]='0';
  537. 	}
  538. 	F(i,4)			ToGood(2);
  539. 	if(n<1200)		ToGood(2);
  540. 	return 0;
  541. //	return Calc(2);
  542. }
  543.  
  544. double fn3(){
  545. 	F(i,n)F(j,n)	s[3][i][j]='1';
  546. 	ToGood2(3);
  547. 	ToGood(3);
  548. 	ToGood2(3);
  549. 	ToGood(3);
  550. 	
  551. 	if(n<1600)		ToGood2(3);
  552. 	return 0;
  553. //	return Calc(3);
  554. }
  555.  
  556. double fn(int k){
  557. 	switch(k){
  558. 		case 0: return fn0();
  559. 		case 1: return fn1();
  560. 		case 2: return fn2();
  561. 		case 3: return fn3();
  562. //		case 4: return fn4();
  563. 	}
  564. 	return 0;
  565. }
  566.  
  567. void Prep(){
  568. 	int kk=0;
  569. 	F(j,n){
  570. 		if(j%2){
  571. 			b[j]='1';
  572. 			b3[j]=b3[j+1]=b2[j];
  573. 		}
  574. 		else{
  575. 			if(kk)	b2[j]=b2[j+1]='1';
  576. 			else	b2[j]=b2[j+1]='0';
  577. 			kk=1-kk;
  578. 			b[j]='0';
  579. 		}
  580. 		b4[j]=T4[j%3];
  581. 		b5[j]=T5[j%3];
  582. 		b6[j]=T6[j%3];
  583. 		b7[j]=T7[j%5];
  584. 		b8[j]=T8[j%5];
  585. 		b9[j]=T9[j%8];
  586. 		b10[j]=T10[j%6];
  587. 		b11[j]=T10[(j+1)%6];
  588. 		b12[j]=T10[(j+2)%6];
  589. 	}
  590. 	b3[0]=b3[3];
  591. }
  592.  
  593. int main(){
  594. 	S(n);
  595. 	F(i,n)F(j,n)	scanf("%lf",&a[i][j]);
  596. 	Prep();
  597. 	double mn=1e9,k;
  598. 	int pos=0;
  599. 	F(i,1){
  600. 		k=fn(i);
  601. 		if(k<mn){
  602. 			mn=k;
  603. 			pos=i;
  604. 		}
  605. 	}
  606. 	ot=0;
  607. 	F(i,n){
  608. 		F(j,n){
  609. 			out[ot]=s[pos][i][j];
  610. 			out[ot+1]=' ';
  611. 			ot+=2;
  612. 		}
  613. 		out[ot-1]='\n';
  614. 	}
  615. 	out[ot-1]='\0';
  616. 	puts(out);
  617. 	return 0;
  618. }
  619.

Comments