areinverse.cpp

#include <iostream>
#include <map>
using namespace std;

typedef map<int,int> map_p;
bool areinverse(map_p M1, map_p M2){
	if(M1.size()!=M2.size()) return false;
	map_p::iterator p = M1.begin();
	while(p!=M1.end()){
		if(M2.find(p->second)!=M2.end()){
			if(M2[p->second]!=p->first) return false;
		}else 
			return false;
		p++;
	}
	return true;
}

int main(int argc, char *argv[]) {
	
	return 0;
}