Pagini recente » Cod sursa (job #847852) | Cod sursa (job #1420049) | Cod sursa (job #1608673) | Cod sursa (job #2334465) | Cod sursa (job #2819894)
#include <iostream>
#include <fstream>
using namespace std;
/*
ifstream in("taxe2.in");
ofstream out("taxe2.out");
*/
ifstream in("adunare.in");
ofstream out("adunare.out");
int main()
{
int n, i, f, S, a[101][101];
in >> S>> n;
out << S + n;
/*for (i = 1;i <= n;i++)
for (f = 1;f <= n;f++) in >> a[i][f];
for (i = 2;i <= n;i++) {
a[i][1] += a[i - 1][1];
a[1][i] += a[1][i - 1];
}
for (i = 2;i <= n;i++) {
for (f = 2;f <= n;f++) {
if (a[i - 1][f] <= a[i][f - 1]) a[i][f] = a[i][f] + a[i - 1][f];
else a[i][f] = a[i][f] + a[i][f - 1];
}
}
if (S >= a[n][n]) cout << S - a[n][n];
else cout << -1;
*/
return 0;
}