SRM515 Div2 Easy(250) FortunateNumbers
#include <vector> #include <set> using namespace std; class FortunateNumbers{public: int getFortunate( vector <int> a, vector <int> b, vector <int> c ) { set<int> F; for ( int i=0; i<(int)a.size(); i++ ) for ( int j=0; j<(int)b.size(); j++ ) for ( int k=0; k<(int)c.size(); k++ ) { int t = a[i]+b[j]+c[k]; bool f = true; for ( ; t>0; t/=10 ) if ( t%10!=5 && t%10!=8 ) f = false; if ( f ) F.insert(a[i]+b[j]+c[k]); } return (int)F.size(); }};