Submission #71837

#TimeUsernameProblemLanguageResultExecution timeMemory
71837:p (#119)Angelic Hourglass (FXCUP3_hourglass)C++14
58 / 100
4 ms744 KiB
#include <bits/stdc++.h>
using namespace std;

const int INF = 2e9;

int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  int n; cin >> n;

  vector<int> dp(n+1, INF);
  dp[0] = 0;
  for(int i=3; i<=n; i++)
  {
    dp[i] = min(dp[i], dp[i-3]+1);
    if(i >= 5) dp[i] = min(dp[i], dp[i-5]+1);
  }

  int res = min(dp[n], dp[n-2]+2);
  cout << (res == INF ? -1 : res) << endl;

  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...