fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2024-06-07 21:45:22
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2024-06-26 00:53:20
  6. */
  7. #include <bits/stdc++.h>
  8. // #pragma GCC optimize("O3")  
  9. // #pragma GCC optimize("unroll-loops")  
  10. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  11. using namespace std;
  12. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  13. #define int long long
  14. #define ull unsigned long long
  15. #define sz(x) x.size()
  16. #define sqr(x) (1LL * (x) * (x))
  17. #define all(x) x.begin(), x.end()
  18. #define fill(f,x) memset(f,x,sizeof(f))
  19. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  20. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  21. #define ii pair<int,int>
  22. #define iii pair<int,ii>
  23. #define di pair<ii,ii>
  24. #define vi vector<int>
  25. #define vii vector<ii>
  26. #define mii map<int,int>
  27. #define fi first
  28. #define se second
  29. #define pb push_back
  30. #define MOD 1000000007
  31. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  32. #define YES cout << "YES\n"
  33. #define NO cout << "NO\n"
  34. #define MASK(i) (1LL << (i))
  35. #define c_bit(i) __builtin_popcountll(i)
  36. #define BIT(x,i) ((x) & MASK(i))
  37. #define SET_ON(x,i) ((x) | MASK(i))
  38. #define SET_OFF(x,i) ((x) & ~MASK(i))
  39. #define oo 1e18
  40. #define name ""
  41. #define endl '\n'
  42. #define time() cout << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms.";
  43. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  44. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  45. int dp[19][2][10][2];
  46.  
  47. int solve(int pos, int lower, int last, bool check, string &x)
  48. {
  49. 	if (pos == x.size()) return check;
  50. 	if (dp[pos][lower][last][check] != -1) return dp[pos][lower][last][check];
  51. 	int fin = (!lower?9:x[pos]-'0'), ans = 0;
  52. 	FOR(i,0,fin)
  53. 	{
  54. 		int newPos = pos+1, newCheck = ((check) or (i == 4) or (last == 1 and i == 3)), newLast = i;
  55. 		int newLower = (!lower?0:i==fin?1:0);
  56. 		ans += solve(newPos,newLower,newLast,newCheck,x);
  57. 	}
  58. 	dp[pos][lower][last][check] = ans;
  59. 	return ans;
  60. }
  61.  
  62. int calc(string x)
  63. {
  64. 	fill(dp,-1);
  65. 	return solve(0,1,0,0,x);
  66. }
  67.  
  68. signed main()
  69. {
  70.     fast;
  71.     // freopen(name".inp","r",stdin);
  72.     // freopen(name".out","w",stdout);
  73.     string n;
  74.     cin >> n;
  75.     cout << calc(n);
  76.     return 0;
  77. }
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/0IqjsV
language:
C++14 (gcc 8.3)
created:
1 hour 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!