PAT第二次上机题目

最新推荐文章于 2024-04-03 20:50:03 发布
最新推荐文章于 2024-04-03 20:50:03 发布
阅读量100 收藏
点赞数

5-1

#include <iostream>
#include <cstdlib>
using namespace std;

template <class T> T maxn(T x[], int len)
{
    int i;
    T store = x[0];
    
    int k = 0;
    for (i = 0; i < len; i++)
    {
        if(x[i] > x[k]) k = i;
    }
    
    store = x[k];
    
    return store;
}

class time0
{
    private:
        int hh,mm,ss;
    public:
        time0(int a = 0, int b = 0, int c = 0):hh(a),mm(b),ss(c){};
        bool operator > (time0 &t);
        void display();
};

void time0::display()
{
    cout << hh << " " << mm << " " << ss << endl;
}

bool time0::operator > (time0 &t)
{
    int pre = 0, beh = 0;
    pre = hh * 3600 + mm * 60 + ss;
    beh = t.hh * 3600 + t.mm * 60 + ss;
    if(pre > beh)return true;
    else return false;
}

class date
{
    private:
        int year,mouth,day;
    public:
        date(int a = 0, int b = 0, int c = 0):year(a),mouth(b),day(c){};
        bool operator > (date &d);
        void display();
};

void date::display()
{
    cout << year << " " << mouth << " " << day << endl;
}

bool date::operator > (date &d)
{
    int pre = 0, beh = 0;
    pre = year * 365 + mouth * 30 + day;
    beh = d.year * 365 + d.mouth * 30 + day;
    if(pre > beh)return true;
    else return false;
}

int intArray[100];

double douArray[100];

time0 timeArray[100];

date dateArray[100];

int main()
{
    int ope;
    int i,j;
    while(cin >> ope)
    {
        if(ope == -1)break;
        
        if(ope == 1)
        {
            int tot = 0;
            while(1)
            {
                int w;
                cin >> w;
                if(w == 0)break;
                
                intArray[tot++] = w;
            }
            
            double result = 0;
            result = maxn<int> (intArray,tot);
            
            cout << result << endl;
        }
        else if(ope == 2)
        {
            int tot = 0;
            while(1)
            {
                double w;
                cin >> w;
                if(w == 0)break;
                
                douArray[tot++] = w;
            }
            
            double result = 0;
            result = maxn<double> (douArray,tot);
            
            cout << result << endl;
        }
        else if(ope == 3)
        {
            int hh1,mm1,ss1;
            int tot = 0;
            while(1)
            {
                cin >> hh1;
                if(hh1 == 0)break;
                
                cin >> mm1 >> ss1;
                
                time0 t(hh1,mm1,ss1);
                timeArray[tot++] = t;
            }
            
            time0 result;
            result = maxn<time0> (timeArray, tot);
            
            result.display();
        }
        else if(ope == 4)
        {
            int hh1,mm1,ss1;
            int tot = 0;
            while(1)
            {
                cin >> hh1;
                if(hh1 == 0)break;
                
                cin >> mm1 >> ss1;
                
                date t(hh1,mm1,ss1);
                dateArray[tot++] = t;
            }
            
            date result;
            result = maxn<date> (dateArray, tot);
            
            result.display();
        }
    }
    return 0;
}

5-2

#include <iostream>
#include <cstdlib>
#include <string>
using namespace std;

template <class T> int addSet(T * myset, T elem,int len)
{
    if(len > 100)
    {
        cout << "Full Set." << endl;
        return len;
    }
    
    int i, j;
    for(i = 0; i < len; i++)
    {
        if(*(myset + i) == elem)
        {
            cout << elem << " is already exist!" << endl;
            return len;
        }
    }
    
    *(myset + len) = elem;
    
    cout << len-1 << endl;
    
    len ++;
    
    return len;
}

template <class T> int deleSet(T * myset, T elem, int len)
{
    int i, j;
    
    bool flag = false;
    int beg = 1;
    for(i = 0; i < len; i++)
    {
        if(*(myset + i) == elem)
        {
            flag = true;
            beg = i;
            break;
        }
    }
    
    if(!flag)
    {
        cout << elem << " is not exist!" << endl;
        return len;
    }
    
    cout << beg-1 << endl;
    
    for(i = beg, j = beg + 1; j < len; i++, j++)
    {
        *(myset + i) = *(myset + j);
    }
    
    len --;
    
    return len;
}

