#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
bool potyczkowa(ll num) {
ll x = num;
while (x > 0) {
ll digit = x % 10;
x /= 10;
if (digit == 0 || num % digit != 0) return false;
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll l, r;
cin >> l >> r;
ll count = 0;
for (ll i=l; i<=r; ++i) {
if (potyczkowa(i)) count++;
}
cout << count << endl;
return 0;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 | #include <stdio.h> #include <vector> #include <map> #include <unordered_set> #include <queue> #include <unordered_map> #include <math.h> #include <limits.h> #include <algorithm> #include <functional> #include <iterator> #include <algorithm> #include <string> #include <iostream> using namespace std; #define pb push_back #define mp make_pair typedef long long ll; typedef unsigned long long ull; using namespace std; bool potyczkowa(ll num) { ll x = num; while (x > 0) { ll digit = x % 10; x /= 10; if (digit == 0 || num % digit != 0) return false; } return true; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); ll l, r; cin >> l >> r; ll count = 0; for (ll i=l; i<=r; ++i) { if (potyczkowa(i)) count++; } cout << count << endl; return 0; } |
English