POJ 2078 Martrix

                                                             Matrix

Time Limit: 2000MS		Memory Limit: 30000K
Total Submissions: 3096		Accepted: 1612

Description

Given an n*n matrix A, whose entries Ai,j are integer numbers ( 0 <= i < n, 0 <= j < n ). An operation SHIFT at row i ( 0 <= i < n ) will move the integers in the row one position right, and the rightmost integer will wrap around to the leftmost column. 

You can do the SHIFT operation at arbitrary row, and as many times as you like. Your task is to minimize 
max0<=j< n{Cj|Cj=Σ0<=i< nAi,j}

Input

The input consists of several test cases. The first line of each test case contains an integer n. Each of the following n lines contains n integers, indicating the matrix A. The input is terminated by a single line with an integer −1. You may assume that 1 <= n <= 7 and |Ai,j| < 104.

Output

For each test case, print a line containing the minimum value of the maximum of column sums.

Sample Input

24 63 731 2 34 5 67 8 9-1

#include <iostream>
#include <algorithm>

using namespace std;

int n;
int mini=9999999;

void zhuan(int cur,int a[8][8])
{
    reverse(a[cur],a[cur]+n-1);
    reverse(a[cur],a[cur]+n);
}

void dfs(int cur,int a[8][8])
{
    if(cur!=n)
    {
        for(int i=0;i<n;i++)
        {
            zhuan(cur,a);
            dfs(cur+1,a);
        }
    }
    else if(cur==n)
    {
        int sum;
        int maxx=-1;
        for(int i=0;i<n;i++)
        {
            sum=0;
            for(int j=0;j<n;j++)
            {
                sum+=a[j][i];
            }
            if(sum>maxx)
                maxx=sum;
        }
        if(maxx<mini)
            mini=maxx;
    }
}

int main()
{
    int a[8][8];
    cin>>n;
    while(n!=-1)
    {

        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                cin>>a[i][j];
            }
        }
        mini=9999999;
        dfs(0,a);

        cout<<mini<<endl;

    cin>>n;
    }

    return 0;
}