# Codeforces Round #369 (Div. 2)

A. Bus to Udayland
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has nrows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS and Chris came, some places in the bus was already occupied.

ZS and Chris are good friends. They insist to get a pair of neighbouring empty seats. Two seats are considered neighbouring if they are in the same row and in the same pair. Given the configuration of the bus, can you help ZS and Chris determine where they should sit?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the number of rows of seats in the bus.

Then, n lines follow. Each line contains exactly 5 characters, the first two of them denote the first pair of seats in the row, the third character denotes the walkway (it always equals '|') and the last two of them denote the second pair of seats in the row.

Each character, except the walkway, equals to 'O' or to 'X'. 'O' denotes an empty seat, 'X' denotes an occupied seat. See the sample cases for more details.

Output

If it is possible for Chris and ZS to sit at neighbouring empty seats, print "YES" (without quotes) in the first line. In the next n lines print the bus configuration, where the characters in the pair of seats for Chris and ZS is changed with characters '+'. Thus the configuration should differ from the input one by exactly two charaters (they should be equal to 'O' in the input and to '+' in the output).

If there is no pair of seats for Chris and ZS, print "NO" (without quotes) in a single line.

If there are multiple solutions, you may print any of them.

Examples
input
6
OO|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX

output
YES
++|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX

input
4
XO|OX
XO|XX
OX|OX
XX|OX

output
NO

input
5
XX|XX
XX|XX
XO|OX
XO|OO
OX|XO

output
YES
XX|XX
XX|XX
XO|OX
XO|++
OX|XO

Note

Note that the following is an incorrect configuration for the first sample case because the seats must be in the same pair.

O+|+X

XO|XX

OX|OO

XX|OX

OO|OO

OO|XX

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char str[1005][10];
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i = 0;i < n;i++)
scanf("%s",str[i]);
int flag = 0;
for(int i = 0;i < n;i++)
{
int len = strlen(str[i]);
for(int j = 0;j < 5;j++)
{
if(str[i][0] ==str[i][1]&&str[i][0] =='O')
{
str[i][0] = str[i][1] = '+';
flag = 1;
break;
}

else if(str[i][3] == str[i][4] && str[i][4] == 'O')
{
str[i][3] = str[i][4] = '+';
flag = 1;
break;
}
}
if(flag)
break;
}
if(flag)
{
printf("YES\n");
for(int i = 0;i < n;i++)
printf("%s\n",str[i]);
}
else
printf("NO\n");
}
return 0;
}


B. Chris and Magic Square
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

ZS the Coder and Chris the Baboon arrived at the entrance of Udayland. There is a n × n magic grid on the entrance which is filled with integers. Chris noticed that exactly one of the cells in the grid is empty, and to enter Udayland, they need to fill a positive integer into the empty cell.

Chris tried filling in random numbers but it didn't work. ZS the Coder realizes that they need to fill in a positive integer such that the numbers in the grid form a magic square. This means that he has to fill in a positive integer so that the sum of the numbers in each row of the grid (), each column of the grid (), and the two long diagonals of the grid (the main diagonal —  and the secondary diagonal — ) are equal.

Chris doesn't know what number to fill in. Can you help Chris find the correct positive integer to fill in or determine that it is impossible?

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 500) — the number of rows and columns of the magic grid.

n lines follow, each of them contains n integers. The j-th number in the i-th of them denotes ai, j (1 ≤ ai, j ≤ 109 or ai, j = 0), the number in the i-th row and j-th column of the magic grid. If the corresponding cell is empty, ai, j will be equal to 0. Otherwise, ai, j is positive.

It is guaranteed that there is exactly one pair of integers i, j (1 ≤ i, j ≤ n) such that ai, j = 0.

Output

Output a single integer, the positive integer x (1 ≤ x ≤ 1018) that should be filled in the empty cell so that the whole grid becomes a magic square. If such positive integer x does not exist, output  - 1 instead.

If there are multiple solutions, you may print any of them.

