Pagini recente » Cod sursa (job #1266029) | Cod sursa (job #2220369) | Cod sursa (job #2899251) | Cod sursa (job #641393) | Cod sursa (job #49632)
Cod sursa(job #49632)
#include <cstdio>
#include <algorithm>
#include <ctime>
#include <cstdlib>
#define maxn 128
using namespace std;
int x[maxn][maxn], n;
void citire()
{
freopen("cc.in", "r", stdin);
scanf("%d\n", &n);
int i, j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) scanf("%d ", &x[i][j]);
}
void solve()
{
int i, j, ntimes=10;
int a[maxn], sum=0, smin=0x3f3f3f3f;
for(i=1;i<=n;i++) a[i]=i;
for(i=0;i<ntimes;i++)
{
random_shuffle(a+1,a+n+1);
sum=0;
for(j=1;j<=n;j++)sum+=x[j][a[j]];
if(smin>sum) smin=sum;
}
freopen("cc.out", "w", stdout);
printf("%d\n", smin);
}
int main()
{
time_t s;
time(&s);
srand(s%666013);
citire();
solve();
return 0;
}