Pagini recente » Cod sursa (job #2161840) | Cod sursa (job #2910943) | Cod sursa (job #221189) | Cod sursa (job #1254467) | Cod sursa (job #2438966)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("adunare.in");
ofstream fout("adunare.out");
int n,m,i,j,cheie,val;
unordered_map <int,int> mapp;
int main()
{
/*
fin>>n;
for(i=1;i<=n;i++){
fin>>m;
for(j=1;j<=m;j++){
fin>>cheie>>val;
mapp[cheie]+=val;
}
}
fout<<mapp.size()<<"\n";
for(auto it=mapp.begin();it!=mapp.end();it++){
fout<<it->first<<" "<<it->second<<" ";
}
*/
fin>>n>>m;
fout<<n+m;
}