Examples
input
3
4 0 2
3 5 7
8 1 6

output
9

input
4
1 1 1 1
1 1 0 1
1 1 1 1
1 1 1 1

output
1

input
4
1 1 1 1
1 1 0 1
1 1 2 1
1 1 1 1

output
-1

Note

In the first sample case, we can fill in 9 into the empty cell to make the resulting grid a magic square. Indeed,

The sum of numbers in each row is:

4 + 9 + 2 = 3 + 5 + 7 = 8 + 1 + 6 = 15.

The sum of numbers in each column is:

4 + 3 + 8 = 9 + 5 + 1 = 2 + 7 + 6 = 15.

The sum of numbers in the two diagonals is:

4 + 5 + 6 = 2 + 5 + 8 = 15.

In the third sample case, it is impossible to fill a number in the empty square such that the resulting grid is a magic square.

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
ll d[505][505],a[505],b[505];

bool check(int n,ll sum)
{
for(int i = 1;i <= n;i++){
ll tmp = 0;
for(int j = 0;j <= n;j++){
tmp += d[i][j];
}
if(tmp!=sum) return 0;
}
for(int j = 1;j <= n;j++){
ll tmp = 0;
for(int i = 1;i <= n;i++){
tmp += d[i][j];
}
if(tmp != sum) return 0;
}
ll tmp = 0;
for(int i = 1;i <= n;i++){
tmp += d[i][i];
}
if(tmp!=sum)
return 0;
tmp = 0;
for(int i = 1;i <= n;i++){
tmp += d[n-i+1][i];
}
if(tmp!=sum) return 0;
return 1;
}

int main()
{
int n;
while(~scanf("%d",&n))
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
int r,c;
int sss = 0;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
{
scanf("%lld",&d[i][j]);
if(d[i][j] == 0)
r = i,c = j,sss++;
}
if(sss == n*n || n == 1)
{
printf("1\n");
continue;
}
ll aa = 0;
if(r != 1)
{
for(int i = 1;i <= n;i++)
aa += d[1][i];
}
else
for(int i = 1;i <= n;i++)
aa += d[2][i];

ll sum = d[r][c];
sum += aa;
for(int i = 1;i <= n;i++)
sum -= d[r][i];
if(sum <= 0)
{
printf("-1\n");
continue;
}
d[r][c] = sum;
ll rrr = 0,ccc = 0,rr = 0,cc = 0;
for(int j = 1;j <= n;j++)
{
rrr += d[r][j];
ccc += d[j][c];
rr += d[j][j];
cc += d[j][n+1-j];
}
/*
if(rrr == ccc&& rrr == rr && rrr == cc)
printf("%lld\n",sum);
*/
//判断各行各列各对角线相等，上面只写了改变点的行列对角线条件
if(check(n,aa))
printf("%lld\n",sum);
else
printf("-1\n");
}
return 0;
}


#### Codeforces Round #444 (Div. 2)-贪心&尺取-Ratings and Reality Shows

2017-11-11 20:11:11

#### Educational Codeforces Round 36 (Rated for Div. 2) 题解

2018-01-13 23:16:24

#### Codeforces Round #471 div.2 ABC题解

2018-03-24 14:16:58

#### Codeforces Round #446 (Div. 2) D. Gluttony

2017-11-18 21:07:25

#### Codeforces Round #476 (Div. 2) [Thanks, Telegram!] D - Single-use Stones（思维）

2018-04-27 00:50:37

#### Codeforces Round #426 (Div. 2) D. The Bakery（DP+线段树）

2017-07-31 09:16:44

#### Codeforces Round #448 (Div. 2) ABC

2017-11-27 14:47:02

#### CF-Codeforces Round #483 (Div. 2)-D-XOR-pyramid

2018-05-16 01:15:04

#### Codeforces Round #485 (Div. 2) ABCDE

2018-05-30 11:26:56

#### Codeforces Round #495 (Div. 2)：D. Sonya and Matrix（暴力）

2018-07-06 13:48:23