template <class T> int findElem(T * myset, T elem, int len)
{
    int i, j;
    
    for(i = 0; i < len; i++)
    {
        if(*(myset + i) == elem)
        {
            return i;
        }
    }
    
    return -1;
}

int intSet[100];

double douSet[100];

string StrSet[100];

int main()
{
    int intLen = 1, douLen = 1, strLen = 1;

    int i;
    
    int ope;
    
    while(cin >> ope)
    {
        if(ope == 0)break;
        
        if(ope == 1)
        {
            int nope, inum;
            cin >> nope >> inum;
            
            if(nope == 1)
            {
                intLen = addSet<int> (intSet, inum, intLen);
            }
            else if(nope == 2)
            {
                intLen = deleSet<int> (intSet, inum, intLen);
            }
            else if(nope == 3)
            {
                int judge = findElem<int> (intSet, inum, intLen);
                if(judge == -1)
                {
                    cout << inum << " is not exist!" << endl;
                }
                else
                {
                    cout << judge-1 << endl;
                }
            }
        }
        else if(ope == 2)
        {
            int nope;
            double inum;
            cin >> nope >> inum;
            
            if(nope == 1)
            {
                douLen = addSet<double> (douSet, inum, douLen);
            }
            else if(nope == 2)
            {
                douLen = deleSet<double> (douSet, inum, douLen);
            }
            else if(nope == 3)
            {
                int judge = findElem<double> (douSet, inum, douLen);
                if(judge == -1)
                {
                    cout << inum << " is not exist!" << endl;
                }
                else
                {
                    cout << judge-1 << endl;
                }
            }
        }
        else if(ope == 3)
        {
            int nope;
            string inum;
            cin >> nope >> inum;
            
            if(nope == 1)
            {
                strLen = addSet<string> (StrSet, inum, strLen);
            }
            else if(nope == 2)
            {
                strLen = deleSet<string> (StrSet, inum, strLen);
            }
            else if(nope == 3)
            {
                int judge = findElem<string> (StrSet, inum, strLen);
                if(judge == -1)
                {
                    cout << inum << " is not exist!" << endl;
                }
                else
                {
                    cout << judge-1 << endl;
                }
            }
        }
    }
    return 0;
}

5-3

