Cod sursa(job #1465330)
Utilizator | Data | 26 iulie 2015 23:53:33 | |
---|---|---|---|
Problema | Jocul Flip | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
# include <fstream>
using namespace std;
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int main()
{
int n, m, i, j, maxi=0;
f>>n>>m;
int a[n][m];
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
{
f>>a[i][j];
if (a[i][j]<0)
maxi-=a[i][j];
else
maxi=a[i][j];
}
g<<maxi;
}