Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- typedef long long LL;
- const int maxn = 100000 + 100;
- int num[5] = {2, 6, 10, 14, 18};
- int solve(int x) {
- return x - (x / 20 * 5 + (upper_bound(num, num + 5, x % 20) - num));
- }
- int main() {
- #ifdef ExRoc
- freopen("test.txt", "r", stdin);
- #endif // ExRoc
- ios::sync_with_stdio(false);
- // set<int> st;
- // for (int i = 1; i <= 1000; ++i) {
- // st.insert(i);
- // }
- // for (int i = 0; i <= 10000; ++i) {
- // for (int j = 0; j < i; ++j) {
- // st.erase(i * i - j * j);
- // }
- // }
- // for (int x : st) {
- // cout << x << endl;
- // }
- int l, r;
- cin >> l >> r;
- cout << solve(r) - solve(l - 1) << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement