#581120 (C++11) No.1185 完全な3の倍数

• 問題: No.1185 完全な3の倍数
• ユーザー: hamray
• 提出日時: 2020-11-18 18:50:42
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 79 ms / 2,000 ms
• コード長: 3,758 bytes
• コンパイル時間: 1,889 ms
• コンパイル使用メモリ: 162,972 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-23 09:09:20
• 合計ジャッジ時間: 3,629 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	68 ms; 6,816 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	65 ms; 6,944 KB
testcase_04	AC	75 ms; 6,940 KB
testcase_05	AC	69 ms; 6,940 KB
testcase_06	AC	65 ms; 6,940 KB
testcase_07	AC	65 ms; 6,940 KB
testcase_08	AC	79 ms; 6,940 KB
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	2 ms; 6,940 KB
testcase_11	AC	1 ms; 6,940 KB
testcase_12	AC	2 ms; 6,944 KB
testcase_13	AC	2 ms; 6,944 KB
testcase_14	AC	1 ms; 6,940 KB
testcase_15	AC	1 ms; 6,944 KB
testcase_16	AC	2 ms; 6,944 KB
testcase_17	AC	2 ms; 6,944 KB
testcase_18	AC	1 ms; 6,940 KB
testcase_19	AC	20 ms; 6,940 KB
testcase_20	AC	59 ms; 6,940 KB
testcase_21	AC	40 ms; 6,940 KB
testcase_22	AC	24 ms; 6,940 KB
testcase_23	AC	21 ms; 6,940 KB
testcase_24	AC	58 ms; 6,940 KB
testcase_25	AC	6 ms; 6,944 KB
testcase_26	AC	40 ms; 6,944 KB
testcase_27	AC	20 ms; 6,940 KB
testcase_28	AC	42 ms; 6,944 KB
testcase_29	AC	34 ms; 6,940 KB
testcase_30	AC	39 ms; 6,944 KB
testcase_31	AC	2 ms; 6,940 KB
testcase_32	AC	69 ms; 6,940 KB
testcase_33	AC	14 ms; 6,944 KB
testcase_34	AC	58 ms; 6,944 KB
testcase_35	AC	74 ms; 6,940 KB
testcase_36	AC	60 ms; 6,944 KB
testcase_37	AC	59 ms; 6,940 KB
testcase_38	AC	39 ms; 6,940 KB
testcase_39	AC	2 ms; 6,940 KB
testcase_40	AC	1 ms; 6,944 KB
testcase_41	AC	2 ms; 6,940 KB

ソースコード

#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).endf()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).endf(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).endf())
#define SORT(c) sort((c).begin(), (c).endf())

//repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
const double EPS = 1e-4, PI = acos(-1);
//ここから編集    
typedef string::const_iterator State;
template< int mod >
struct ModInt {
  int x;

  ModInt() : x(0) {}

  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }

  ModInt &operator*=(const ModInt &p) {
    x = (int) (1LL * x * p.x % mod);
    return *this;
  }

  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }

  ModInt operator-() const { return ModInt(-x); }

  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

  bool operator==(const ModInt &p) const { return x == p.x; }

  bool operator!=(const ModInt &p) const { return x != p.x; }

  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while(n > 0) {
      if(n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }

  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt< mod >(t);
    return (is);
  }

  static int get_mod() { return mod; }
};

using modint = ModInt< 998244353 >;
int ans = 0;
ll N;
void dfs(string s){
  if(stoll(s) > N) return;
  if(s.size() != 1){
    ans++;
  }
  for(int k=0; k<10; k++){
    bool ok = true;
      for(int j=0; j<s.size(); j++){
        if(((s[j]-'0') + k)%3 != 0){
          ok = false;
        }
      } if(ok)dfs(s+(char)('0' + k));
    }
   
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);

    cin >> N;

    for(int i=1; i<10; i++){
      string s="";
      s += (char)('0' + i);
      dfs(s);
    }
    cout << ans << endl;
    return 0;
}