代码拉取完成,页面将自动刷新
#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<fstream>
#include <utility>
#include<algorithm>
#include<Windows.h>
#include<conio.h>
#define DEBUG
#define testUi
//#define DEBUG
#define For(i, l, r) for(int i = l; i <= r; i++)
using namespace std;
struct CourseNode{
CourseNode(){
CourseId = -1;
CourseName = "";
CourseTeacher = "";
CourseCap = -1;
CourseSel = -1;
CourseType = -1;
}
CourseNode(int id){
CourseId = id;
CourseName = "";
CourseTeacher = "";
CourseCap = -1;
CourseSel = -1;
CourseType = -1;
}
CourseNode(string name){
CourseName = name;
CourseId = -1;
CourseTeacher = "";
CourseCap = -1;
CourseSel = -1;
CourseType = -1;
}
// id name teacher cap sel type
CourseNode(string name, string teacher, int cap, int sel, string type, int id = -1){
CourseId = id;
CourseName = name;
CourseTeacher = teacher;
CourseCap = cap;
CourseSel = sel;
if (type == "רҵ") CourseType = 0;
else CourseType = 1;
}
int CourseId, CourseCap, CourseSel, CourseType;//0רҵ 1רҵ
string CourseName, CourseTeacher;
};
//extern vector<CourseNode>CourseList;
struct stuWordNode{
stuWordNode(string name, string password=""){
stuName = name;
stuPassword = password;
}
string stuName, stuPassword;
};
struct stuCourseNode{
stuCourseNode(int id, string st = "Null"){
courseId = id;
assistant = st;
}
int courseId;
string assistant;
};
struct assistNode{
assistNode(){
courseId = -1;
if (!list.empty()) list.clear();
}
assistNode(int id, string st){
courseId = id;
if (!list.empty()) list.clear();
list.push_back(st);
}
assistNode(int id, vector<string> a){
courseId = id;
if (!list.empty()) list.clear();
list.assign(a.begin(), a.end());
}
assistNode(string st){
courseId = -1;
if (!list.empty()) list.clear();
list.push_back(st);
}
assistNode(int id){
courseId = id;
if (!list.empty()) list.clear();
}
assistNode(const assistNode& tmp){
courseId = tmp.courseId;
list.assign(tmp.list.begin(), tmp.list.end());
}
int courseId;
vector<string> list;
};
struct courseStuNode{
courseStuNode(){
courseId = -1;
list.clear();
}
courseStuNode(int id){
list.clear();
courseId = id;
}
courseStuNode(int id, string st){
courseId = id;
list.clear();
list.push_back(st);
}
courseStuNode(int id, vector<string> a){
courseId = id;
list.clear();
list.assign(a.begin(), a.end());
}
courseStuNode(const courseStuNode& tmp){
courseId = tmp.courseId;
list.assign(tmp.list.begin(), tmp.list.end());
}
int courseId;
vector<string> list;
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。