fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. int gcd(int x, int y){
  28. 	if(y==0) return x;
  29. 	return gcd(y, x%y);
  30. }
  31.  
  32. int lcm(int x, int y){
  33. 	return (x*y) / gcd(x,y);
  34. }
  35.  
  36.  
  37.  
  38. int consistency(int n){
  39.  
  40. 	for(int i=n; i<=n+3000; i++){
  41. 		vector<int> digits(10, 0);
  42. 		int x = i;
  43. 		while(x){
  44. 			int digit = x%10;
  45. 			if(digit>0) digits[digit]++;
  46. 			x /= 10;
  47. 		}
  48.  
  49. 		bool isDiv = true;
  50. 		for(int j=1; j<10; j++){
  51. 			if(digits[j] == 0) continue;
  52. 			if(i%j != 0){
  53. 				isDiv = false;
  54. 				break;
  55. 			}
  56. 		}
  57. 		if(isDiv) return i;
  58. 	}
  59.  
  60. 	return n;
  61.  
  62. }
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78. int practice(int n){
  79.  
  80.  
  81.     return 0;
  82. }
  83.  
  84.  
  85.  
  86.  
  87.  
  88. void solve() {
  89.  
  90.     int n;
  91.     cin>> n;
  92.  
  93.     cout << consistency(n) << endl;
  94.  
  95.  
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102. int32_t main() {
  103.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  104.  
  105.     int t = 1;
  106.     cin >> t;
  107.     while (t--) {
  108.         solve();
  109.     }
  110.  
  111.     return 0;
  112. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
4
1
282
1234567890
1000000000000000000
stdout
copy 
1
288
1234568040
1000000000000000000
https://ideone.com/mqZEcq
language:
C++14 (gcc 8.3)
created:
3 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!