[笔试强训day09]

#include<iostream>
#include<string>

using namespace std;

int main()
{
    string s;
    cin>>s;
    string ans;
    for(int i=0;i<s.size();i++)
    {
        ans+=s[i];
        if((s.size()-1-i)%3==0&&i!=s.size()-1) ans=ans+",";
    }
    cout<<ans<<endl;
    return 0;
}

#include<iostream>
#include<vector>

using namespace std;

int n;
vector<int> dp(n+1);

int main()
{
    cin>>n;
    dp[1]=1;
    dp[2]=2;
    
    for(int i=3;i<=n;i++)
    {
        dp[i]=dp[i-1]+dp[i-2];
    }

    if(n==1||n==0) cout<<n<<endl;
    else cout<<dp[n]<<endl;
    return 0;
}

class Solution {
public:

    bool IsContinuous(vector<int>& numbers) {
        sort(numbers.begin(),numbers.end());
        int z=0,gap=0;
        for(int i=0;i<numbers.size()-1;i++)
        {
            if(numbers[i]==0) z++;
            else if(numbers[i]==numbers[i+1]) return false;
            else 
            {
                gap+=numbers[i+1]-numbers[i]-1;
            }
        }
        return z>=gap;

    }
};

#include <algorithm>
class Solution {
    bool hash[14]={0};
public:

    bool IsContinuous(vector<int>& numbers) 
    {
        int maxV=0,minV=14;
        for(auto x:numbers)
        {
            if(x)
            {
                if(hash[x]) return false;    // 出现重复元素
                hash[x]=true;
                maxV=max(maxV, x);
                minV=min(minV, x);
            }
        }
        return maxV-minV<=4;
    }
};