weixin_43743670的博客

PATb 1041 考试座位号 (15分)题目简单，贴代码就好了，用string来解决字符串，cin代码：#include <iostream>using namespace std;struct stu { string id; int test_id,exam_id;};int main(){ int n,m,k,shi,kao; string temp; scanf("%d",&n); stu peo[n+1]; for(int i = 1;i<=

PATA 1009 Product of Polynomials (25分)题目描述：This time, you are supposed to find A×B where A and B are two polynomials.输入格式：Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:K N​1​

PATA 1002 A+B for Polynomials (25分)题目描述：This time, you are supposed to find A+B where A and B are two polynomials.输入格式：Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:K N​1​​

patb 1010 一元多项式求导 (25分)题目描述：设计函数求一元多项式的导数。（注：x^​n​​ （n为整数）的一阶导数为nx^n−1​​ 。）输入格式：以指数递降方式输入多项式非零项系数和指数（绝对值均为不超过 1000 的整数）。数字间以空格分隔。​​ .输出格式：以与输入相同的格式输出导数多项式非零项的系数和指数。数字间以空格分隔，但结尾不能有多余空格。注意“零多项式”的指数和系数都是 0，但是表示为 0 0。输入样例：3 4 -5 2 6 1 -2 0输出样例：12

PATA 1065 A+B and C (64bit) (20分)题目描述：Given three integers A, B and C in [−2^​63, 2^​63], you are supposed to tell whether A+B>C.输入格式：For each test case, output in one line Case #X: true if A+B>C, or Case #X: false otherwise, where X is the case

PATB 1018 锤子剪刀布 (20分)题目描述：The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.输入格式：Each input file contains one test case. For each case, the first

PATB 1018 锤子剪刀布 (20分)# 系列文章目录题目描述：大家应该都会玩“锤子剪刀布”的游戏：两人同时给出手势，胜负规则如图所示：现给出两人的交锋记录，请统计双方的胜、平、负次数，并且给出双方分别出什么手势的胜算最大。输入格式：输入第 1 行给出正整数 N（≤10​^5 ），即双方交锋的次数。随后 N 行，每行给出一次交锋的信息，即甲、乙双方同时给出的的手势。C 代表“锤子”、J 代表“剪刀”、B 代表“布”，第 1 个字母代表甲方，第 2 个代表乙方，中间有 1 个空格。输出格