201709-1 打酱油

201709-1 打酱油

一. 原理

递归求解

二. 代码

#include <iostream>
#include <algorithm>

using namespace std;

int re(int count){

    if(count >= 5){
        int three = re(count-3)+1;
        int five = re(count-5)+2;
        return max(three,five);
    }else if(count >=3 && count <5){
        return 1;
    }else{
        return 0;
    }


}

int main(){

    int n;
    cin>>n;

    int count = n/10;

    count += re(count);

    cout<<count<<endl;

    return 0;
}