Critical – Live with passion

10102

Asif NaeemNovember 28, 2015

Critical t get the question but easy to solve. Problem asks to find the maximum length of minimum distance.

#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <cmath>
#include <cstring>
#include <fstream>
#include <string>
#include <algorithm>

#define INF 100000000
#define ll long long

using namespace std;

struct Cord{
	int x,y;
};
int M;
char gr[1010][1010];
char s[1010][1010];
vector<Cord> Ones,Threes;

int main()
{
	Cord tmp;
	int MX,dist,MN;
	while(scanf("%d",&M)!=EOF)
	{
		getchar();
		Threes.clear();
		Ones.clear();
		for(int i=0;i<M;i++)
		{
			scanf("%s",s[i]);
			for(int j=0;j<strlen(s[i]);j++)
			{
				if(s[i][j]=='1')
				{
					tmp.x = i;
					tmp.y = j;
					Ones.push_back(tmp);
				}
				if(s[i][j]=='3')
				{
					tmp.x = i;
					tmp.y = j;
					Threes.push_back(tmp);
				}
			}
		}
		MX = -1;
		for(int i=0;i<Ones.size();i++)
		{
			MN = INF;
			for(int j=0;j<Threes.size();j++)
			{
				dist = abs(Ones[i].x-Threes[j].x)+abs(Ones[i].y-Threes[j].y);
				if(dist<MN)
				MN =dist;
			}
			if(MX<MN)
			MX = MN;
		}
		printf("%d\n",MX);
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <vector>

#include <stack>

#include <cmath>

#include <cstring>

#include <fstream>

#include <string>

#include <algorithm>

#define INF 100000000

#define ll long long

using namespace std;

struct Cord{

int x,y;

};

int M;

char gr[1010][1010];

char s[1010][1010];

vector<Cord> Ones,Threes;

int main()

{

Cord tmp;

int MX,dist,MN;

while(scanf("%d",&M)!=EOF)

{

getchar();

Threes.clear();

Ones.clear();

for(int i=0;i<M;i++)

{

scanf("%s",s[i]);

for(int j=0;j<strlen(s[i]);j++)

{

if(s[i][j]=='1')

{

tmp.x = i;

tmp.y = j;

Ones.push_back(tmp);

}

if(s[i][j]=='3')

{

tmp.x = i;

tmp.y = j;

Threes.push_back(tmp);

}

MX = -1;

for(int i=0;i<Ones.size();i++)

{

MN = INF;

for(int j=0;j<Threes.size();j++)

{

dist = abs(Ones[i].x-Threes[j].x)+abs(Ones[i].y-Threes[j].y);

if(dist<MN)

MN =dist;

}

if(MX<MN)

MX = MN;

}

printf("%d\n",MX);

}

return 0;

}

496

Asif NaeemJuly 22, 2015

Using set::set_intersect(params) the problem can be solved.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#include <algorithm>
#include <sstream>

#define INF 1000000
using namespace std;

set<int> Set1,Set2,inn;
int main()
{
	int n;
	string str;
	stringstream ss;
	while(getline(cin,str))
	{
		Set1.clear();
		Set2.clear();
		inn.clear();

		ss.clear();
		ss<<str;
		while(ss>>n)
		{
			Set1.insert(n);
		}

		getline(cin,str);
		ss.clear();
		ss<<str;
		while(ss>>n)
		{
			Set2.insert(n);
		}

		set_intersection(Set1.begin(),Set1.end(),Set2.begin(),Set2.end(),insert_iterator< set<int> >(inn,inn.begin()));

		if(Set1==Set2)
		cout<<"A equals B\n";
		else if(Set2==inn)
		cout<<"B is a proper subset of A\n";
		else if(Set1==inn)
		cout<<"A is a proper subset of B\n";
		else if(inn.size()==0)
		cout<<"A and B are disjoint\n";
		else
		cout<<"I'm confused!\n";
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <set>

#include <algorithm>

#include <sstream>

#define INF 1000000

using namespace std;

set<int> Set1,Set2,inn;

int main()

{

int n;

string str;

stringstream ss;

while(getline(cin,str))

{

Set1.clear();

Set2.clear();

inn.clear();

ss.clear();

ss<<str;

while(ss>>n)

{

Set1.insert(n);

}

getline(cin,str);

ss.clear();

ss<<str;

while(ss>>n)

{

Set2.insert(n);

}

set_intersection(Set1.begin(),Set1.end(),Set2.begin(),Set2.end(),insert_iterator< set<int> >(inn,inn.begin()));

if(Set1==Set2)

cout<<"A equals B\n";

else if(Set2==inn)

cout<<"B is a proper subset of A\n";

else if(Set1==inn)

cout<<"A is a proper subset of B\n";

else if(inn.size()==0)

cout<<"A and B are disjoint\n";

else

cout<<"I'm confused!\n";

}

return 0;

}

This is a very problem. Explanation: Elimination continues till there is a single maid remains. If number of keka maids are odd at beginning it never becomes even through the elimination process so it will reach at 1 first. And if the number of keka maids starts with even number it never becomes odd according

Continue Reading “10771” →

467

Asif NaeemJuly 19, 2015

#include <iostream>
#include <cstdio>
#include <sstream>
#include <string>
#include <cstring>
#include <algorithm>

using namespace std;
int signal[4000];
int main()
{
	string str;
	int kase=1;
	stringstream ss;
	int a,b,c,mx;
	int arr[12];

	while(getline(cin,str))
	{
		ss.clear();
		ss<<str;
		int k=1;
		int time=0;
		while(ss>>arr[k])k++;
		sort(arr+1,arr+k);

		memset(signal,0,sizeof(signal));
		for(int i=1;i<k;i++)
		{
			for(int j=0;j<3601;)
			{
				a=arr[i]-5;
				b=5;
				c=arr[i];
				while(a--)signal[j++]++;
				while(b--)signal[j++]=0;
				while(c--)signal[j++]=0;
			}
		}
		for(int i=arr[1];i<=3600;i++)
		{
			if(signal[i]==k-1)
			{
				time=i;
				break;
			}
		}
		if(!time)
		cout<<"Set "<<kase++<<" is unable to synch after one hour.\n";
		else
		cout<<"Set "<<kase++<<" synchs again at "<<time/60<<" minute(s) and "<<time%60<<" second(s) after all turning green.\n";
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <sstream>

#include <string>

#include <cstring>

#include <algorithm>

using namespace std;

int signal[4000];

int main()

{

string str;

int kase=1;

stringstream ss;

int a,b,c,mx;

int arr[12];

while(getline(cin,str))

{

ss.clear();

ss<<str;

int k=1;

int time=0;

while(ss>>arr[k])k++;

sort(arr+1,arr+k);

memset(signal,0,sizeof(signal));

for(int i=1;i<k;i++)

{

for(int j=0;j<3601;)

{

a=arr[i]-5;

b=5;

c=arr[i];

while(a--)signal[j++]++;

while(b--)signal[j++]=0;

while(c--)signal[j++]=0;

}

for(int i=arr[1];i<=3600;i++)

{

if(signal[i]==k-1)

{

time=i;

break;

}

if(!time)

cout<<"Set "<<kase++<<" is unable to synch after one hour.\n";

else

cout<<"Set "<<kase++<<" synchs again at "<<time/60<<" minute(s) and "<<time%60<<" second(s) after all turning green.\n";

}

return 0;

}

10196

Asif NaeemJuly 16, 2015

#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>

using namespace std;

char board[8][8];

struct IDX{
	int i,j;
};

bool isCheck_knight(int I,int J,int color)
{
	int dx[8]={1,1,-1,-1,2,2,-2,-2};
	int dy[8]={2,-2,2,-2,1,-1,1,-1};
	int a,b;
	for(int i=0;i<8;i++)
	{
		a=dx[i]+I;
		b=dy[i]+J;
		if(a>=0 && a<8 && b>=0 && b<8)
		{
			if(board[a][b]=='N' && color==0)
			return 1;
			else if(board[a][b]=='n' && color==1)
			return 1;
		}
	}
	return 0;
}

bool ischeck_king(int I,int J,int color)
{
	int dx[8]={1,1,-1,-1,0,0,1,-1};
	int dy[8]={0,-1,0,1,1,-1,1,-1};
	int a,b;
	for(int i=0;i<8;i++)
	{
		a=dx[i]+I;
		b=dy[i]+J;
		if(a>=0 && a<8 && b>=0 && b<8)
		{
			if(board[a][b]=='K' && color==0)
			return 1;
			else if(board[a][b]=='k' && color==1)
			return 1;
		}
	}
	return 0;
}

bool ischeck_bishop(int I,int J,int color)
{
	int a=I,b=J;
	char ch;
	if(color)
	ch='b';
	else
	ch='B';
	a=I;b=J;
	a-=1;b-=1;
	while(a>=0 && b>=0)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a-=1;b-=1;
	}
	a=I;b=J;
	a+=1;b+=1;
	while(a<8 && b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a+=1;b+=1;
	}
	a=I;b=J;
	a+=1;b-=1;
	while(a>=0 && a<8 && b>=0 && b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a+=1;b-=1;
	}
	a=I;b=J;
	a-=1;b+=1;
	while(a>=0 && a<8 && b>=0 && b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a-=1;b+=1;
	}
	return 0;
}

bool ischeck_rook(int I,int J,int color)
{
	int a=I,b=J;
	char ch;
	if(color)
	ch='r';
	else
	ch='R';
	a-=1;
	while(a>=0 && b>=0)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a-=1;
	}
	a=I;b=J;
	b-=1;
	while(a>=0 && b>=0)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		b-=1;
	}
	a=I;b=J;
	b+=1;
	while(b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		b+=1;
	}
	a=I;b=J;
	a+=1;
	while(a<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a+=1;
	}
	return 0;
}

bool ischeck_queen(int I,int J,int color)
{
	int a=I,b=J;
	char ch;
	if(color)
	ch='q';
	else
	ch='Q';
	a-=1;b-=1;
	while(a>=0 && b>=0)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a-=1;b-=1;
	}
	a=I;b=J;
	a+=1;b+=1;
	while(a<8 && b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a+=1;b+=1;
	}
	a=I;b=J;
	a+=1;b-=1;
	while(a>=0 && a<8 && b>=0 && b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a+=1;b-=1;
	}
	a=I;b=J;
	a-=1;b+=1;
	while(a>=0 && a<8 && b>=0 && b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a-=1;b+=1;
	}
	a=I;b=J;
	a-=1;
	while(a>=0 && b>=0)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a-=1;
	}
	a=I;b=J;b-=1;
	while(a>=0 && b>=0)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		b-=1;
	}
	a=I;b=J;b+=1;
	while(b<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		b+=1;
	}
	a=I;b=J;a+=1;
	while(a<8)
	{
		if(board[a][b]==ch)
		return 1;
		else if(board[a][b]!='.')
		break;
		a+=1;
	}
	return 0;
}
int main()
{
	bool f=0;
	string blnk;
	int kase=1;
	IDX white_king,black_king;
	while(cin>>board[0][0])
	{
		f=0;
		if(board[0][0]=='K')
		{
			white_king.i=0;
			white_king.j=0;
		}
		if(board[0][0]=='k')
		{
			black_king.i=0;
			black_king.j=0;
		}
		if(board[0][0]!='.')
		f=1;
		for(int i=1;i<8;i++)
		{
			cin>>board[0][i];
			if(board[0][i]!='.')
			f=1;
			if(board[0][i]=='K')
			{
				white_king.i=0;
				white_king.j=i;
			}
			if(board[0][i]=='k')
			{
				black_king.i=0;
				black_king.j=i;
			}
		}
		for(int i=1;i<8;i++)
		{
			for(int j=0;j<8;j++)
			{
				cin>>board[i][j];
				if(board[i][j]!='.')
					f=1;
				if(board[i][j]=='K')
				{
					white_king.i=i;
					white_king.j=j;
				}
				if(board[i][j]=='k')
				{
					black_king.i=i;
					black_king.j=j;
				}
			}
		}

		if(!f)
		{
			break;
		}
		else
		{
			getline(cin,blnk);
		}


		//black_check
		f = isCheck_knight(black_king.i,black_king.j,0);
		if(f)
		{
			cout<<"Game #"<<kase++<<": black king is in check.\n";
			continue;
		}
		f = ischeck_king(black_king.i,black_king.j,0);
		if(f)
		{
			cout<<"Game #"<<kase++<<": black king is in check.\n";
			continue;
		}
		f = ischeck_bishop(black_king.i,black_king.j,0);
		if(f)
		{
			cout<<"Game #"<<kase++<<": black king is in check.\n";
			continue;
		}
		f = ischeck_rook(black_king.i,black_king.j,0);
		if(f)
		{
			cout<<"Game #"<<kase++<<": black king is in check.\n";
			continue;
		}
		//pawncheck
		if(black_king.i+1<8 && black_king.j+1<8 && board[black_king.i+1][black_king.j+1]=='P')
		{
			cout<<"Game #"<<kase++<<": black king is in check.\n";
			continue;
		}
		if(black_king.i+1<8 && black_king.j-1>=0 && board[black_king.i+1][black_king.j-1]=='P')
		{
			cout<<"Game #"<<kase++<<": black king is in check.\n";
			continue;
		}
		f = ischeck_queen(black_king.i,black_king.j,0);
		if(f)
		{
			cout<<"Game #"<<kase++<<": black king is in check.\n";
			continue;
		}
		//white_check
		f = isCheck_knight(white_king.i,white_king.j,1);
		if(f)
		{
			cout<<"Game #"<<kase++<<": white king is in check.\n";
			continue;
		}
		f = ischeck_king(white_king.i,white_king.j,1);
		if(f)
		{
			cout<<"Game #"<<kase++<<": white king is in check.\n";
			continue;
		}
		f = ischeck_bishop(white_king.i,white_king.j,1);
		if(f)
		{
			cout<<"Game #"<<kase++<<": white king is in check.\n";
			continue;
		}
		f = ischeck_rook(white_king.i,white_king.j,1);
		if(f)
		{
			cout<<"Game #"<<kase++<<": white king is in check.\n";
			continue;
		}
		//pawncheck
		if(white_king.i-1>=0 && white_king.j-1>=0 && board[white_king.i-1][white_king.j-1]=='p')
		{
			cout<<"Game #"<<kase++<<": white king is in check.\n";
			continue;
		}
		if(white_king.i-1>=0 && white_king.j+1<8 && board[white_king.i-1][white_king.j+1]=='p')
		{
			cout<<"Game #"<<kase++<<": white king is in check.\n";
			continue;
		}
		f = ischeck_queen(white_king.i,white_king.j,1);
		if(f)
		{
			cout<<"Game #"<<kase++<<": white king is in check.\n";
			continue;
		}
		//cout<<black_king.i<<" "<<black_king.j<<"\n";
		cout<<"Game #"<<kase++<<": no king is in check.\n";
	}
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

#include <iostream>

#include <string>

#include <cstring>

#include <cstdio>

using namespace std;

char board[8][8];

struct IDX{

int i,j;

};

bool isCheck_knight(int I,int J,int color)

{

int dx[8]={1,1,-1,-1,2,2,-2,-2};

int dy[8]={2,-2,2,-2,1,-1,1,-1};

int a,b;

for(int i=0;i<8;i++)

{

a=dx[i]+I;

b=dy[i]+J;

if(a>=0 && a<8 && b>=0 && b<8)

{

if(board[a][b]=='N' && color==0)

return 1;

else if(board[a][b]=='n' && color==1)

return 1;

}

return 0;

}

bool ischeck_king(int I,int J,int color)

{

int dx[8]={1,1,-1,-1,0,0,1,-1};

int dy[8]={0,-1,0,1,1,-1,1,-1};

int a,b;

for(int i=0;i<8;i++)

{

a=dx[i]+I;

b=dy[i]+J;

if(a>=0 && a<8 && b>=0 && b<8)

{

if(board[a][b]=='K' && color==0)

return 1;

else if(board[a][b]=='k' && color==1)

return 1;

}

return 0;

}

bool ischeck_bishop(int I,int J,int color)

{

int a=I,b=J;

char ch;

if(color)

ch='b';

else

ch='B';

a=I;b=J;

a-=1;b-=1;

while(a>=0 && b>=0)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a-=1;b-=1;

}

a=I;b=J;

a+=1;b+=1;

while(a<8 && b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a+=1;b+=1;

}

a=I;b=J;

a+=1;b-=1;

while(a>=0 && a<8 && b>=0 && b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a+=1;b-=1;

}

a=I;b=J;

a-=1;b+=1;

while(a>=0 && a<8 && b>=0 && b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a-=1;b+=1;

}

return 0;

}

bool ischeck_rook(int I,int J,int color)

{

int a=I,b=J;

char ch;

if(color)

ch='r';

else

ch='R';

a-=1;

while(a>=0 && b>=0)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a-=1;

}

a=I;b=J;

b-=1;

while(a>=0 && b>=0)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

b-=1;

}

a=I;b=J;

b+=1;

while(b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

b+=1;

}

a=I;b=J;

a+=1;

while(a<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a+=1;

}

return 0;

}

bool ischeck_queen(int I,int J,int color)

{

int a=I,b=J;

char ch;

if(color)

ch='q';

else

ch='Q';

a-=1;b-=1;

while(a>=0 && b>=0)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a-=1;b-=1;

}

a=I;b=J;

a+=1;b+=1;

while(a<8 && b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a+=1;b+=1;

}

a=I;b=J;

a+=1;b-=1;

while(a>=0 && a<8 && b>=0 && b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a+=1;b-=1;

}

a=I;b=J;

a-=1;b+=1;

while(a>=0 && a<8 && b>=0 && b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a-=1;b+=1;

}

a=I;b=J;

a-=1;

while(a>=0 && b>=0)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a-=1;

}

a=I;b=J;b-=1;

while(a>=0 && b>=0)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

b-=1;

}

a=I;b=J;b+=1;

while(b<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

b+=1;

}

a=I;b=J;a+=1;

while(a<8)

{

if(board[a][b]==ch)

return 1;

else if(board[a][b]!='.')

break;

a+=1;

}

return 0;

}

int main()

{

bool f=0;

string blnk;

int kase=1;

IDX white_king,black_king;

while(cin>>board[0][0])

{

f=0;

if(board[0][0]=='K')

{

white_king.i=0;

white_king.j=0;

}

if(board[0][0]=='k')

{

black_king.i=0;

black_king.j=0;

}

if(board[0][0]!='.')

f=1;

for(int i=1;i<8;i++)

{

cin>>board[0][i];

if(board[0][i]!='.')

f=1;

if(board[0][i]=='K')

{

white_king.i=0;

white_king.j=i;

}

if(board[0][i]=='k')

{

black_king.i=0;

black_king.j=i;

}

for(int i=1;i<8;i++)

{

for(int j=0;j<8;j++)

{

cin>>board[i][j];

if(board[i][j]!='.')

f=1;

if(board[i][j]=='K')

{

white_king.i=i;

white_king.j=j;

}

if(board[i][j]=='k')

{

black_king.i=i;

black_king.j=j;

}

if(!f)

{

break;

}

else

{

getline(cin,blnk);

}

//black_check

f = isCheck_knight(black_king.i,black_king.j,0);

if(f)

{

cout<<"Game #"<<kase++<<": black king is in check.\n";

continue;

}

f = ischeck_king(black_king.i,black_king.j,0);

if(f)

{

cout<<"Game #"<<kase++<<": black king is in check.\n";

continue;

}

f = ischeck_bishop(black_king.i,black_king.j,0);

if(f)

{

cout<<"Game #"<<kase++<<": black king is in check.\n";

continue;

}

f = ischeck_rook(black_king.i,black_king.j,0);

if(f)

{

cout<<"Game #"<<kase++<<": black king is in check.\n";

continue;

}

//pawncheck

if(black_king.i+1<8 && black_king.j+1<8 && board[black_king.i+1][black_king.j+1]=='P')

{

cout<<"Game #"<<kase++<<": black king is in check.\n";

continue;

}

if(black_king.i+1<8 && black_king.j-1>=0 && board[black_king.i+1][black_king.j-1]=='P')

{

cout<<"Game #"<<kase++<<": black king is in check.\n";

continue;

}

f = ischeck_queen(black_king.i,black_king.j,0);

if(f)

{

cout<<"Game #"<<kase++<<": black king is in check.\n";

continue;

}

//white_check

f = isCheck_knight(white_king.i,white_king.j,1);

if(f)

{