ACM练手

#include<iostream>
#include<string.h>
using namespace std;
#define N 100
class stack
{
    char s[N];
    int top;
public:
    stack() { top = -1; }
    void push(char p) { top++; s[top] = p; }
    void pop() { top--; }
    char seek() { return s[top]; }
    bool empty() { if (top == -1)return true; return false; }
};
void check(char* temp)
{
    stack p;
    if (temp[0] == ')' || temp[0] == ']')
        cout << "no" << endl;
    else
    {
        for (int i = 0; i < strlen(temp); i++)
            if (temp[i] == '(' || temp[i] == '[')
                p.push(temp[i]);
            else if (temp[i] == ')' || temp[i] == ']')
            {
                if (temp[i] == ')'&&p.seek() == '(')
                    p.pop();
                else if(temp[i] == ']'&&p.seek() == '[')
                    p.pop();
                else
                {
                    cout << "no" << endl;
                    return;
                }
            }
        if(p.empty())
            cout << "yes" << endl;
        else
            cout << "no" << endl;
    }
}
int main()
{
    char s[10];
    int n; cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> s;
        check(s);
    }
    return 0;
}

#include<iostream>
#include<cstring>
#define maxsize 10000
using namespace std;
int a[maxsize];
int main()
{


    int m;
    cin >> m;
    a[1] = 1;
    long long delta = 0, pos = 1;//pos为此刻进位到哪，由于delta用于进位累加，故long
    for (int i = 1; i <= m; i++)//让a[]从1乘到m
    {
        delta = 0;
        for (int j = 1; j <= pos; j++)
         {

            a[j] = a[j] * i + delta;
            delta = a[j] / 10;//个位之前
            a[j] = a[j] % 10;//个位

        }
        if (delta != 0)//进位
        {
            while (delta) {//对进位进行循环，确保进位大于9时完全进位上去
                a[pos + 1] = delta % 10;
                delta = delta / 10;
                pos = pos + 1;
            }
        }
    }



    for (int i = pos; i >= 1; i--)
    {
        cout << a[i];
     }
    
}