Guest User

Untitled

a guest
Dec 11th, 2018
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.59 KB | None | 0 0
  1. #include <stdio.h>
  2. typedef long long ll;
  3. ll rank( ll n, int *a )
  4. {
  5. ll r=1;
  6. while( n > 0 ){
  7. a[n%10]++; n /= 10; r*=10;
  8. }
  9. return r;
  10. }
  11. int main( void )
  12. {
  13. ll n=50000,r;
  14. int i,c,f,a[10],ret=0;
  15. while( n > 0 ){
  16. for( i=0; i<10; i++ ) a[i] = 0;
  17. r = 0; c = 1;
  18. while( r < 10000000LL ){
  19. r = r * rank( n*c, a ) + n*c;
  20. c++;
  21. }
  22. f = (a[0]) ? 0 : 1;
  23. for( i=1; i<10; i++ ){
  24. if( a[i] != 1 ) f = 0;
  25. }
  26. if( f ){
  27. printf( "%lld: %lld\n", n, r );
  28. ret = ( ret < r ) ? r : ret;
  29. }
  30. n--;
  31. }
  32. printf( "%d\n", ret ); /* => 932718654 */
  33. return 0;
  34. }
Add Comment
Please, Sign In to add comment