Pagini recente » Cod sursa (job #1018993) | Cod sursa (job #757362) | Cod sursa (job #2339520) | Cod sursa (job #2983229) | Cod sursa (job #1367893)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("taxe2.in");
ofstream g("taxe2.out");
int a[100][100];
int main()
{
int n,s,b,r;
f>>s;
f>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
f>>a[i][j];
b=a[0][0];
for(int i=-1;i<=n;i++)
for(int j=-1;j<=n;j++)
{
a[-1][j]=1e9;
a[i][-1]=1e9;
a[n][j]=1e9;
a[i][n]=1e9;
}
for(int j=0;j<n;j++)
for(int i=0;i<n;i++)
{
if(a[i-1][j]<=a[i][j-1])
a[i][j]=a[i][j]+a[i-1][j];
else
a[i][j]=a[i][j]+a[i][j-1];
if(i==0 && j==0)
a[i][j]=b;
}
r=s-a[n-1][n-1];
g<<r;
return 0;
}