Pagini recente » Cod sursa (job #1321702) | Cod sursa (job #927392) | Cod sursa (job #2067950) | Cod sursa (job #612228) | Cod sursa (job #309043)
Cod sursa(job #309043)
# #include<fstream.h>
# ifstream f1("flip.in");
# ofstream f2("flip.out");
# long int a[17][17],max;
# int n,m,sol[35];
# void calcul()
# {
# int q=0;
# int s;
# for(int i=1;i<=m;i++)
# { s=0;
# for(int j=1;j<=n;j++)
# s+=a[j][i]*sol[j];
# if(s<0) s=-s;
# q+=s;
# }
# if(max<q)max=q;
# }
# void back(int k)
# {
# if(k==n+1)calcul();
# else
# {
# sol[k]=1;
# back(k+1);
# sol[k]=-1;
# back(k+1);
# }
# }
# int main()
# {
# f1>>n>>m;
# for(int i=1;i<=n;i++)
# for(int j=1;j<=m;j++) f1>>a[i][j];
# max=-10000;
# back(1);
# f2<<max;
# return 0;
}