Pagini recente » Cod sursa (job #578409) | Cod sursa (job #2118939) | Cod sursa (job #1076861) | Cod sursa (job #1789437) | Cod sursa (job #2398346)
#include <fstream>
#include <unordered_map>
#define mod 250000
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
unordered_map <int,int> v;
unordered_map <int,int>::iterator it;
int main()
{ for(int i=1;i<=15;i++)
v.insert(make_pair(i%5,i));
for(int i=0;i<v.bucket_count();i++){
for(auto l_it=v.begin(i);l_it!=v.end(i);l_it++)
g<<l_it->first<<' '<<l_it->second<<' ';
g<<'\n';
}
return 0;
}