20209/9 远景笔试c++ 已AC 括号的成对匹配 求阶乘的末尾连续0的个数

题1：检测字符串中（）[] {} "" 是否成对，成对：true，不成对：false

样例: "I like apple!"  输出true

#include<bits/stdc++.h>
using namespace std;
//检测 “” [] {} ()
int main()
{
    string str;
    getline(cin,str);

    stack<char> s;

    int len = 0;
    for(auto i : str)
    {
        if(i == '"')
        {
            len++;
            continue;
        }
        if(i == '['||i == '{'||i == '(')    //mao hao
        {
            s.push(i);
        }
        else if ( i == ']'||i == '}'||i == ')') {
            s.pop();
        }
        else {
            continue;
        }
    }
    if(len%2 == 0)
    {
        //冒号可以满足
        if(s.empty())
        {
           cout<<"true"<<endl;
           return 0;
        }
    }
    cout<<"false"<<endl;

    return  0;
}

输入一个数，求改数的阶乘的末尾连续0的个数

#include<bits/stdc++.h>
using namespace std;
int fun(int n)
{
    long long count = n/5;
    for (long long i = 25; i <=n; i+=25) {
        long long var = i;
        while (var%5 == 0) {
            count++;
            var=var/5;
        }
        count--;
    }
    return count;
}

int main()
{

    int num;
    cin>>num;

    cout<<fun(num)<<endl;

    return  0;
}