Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std ;
- int main ()
- {
- int n , d , val , i , j , res ;
- set < int > s[10] ;
- set < int > :: iterator it1 , it2 ;
- cin >> n >> d ;
- val = 0;
- for ( i = 1 ; i <= n ; i ++ )
- {
- val = 10 * val + d ;
- s[i].insert ( val ) ;
- s[i].insert ( -val ) ;
- }
- for ( i = 2 ; i <= n ; i ++ )
- for ( j = 1 ; j + j <= i ; j ++ )
- for ( it1 = s[j].begin () ; it1 != s[j].end () ; it1 ++ )
- for ( it2 = s[i - j].begin () ; it2 != s[i - j].end () ; it2 ++ )
- {
- int x = *it1 , y = *it2 ;
- s[i].insert ( x + y ) ;
- s[i].insert ( x * y ) ;
- if ( y != 0 && x % y == 0 ) s[i].insert ( x / y ) ;
- if ( x != 0 && y % x == 0 ) s[i].insert ( y / x ) ;
- s[i].insert ( x - y ) ;
- s[i].insert ( y - x ) ;
- }
- res = 1 ;
- while ( s[n].find ( res ) != s[n].end () ) res ++ ;
- cout << res << endl ;
- return 0 ;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement