/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 1ms 444.0 KiB
#3 Accepted 1ms 320.0 KiB
#4 Accepted 1ms 320.0 KiB

Code

#include <bits/stdc++.h>
#define ll long long
#define endll '\n';
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;


const int mod = 1e9 + 7, N = 1e6;
int dp[N];
int rec(int x) {
    if(x < 0) return 1e5;
    if(x == 0) return 0;
    if(dp[ x] != -1) return dp[x];
    int ans = 1e9;
    ans = min(ans, rec(x - 2) + 1);
    ans = min(ans, rec(x - 3) + 1);
    return dp[x] = ans;
}
void solve()
{
 int n; cin >> n;
 cout << rec(n) << endll;
}

int32_t main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  for(int  i = 0; i <= 200; i++) dp[i] = -1;
//   cin >> t;
  while (t--) {
    solve();
}
 return 0;
}

Information

Submit By
Type
Submission
Problem
P1106 too easy or three easy
Contest
Brain Booster #6
Language
C++17 (G++ 13.2.0)
Submit At
2024-10-03 15:32:31
Judged At
2024-12-17 11:36:59
Judged By
Score
100
Total Time
1ms
Peak Memory
444.0 KiB