(听说用5-2的代码也能过噢

#include <iostream>
#include <stdlib.h>
using namespace std;

template <class T> class MySet
{
private:
    T data[100];
    int count;
    
public:
    MySet()
    {
        count = 0; 
    };
    
    int addSet(T elem)
    {
        if(count > 100)
        {
            cout << "Full Set." << endl;
            return count;
        }
    
        int i, j;
        for(i = 0; i < count; i++)
        {
            if(data[i] == elem)
            {
                cout << elem << " is already exist!" << endl;
                return count;
            }
        }
    
        data[count] = elem;
    
        cout << count << endl;
    
        count ++;
    
        return count;
    };
    
    int deleSet(T elem)
    {
        int i, j;
    
        bool flag = false;
        int beg = 1;
        for(i = 0; i < count; i++)
        {
            if(data[i] == elem)
            {
                flag = true;
                beg = i;
                break;
            }
        }
    
        if(!flag)
        {
            cout << elem << " is not exist!" << endl;
            return count;
        }
    
        cout << beg << endl;
    
        for(i = beg, j = beg + 1; j < count; i++, j++)
        {
            data[i] = data[j];
        }
    
        count --;
    
        return count;
    };
    
    int findElem(T elem)
    {
        int i, j;
    
        for(i = 0; i < count; i++)
        {
            if(data[i] == elem)
            {
                return i;
            }
        }
    
        return -1;
    };

};

//int MySet::addSet(T elem)


//int MySet::deleSet(T elem)


//int MySet::findElem(T elem)

int main()
{
    MySet<int> intSet;
    MySet<double> douSet;
    MySet<string> strSet;
    
    int intLen = 1, douLen = 1, strLen = 1;

    int i;
    
    int ope;
    
    while(cin >> ope)
    {
        if(ope == 0)break;
        
        if(ope == 1)
        {
            int nope, inum;
            cin >> nope >> inum;
            
            if(nope == 1)
            {
                intLen = intSet.addSet(inum);
            }
            else if(nope == 2)
            {
                intLen = intSet.deleSet(inum);
            }
            else if(nope == 3)
            {
                int judge = intSet.findElem(inum);
                if(judge == -1)
                {
                    cout << inum << " is not exist!" << endl;
                }
                else
                {
                    cout << judge << endl;
                }
            }
        }
        else if(ope == 2)
        {
            int nope;
            double inum;
            cin >> nope >> inum;
            
            if(nope == 1)
            {
                douLen = douSet.addSet(inum);
            }
            else if(nope == 2)
            {
                douLen = douSet.deleSet(inum);
            }
            else if(nope == 3)
            {
                int judge = douSet.findElem(inum);
                if(judge == -1)
                {
                    cout << inum << " is not exist!" << endl;
                }
                else
                {
                    cout << judge << endl;
                }
            }
        }
        else if(ope == 3)
        {
            int nope;
            string inum;
            cin >> nope >> inum;
            
            if(nope == 1)
            {
                strLen = strSet.addSet(inum);
            }
            else if(nope == 2)
            {
                strLen = strSet.deleSet(inum);
            }
            else if(nope == 3)
            {
                int judge = strSet.findElem(inum);
                if(judge == -1)
                {
                    cout << inum << " is not exist!" << endl;
                }
                else
                {
                    cout << judge << endl;
                }
            }
        }
    }
    return 0;
}

5-4

注意：(备注说明：分数为0时，表示成0z1m，如果结果为负数，那么分子取负数，分母为正数)

#include <iostream>
#include <cstdlib>
#include <sstream>
#include <cmath>
using namespace std;

int small(int a, int b)
{
    if(a == 0 || b == 0)return 0;
    
    int t;
    if(a < b)
    {
        t = a; a = b; b = t;
    }
    int c = a % b;
    while(c != 0)
    {
        a = b;
        b = c;
        c = a % b;
    }
    
    return b;
}

class FS
{
    private:
        int fz,fm;
    public:
        FS(int a = 0, int b = 0):fz(a),fm(b){};
        FS operator + (const FS &f);
        void display();
};

void FS::display()
{
    bool flag = false;
    
    if(fz * fm == 0)
    {
        cout << "0z1m" << endl;
        return ;
    }
    
    if(fz * fm < 0)
    {
        flag = true;
    }
    if(fz < 0)fz = -fz;
    if(fm < 0)fm = -fm;
    
    if(flag)cout << "-";
    
    cout << fz << "z" << fm << "m" << endl;
}

FS FS::operator + (const FS &f)
{
    bool flag1 = false, flag2 = false; // false - true +
    
    if(fz*fm < 0)flag1 = true;
    if(f.fz*f.fm < 0)flag2 = true;
    
    int newfz = 0,newfm = 0;
    if(!flag1 && !flag2)
    {
        int common = 0;
        if(fz == 0 || f.fz == 0)
        {
            if(fz == 0)
            {
                newfz = f.fz;
                newfm = f.fm;
            }
            else if(f.fz == 0)
            {
                newfz = fz;
                newfm = fm;
            }
        }
        else
        {
            newfz = fz * f.fm + fm * f.fz;
            newfm = fm * f.fm;
        }
        
        if(newfz != 0)
        {
            common = small(newfz,newfm);
            newfz /= common;
            newfm /= common;
        }
    }
    else if(!flag1 && flag2)
    {
        int common = 0;
        if(fz == 0 || f.fz == 0)
        {
            if(fz == 0)
            {
                newfz = f.fz;
                newfm = f.fm;
            }
            else if(f.fz == 0)
            {
                newfz = fz;
                newfm = fm;
            }
        }
        else
        {
            newfz = fz * f.fm + fm * f.fz;
            newfm = fm * f.fm;
        }
        
        if(newfz != 0)
        {
            common = small(newfz,newfm);
            newfz /= common;
            newfm /= common;
        }
    }
    else if(flag1 && !flag2)
    {
        int common = 0;
        if(fz == 0 || f.fz == 0)
        {
            if(fz == 0)
            {
                newfz = f.fz;
                newfm = f.fm;
            }
            else if(f.fz == 0)
            {
                newfz = fz;
                newfm = fm;
            }
        }
        else
        {
            newfz = fz * f.fm + fm * f.fz;
            newfm = fm * f.fm;
        }
        
        if(newfz != 0)
        {
            common = small(newfz,newfm);
            newfz /= common;
            newfm /= common;
        }
    }
    else if(flag1 && flag2)
    {
        int common = 0;
        newfz = - (fz * f.fm + fm * f.fz);
        newfm = fm * f.fm;
        
        if(newfz != 0)
        {
            common = small(newfz,newfm);
            newfz /= common;
            newfm /= common;
        }
        
        newfz = -newfz;
    }
    
    FS f1(newfz,newfm);
    return f1;
}

int main()
{
    int n;
    int i,j,k;
    cin >> n;
    
    string s1,s2;
    stringstream stream;
    int sfz = 0, sfm = 0;
    for(k = 1; k <= n; k++)
    {
        cin >> s1 >> s2;
        
        string s;
        for(i = 0; i < s1.length(); i++)
        {
            if(s1[i] == 'z')
            {
                stream << s;
                stream >> sfz;
                stream.clear();
                s = "";
                
                continue;
            }
            
            if(s1[i] == 'm')
            {
                stream << s;
                stream >> sfm;
                stream.clear();
                s = "";
                
                break;
            }
            
            s += s1[i];
        }
        
        FS c1(sfz,sfm);
        s = "";
        sfz = 0;
        sfm = 0;
        
        for(i = 0; i < s2.length(); i++)
        {
            if(s2[i] == 'z')
            {
                stream << s;
                stream >> sfz;
                stream.clear();
                s = "";
                
                continue;
            }
            
            if(s2[i] == 'm')
            {
                stream << s;
                stream >> sfm;
                stream.clear();
                s = "";
                
                break;
            }
            
            s += s2[i];
        }
        
        FS c2(sfz,sfm);
        s = "";
        sfz = 0;
        sfm = 0;
        
        FS c3 = c1 + c2;
        c3.display();
    }
    
    return 0;
}

5-5

考虑的情况比较多，需要耐心。

#include <iostream>
#include <cstdlib>
#include <string>
#include <sstream>
using namespace std;

class Complex
{
    private:
        int real, imag;
    public:
        Complex(int a = 0, int b = 0):real(a), imag(b){};
        void display();
        Complex operator * (Complex &b);
};

void Complex::display()
{
    if(real == 0 && imag == 0)
    {
        cout << "0" << endl;
        return ;
    }
    
    else if(real == 0)
    {
        if(imag != 1 && imag != -1)
        cout << imag << "i" << endl;
        else if(imag == 1)
        cout << "i" << endl;
        else
        cout << "-i" << endl;
        
        return ;
    }
    
    else if(imag == 0)
    {
        cout << real << endl;
        return ;
    }
    
    if(imag < 0)
    {
        if(imag != -1)
        cout << real << imag << "i" << endl;
        else cout << real << "-i" << endl;
    }
    else 
    {
        if(imag != 1)
        cout << real << "+" << imag << "i" << endl;
        else if(imag == 1)
        cout << real << "+i" << endl;
    }
}

Complex Complex::operator * (Complex &b)
{
    int creal = 0, cimag = 0;
    creal = real * b.real - imag * b.imag;
    cimag = real * b.imag + b.real * imag;
    
    Complex c(creal, cimag);
    return c;
}

int main()
{
    string s1, s2;
    int i;
    while (cin >> s1 >> s2)
    {
        string s;
        stringstream stream;
        
        int areal = 0, aimag = 0;
        int breal = 0, bimag = 0;
        for (i = 0; i < s1.length(); i++)
        {
            if (i == 0 && s1[0] == '-')
            {
                s += '-';
                continue;
            }
            
            if (s1[i] == '+' || s1[i] == '-')
            {
                stream << s;
                stream >> areal;
                stream.clear();
                
                s = "";
                
                if (s1[i] == '-')
                s += '-';
                
                continue;
            }
            
            if (s1[i] == 'i')
            {
                if(s == "-" || s == "")
                {
                    if(s == "-")aimag = -1;
                    else aimag = 1;
                    
                    s = "";
                    
                    break;
                }
                
                stream << s;
                stream >> aimag;
                stream.clear();
                
                s = "";
                
                break;
            }
            
            s += s1[i];
        }
        
        if (s != "")
        {
            stream << s;
            stream >> areal;
            stream.clear();
            
            s = "";
        }
        
        s = "";
        
        for (i = 0; i < s2.length(); i++)
        {
            if (i == 0 && s2[0] == '-')
            {
                s += '-';
                continue;
            }
            
            if (s2[i] == '+' || s2[i] == '-')
            {
                stream << s;
                stream >> breal;
                stream.clear();
                
                s = "";
                
                if (s2[i] == '-')
                s += '-';
                
                continue;
            }
            
            if (s2[i] == 'i')
            {
                if(s == "-" || s == "")
                {
                    if(s == "-")bimag = -1;
                    else bimag = 1;
                    
                    s = "";
                    
                    break;
                }
                
                stream << s;
                stream >> bimag;
                stream.clear();
                
                s = "";
                
                break;
            }
            
            s += s2[i];
        }
        
        if (s != "")
        {
            stream << s;
            stream >> breal;
            stream.clear();
            
            s = "";
        }
        
        Complex A(areal, aimag), B(breal, bimag);
        Complex C = A * B;
        //A.display();
        //B.display();
        C.display();
    }
    return 0;
}

//i -i
weixin_34107739
关注
浙大19年保研上机之 pat-Zigzag Sequence
qq_42681421的博客
09-26 567
Zigzag Sequence This time your job is to output a sequence ofNpositive integers in azigzag formatwith widthMin non-decreasing order. A zigzag ...
PAT 计算机程序设计能力考试
David_Jett
07-12 2万+
【官方简介】         计算机程序设计能力考试（Programming Ability Test，简称PAT）旨在通过统一组织的在线考试及自动评测方法客观地评判考生的算法设计与程序设计实现能力，科学的评价计算机程序设计人才，为企业选拔人才提供参考标准。         考试遵循统一考试大纲、统一考试命题、统一考试评分标准、统一颁发证书的原则，由考试中心负责考试的组织、日常管理和具体实
浙江大学PAT上机题解析之1014. 福尔摩斯的约会 (20)
weixin_30896511的博客
09-02 469
1014. 福尔摩斯的约会 (20) 时间限制 50 ms 内存限制 32000 kB 代码长度限制 8000 B 判题程序 Standard 作者 CHEN, Yue 大侦探福尔摩斯接到一张奇怪的字条：“我们约会吧！ 3485djDkxh4hhGE 298...
Codeforces Round #274 (Div. 2)
House
10-20 1211
昨天打了场div2  成绩不错AK了  希望以后还能有5：00的比赛… 479A Expression 给你3个数字  不让换顺序  中间填+或*使结果最大  把情况写出来就好了… #include #include #include #include #include #include #include #include #include #include #include #i
数据结构第三次上机
向南走的博客
05-22 185
7-1 二叉树最长路径 (100 分) 给定一棵二叉树T，求T中的最长路径的长度，并输出此路径上各结点的值。若有多条最长路径，输出最右侧的那条。 输入格式: 第1行，1个整数n，表示二叉树有n个结点， 1≤n≤100000. 第2行，2n+1个整数，用空格分隔，表示T的扩展先根序列， -1表示空指针，结点用编号1到n表示。 输出格式: 第1行，1个整数length，length表示T中的最长路径的长度。 第2行，length+1个整数，用空格分隔，表示最右侧的最长路径。 输入样例: 在这里
PAT乙级（考研上机复习 重点题&易错题）
weixin_52355727的博客
04-03 1447
PAT乙级 重点题&易错题
苏大计算机上机题目推荐
豆子
05-25 1451
目录苏州大学计算机复试上机【字符串/数组类习题】【PAT和LeetCode习题】PAT1028 人口普查 (20分)1029 旧键盘 (20分)1078 字符串压缩与解压 (20分)1081 检查密码 (15分)1043 输出PATest (20分)1091 N-自守数 (15分)LeetCode3. 无重复字符的最长子串5. 最长回文子串791. 自定义字符串排序804. 唯一摩尔斯密...
PAT甲级题目
绿箭侠
03-14 298
PAT甲级的题目有关于树的题目，1053，1086，1090，1102，1106，1115，1119，1110 A1053 这题目比较简单，给定一棵树，给定一个数字，要你找到所有和等于给定数字的路径。这个题目的树没有给出是二叉树，自然不能按照原来二叉树的方法来构建了。其实就是BFS，用DFS也是可以的，不过考虑到DFS还要新开一个数组来存储路径，还是使用BFS。 首先...
苏州大学计算机复试上机【字符串/数组类】【PAT和LeetCode习题】
豆子
05-25 1078
目录苏州大学计算机复试【字符串/数组类习题】PAT1028 人口普查 (20分)1029 旧键盘 (20分)1078 字符串压缩与解压 (20分)1081 检查密码 (15分)1043 输出PATest (20分)1091 N-自守数 (15分)LeetCode3. 无重复字符的最长子串5. 最长回文子串791. 自定义字符串排序804. 唯一摩尔斯密码词856. 括号的分数890. 查...
宇宙无敌PAT-A不完全考纲
大美mixer的博客
02-07 985
    大家新年快乐！     最近一直有朋友问我“考研上机怎么准备？”、“马上找工作，想考PAT练练手”等...其实本来刚考完PAT的时候，我是想总结一下各个平台以及教程的所有题目合成一本模板教程。但是我想想吧，这样让大家太偷懒了，不利于大家的智力发展。还是建议大家自己先做一遍，然后对着答案改，然后形成自己的模板比较好（其实是我懒 /(T_T)/~~~）...
《算法笔记上机实验指南》第4章 入门篇（2）---算法初步 4.1排序
wsfhdhjs的博客
05-14 674
pat A1012 单词： Each input file contains one test case. 每个输入文件包含一个测试用例 corresponding 相应的 separated by a space 空格隔开 Hence 所以 题意： 输入： 1.输入n，m 2.输入n个学生的id C M E（学生编号，C语言成绩，数学成绩，英文成绩） 3.输入m个要查询的学生id 输出： 1.对应 2.输出学生编号，总排名，考场位置，数组在考场内的排名 3.排名原则：成绩不同，降序排
输出一个整数的每一位
a331683772的博客
11-23 320
#include<stdio.h> #include<stdlib.h>int main() { int num = 0; int i = 0; int a[32] = {0}; int count = 0; printf("请输入一个整数:"); scanf("%d",&num); while(num) //计算位
Codeforces Round #Pi (Div. 2) (STL专场)
adr5970的博客
05-27 109
Codeforces Round #Pi (Div. 2) A - Lineland Mail 水题，拼手速。 /* * @author Novicer * language : C++/C */ #include<iostream> #include<sstream> #include<fstream> #include...
PAT考试小经验
热门推荐
湛蓝的天空
03-04 4万+
本人今天下午参加的PAT甲级考试，并且是第一次参加，满分。简要的说下考试的经验吧，首先一定先要了解考点的编译器，这个是非常重要的。由于现在PAT考试已经取消了考前试机环节，那么对编译器不是很熟悉的话，会让你的临场发挥状态变差，这会导致你发挥不出来你的固有实力。以visual studio编译器为例，说一下要注意的情况。首先不管是什么版本，先按如下图所示一步一步的来：
rhino grasshoper 框内物体排列（附视频）.gh
最新发布
10-18
【闭合线内物体按方向移动/排列】https://www.bilibili.com/video/BV1z1WfeSEWu?vd_source=b420114c993138474d2e93d83ead77a5
kwant-1.4.3-cp38-cp38-win_amd64.whl
10-18
kwant-1.4.3-cp38-cp38-win_amd64.whl
rhino grasshoper 景观椅（附视频）.gh
10-18
【rhino@grasshoper 曲线金属座椅景观案例（文件获取/见简介）】https://www.bilibili.com/video/BV1Dx4y147Lr?vd_source=b420114c993138474d2e93d83ead77a5
PCIe通义万问系列文档的第一部已整理完毕，含999个PCIe相关问答
10-18
《PCIe通义万问》系列文档旨在记录PCIe相关行业工程师们在PCIe协议学习、IP设计验证、产品测试及使用过程中遇到的问题、迸发的思考、进行的探讨及可能的解决方案，以期给遇到相同相似问题的同行们些许启发。文档涉及的技术方向主要为PCIe，也包含PCIe相关的CXL、UCIe及计算机体系结构相关内容。 本文档是《PCIe通义万问》系列文档之（一），含999个问题。问题内容有以下三个来源：MangoPapa（下称博主）的“PCIe每日一问一答”系列专栏；博主的博文留言及私信讨论；博主作为群主的“PCIe技术交流群”群聊内容。MangoPapa小助理、折叠、先杰、CR小队长、kangling共同完成了问答内容提取与归纳整理，噫嘘唏及慕荷负责文辞优化及编辑排版，上述人员及MangoPapa、JasonW、皮塞阿姨、席可儿参与了文档内容的审校。感谢以上人员的无私奉献。 本文档仅对讨论内容进行总结记录，不保证问题答案的正确性，部分问题只提供解决思路或讨论过程。术业有专攻，文内定有偏颇。如您发现谬误，一敬希原宥，二望乞点拨；如您持异见，欢迎来信讨论。如有需要，欢迎联系MangoPapa加入相关
PAT甲级编程题目分类与精华摘要
"PAT题目分类.docx" 这些PAT(A Level)编程竞赛题目涵盖了多个计算机科学和技术领域，包括字符串处理、哈希表应用和图论。以下是对这些题目所涉及知识点的详细解释： 1. **字符串处理**： - **1112 Stucked ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值