HDU 5058 so easy (set container algorithm is good)

Link: HDU 5058So easy

Question: give two sequences and ask if the two sequences constitute the same set,

Set Method is good!

AC code:

# Include <stdio. h >#include <set ># include <map> using namespace STD; # define ll _ int64set <ll> SS1, ss2; set <ll >:: iterator it; int main () {ll N, I; while (scanf ("% i64d", & N )! = EOF) {ll num; ss1.clear (); ss2.clear (); for (I = 0; I <n; I ++) {scanf ("% i64d ", & num); ss1.insert (Num) ;}bool flag = true; for (I = 0; I <n; I ++) {scanf ("% i64d ", & num); ss2.insert (Num);} If (ss2.size ()! = Ss1.size () printf ("NO \ n"); else {int temp = ss1.size (); For (IT = ss2.begin (); it! = Ss2.end (); It ++) ss1.insert (* It); If (temp = ss1.size () printf ("Yes \ n "); else printf ("NO \ n") ;}} return 0 ;}
 

HDU 5058 so easy (set container algorithm is good)