冉行i-优快云博客

原创 mysql 语句练习

create table S( Sno varchar(20) primary key comment '学号', Sname varchar(20), Ssex char(1), Sage int, Sdept varchar(20) comment '系' ); create table C( Cno int primary key comment '课程号', Cname varchar(50), Credit int comment

2022-04-16 19:26:42 1027

原创 c语言实现pl0词法分析器

#include<stdio.h> #include<stdlib.h> #include<string.h> using namespace std; char stayWord[16][15] = { “const”,“var”,“odd”,“procedure”,“begin”,“end”,“if”,“then”,“call”,“while”,“do”,“read”}; bool isNumber(char ch); bool isCase(char ch); bo

2022-04-13 15:01:13 2257

原创数据结构课程设计财务管理系统

#include<iostream> #include<vector> #include<fstream> #include<sstream> #include<algorithm> #include<string> using namespace std; //报销人员信息 typedef struct bxpeople{ //报销人工号 string bxid; //姓名 string name; //联系电话 stri

2022-03-10 22:04:16 2038 1

原创 pat甲级1138

1138 Postorder Traversal (25 分) Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traversal sequence of the correspond

2022-01-30 12:44:24 737

原创 pat甲级1002

This time, you are supposed to find A+B where A and B are two polynomials. Input Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of

2022-01-28 20:13:01 668

原创 pat甲级1001

1001 A+B Format (20 分) Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits). Input Specification: Each input file contains one test case. Each ca

2022-01-28 19:57:46 381

原创 pat甲级1083

1083 List Grades (25 分) Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval. Input S

2022-01-25 23:09:36 96

原创 pat甲级1092

1092 To Buy or Not to Buy (20 分) Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strings in whole

2022-01-25 22:56:37 248

原创 pat甲级1094

1094 The Largest Generation (25 分) A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation with the largest population. Input Specification: Each in

2022-01-25 22:04:02 275

原创 pat甲级1029 Median

Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences is defined to be the me

2022-01-21 11:24:50 320

原创 1031 Hello World for U

#include<iostream> #include<string> using namespace std; int main(){ string s; cin>>s; int len = s.length()+2; int n1 = len/3,n2 = len/3+len%3; string s1 = s.substr(0,n1-1),s2 = s.substr(n1-1,n2),s3 = s.substr(n1+n2-1,

2022-01-20 13:16:01 419

immortalsx的博客