Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- typedef long long ll;
- ll rank( ll n, int *a )
- {
- ll r=1;
- while( n > 0 ){
- a[n%10]++; n /= 10; r*=10;
- }
- return r;
- }
- int main( void )
- {
- ll n=50000,r;
- int i,c,f,a[10],ret=0;
- while( n > 0 ){
- for( i=0; i<10; i++ ) a[i] = 0;
- r = 0; c = 1;
- while( r < 10000000LL ){
- r = r * rank( n*c, a ) + n*c;
- c++;
- }
- f = (a[0]) ? 0 : 1;
- for( i=1; i<10; i++ ){
- if( a[i] != 1 ) f = 0;
- }
- if( f ){
- printf( "%lld: %lld\n", n, r );
- ret = ( ret < r ) ? r : ret;
- }
- n--;
- }
- printf( "%d\n", ret ); /* => 932718654 */
- return 0;
- }
Add Comment
Please, Sign In to add comment