Pagini recente » Cod sursa (job #2587170) | Cod sursa (job #2565179) | Cod sursa (job #2574633) | Cod sursa (job #944548) | Cod sursa (job #2202464)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("adunare.in");
ofstream out("adunare.out");
/*
int vec[1000005];
bool invalid[1000005];
int main()
{
int n, max = 1000001;
in >> n;
for(int i = 0; i < n; i++)
{
in >> vec[i];
if(max > vec[i])
{
invalid[i] = true;
max = vec[i];
}
}
for(int i = 0; i < n; i++)
{
if(invalid[i])
{
out << "-1 ";
continue;
}
for(int j = 0; j < i; j++)
{
if(vec[i] < vec[j]) continue;
out << j+1 << " ";
break;
}
}
in.close();
out.close();
return 0;
}*/
int main()
{
int a, b;
in >> a >> b;
out << a+b;
in.close();
out.close();
}