Problem B: Bulbs

Problem B: Bulbs

Greg has an m×n grid of Sweet Lightbulbs of Pure Coolness he would like to turn on. Initially, some of the bulbs are on and some are off. Greg can toggle some bulbs by shooting his laser at them. When he shoots his laser at a bulb, it toggles that bulb between on and off. But, it also toggles every bulb directly below it, and every bulb directly to the left of it. What is the smallest number of times that Greg needs to shoot his laser to turn all the bulbs on?

Input

The first line of input contains a single integer T (1 ≤ T ≤ 10), the number of test cases. Each test case starts with a line containing two space-separated integers m and n (1 ≤ m,n ≤ 400). The next m lines each consist of a string of length n of 1s and 0s. A 1 indicates a bulb which is on, and a 0 represents a bulb which is off.

Output

For each test case, output a single line containing the minimum number of times Greg has to shoot his laser to turn on all the bulbs.
Sample Input

2

3 4

0000

1110

1110

2 2

10

00

Sample Output

1

2
Explanation
In the first test case, shooting a laser at the top right bulb turns on all the bulbs which are off, and does not toggle any bulbs which are on.
In the second test case, shooting the top left and top right bulbs will do the job.

题意：把所有0，变成1最少需要几次；规则：如果把0变成1同时把左边的数和下边的数同时改变，

题解：从左上角开始处理，for循环遍历即可

#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
int n,m,ans=;
int a[],b[];
string s[];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        ans=;
        memset(a,,sizeof(a));
        memset(b,,sizeof(b));
        for(int i=;i<n;i++)
            cin>>s[i];
        for(int i=;i<n;i++)
        {
            for(int j=m-;j>=;j--)
            {
                int x=s[i][j]-''+a[i]+b[j];
                if(x%==)
                {
                    ans++;
                    a[i]++;
                    b[j]++;
                }
            }
        }
        cout<<ans<<endl;
    }
}