ZiQqing的博客

编程实现学生信息管理系统，学生信息包括姓名，学号，年龄，性别，分数，班级

利用sql建立教材数据库，并定义以下基本表：学生（学号，年龄，性别，系名） 教材（编号，书名，出版社编号，价格）订购（学号，书号，数量）出版社（编号，名称，地址）定义主码、外码、和价格、数量的取值范围。2 在三个表中输入若干记录，注意如果输入违反完整性约束条件的记录系统有何反应。...

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<time.h>typedef struct sushe //宿舍 { char name[100]; //姓名 char sushehao[100]; //宿舍号 char banji[100]; //班级 char xueyuan[100]; //学院 int cnt; //费用 struct su

//线性表的基本操作#include<iostream>using namespace std;typedef struct LNode{ int data; LNode *next;}LNode, *LinkList;//头插法建立单链表LinkList list_HeadInsert(LinkList &L){ LNode *s; int x; L=(LinkList)malloc(sizeof(LNode));//建立头结点 L->next=NULL;

//电路布线问题#include <iostream>#include<iomanip>#define L 100using namespace std;void mnset(int n, int c[], int size[L][L]){ for (int j = 0; j <= c[1]; j++) size[1][j] = 0;//初始化 for (int j = c[1]; j <= n; j++) size[1][j] = 1;//siz

//求解最长公共子序列#include<iostream>#include<stdio.h>#include<iomanip>using namespace std;const int length = 100;void LCSLength(int m, int n, char* x, char* y, int** c, int** b){ int i, j; for (i = 0; i <= m; i++) { c[i][0] = 0;

#include <stdio.h>#include <iomanip>#include <iostream>using namespace std;const int L = 7;void MatrixChain(int n, int** m, int** s, int* p);void PrintAnswer(int** s, int i, int j);//构造最优解void outputArray(int** s);int main(){ i.

import java.awt.BorderLayout;import java.awt.FlowLayout;import java.awt.event.ActionEvent;import java.awt.event.ActionListener;import javax.swing.JButton;import javax.swing.JFrame;import javax.swing.JLabel;import javax.swing.JOptionPane;import java

public class Java { static class Client { final int time; final int id; Client(int id) { this.time = (new Random().nextInt(10) + 1) * 1000 * 1; this.id = id; } } static class Request

import java.math.BigInteger;import java.security.MessageDigest;import java.util.*;public class Java { /** * 对字符串md5加密(小写字母+数字) * * @param str 传入要加密的字符串 * @return MD5加密后的字符串 */ public static String getMD5(String str) {

//javafx用jdk8import javafx.application.*;import javafx.beans.value.ChangeListener;import javafx.beans.value.ObservableValue;import javafx.geometry.*;import java.sql.*;import javafx.scene.Scene;import javafx.stage.Stage;import javafx.util.StringConv

//javafx用jdk8版本import javafx.application.Application;import javafx.collections.*;import javafx.scene.*;import javafx.scene.layout.*;import javafx.scene.paint.Color;import javafx.stage.*;import javafx.event.*;import javafx.geometry.Insets;import ja

//javafx选用jdk8import java.sql.*;import java.io.*;import java.security.acl.Group;import javafx.application.*;import javafx.beans.value.*;import javafx.collections.*;import javafx.geometry.*;import javafx.scene.Scene;import javafx.stage.FileChooser;

//javafx用jdk8版本import javafx.application.Application;import javafx.application.Platform;import javafx.beans.value.ChangeListener;import javafx.beans.value.ObservableValue;import javafx.collections.FXCollections;import javafx.collections.ObservableLis

import java.util.*;import java.text.*;import java.io.*;//联系人类class Linkman { Linkman(String n,String[] p,String w,String c,String e,String b,String r){ name=n; phone=p; work=w; call=c; email=e; birthday=b; remark=r; } Linkman

/***javafx用jdk8版本*/import javafx.application.Application;import javafx.application.Platform;import javafx.event.EventHandler;import javafx.geometry.Pos;import javafx.stage.FileChooser;import javafx.stage.Stage;import javafx.stage.Window;import j

/**java实现记事本功能*/import java.awt.*;import java.awt.event.*;import java.io.*;public class Java{ private Frame fr; private TextArea ta; private MenuBar bar; private Menu m; private MenuItem mi1,mi2,mi3,mi4,mi5; private Font font; private Dialog

#include<iostream>#include <algorithm>#include<iomanip>#define length 20using namespace std;int V[length][length] = { 0 };int KnapSack(int n, int C, int w[5], int v[5], int x[5]) { int i, j; for (i = 0; i <= n; i++) V+[0] = 0

#include<iostream>#include<stdio.h>using namespace std;#define n 4int m[100][100][100];char op[100];int v[100];int minf, maxf;void minMax(int i, int s, int j){ int e[5]; int a = m+[s][0], b = m+[s][1], r = (i + s - 1) % n + 1; i

#include<iostream>#include<stdio.h>#include<iomanip>using namespace std;const int length = 100;void LCSLength(int m, int n, char* x, char* y, int** c, int** b){ int i, j; for (i = 0; i <= m; i++) { c+[0] = 0; b+[0] = 0; }

#include<iostream>#include<cmath>using namespace std;int tile = 1;void ChessBoard(int* (*Board), int tr, int tc, int dr, int dc, int size){ if (size == 1) { return; } int t = tile++; int s = size / 2; if (dr < tr + s &&

#include<iostream>#include<string>#include<malloc.h>using namespace std;typedef struct NodeList{ string num; string name; int chinese; int math; int english; struct NodeList* next;}List;void create(List* &L){ int i; Li

#include<iostream>#include<cstdio>#include<stdlib.h>using namespace std;typedef struct BiTnode{ int data; struct BiTnode* Lchild, * Rchild;}BiTnode, * BiTree;int create(BiTree* T){ int ch, temp; cin >> ch; temp = getcha

#include<stdio.h>#include<stdlib.h>#include<string>#include <windows.h>#include<tlhelp32.h>#define N 10struct pb{ int ko; int no; int cha;};typedef struct pb PCB;PCB a[N];int showallproc(){ PROCESSENTRY32 pe32;

#include <iostream>#include <string>#include<iomanip>#include <fstream>using namespace std;#define N 20class Bus{public: Bus(); Bus(int nu, string na, string ty, string st, string te); ~Bus() { } int number; //编号 st

#include<iostream>#include<string>#include<iomanip>#include<fstream>using namespace std;class person{public: person(); person(int nu, int ty, string na, string se, int ag, string par, string st, double pa, person * next);

#include<iostream>#include<string>#include<fstream> //包含文件流对象文件#include<iomanip>using namespace std;class person //员工类的定义{protected: int no; //编号 char name[20]; //姓名 char sex[10]; //性

#include<iostream>#include<fstream>using namespace std;struct student{ int num; char name[30]; char score;};int main(){ student stud[5] = { 1001,"li",85,1002,"Fang",97.5,1004,"Wang",56,1006,"Tian",76.5,1010,"ling",96 }; fstream iofi

#include<fstream>#include<iostream>using namespace std;struct student{ char name[20]; int num; int age; char sex;};int main(){ student stud[3] = { "li",1001,18,'f',"fang",1002,19,'m',1004,17,'f' }; ofstream outfile("stud.dat", ios:

#include<fstream>#include<iostream>using namespace std;void save_to_file(){ ofstream outfile("f2.dat"); if (!outfile) { cerr << "open fa.dat error!" << endl; exit(1); } char c[80]; cin.getline(c, 80); for(int i=0;c+!=

#include<iostream>#include<string>using namespace std;class person{public: person(string = " ", char = ' ', int = 0); void setperson(); void displayperson();private: string name; char sex; int age;};person::person(string n, char s

#include<iostream>#include<cmath>#include<iomanip>#define pi 3.1415926using namespace std;class circle{public: circle() { radius = 0; } circle(double); double area(); friend bool operator >(circle&, circle&); friend

#include<iostream>#include<string>#define m 80using namespace std;int main(){ int i, j, upper, lower, num, space, other; char str[3][m]; upper = 0, lower = 0, num = 0, space = 0, other = 0; for (i = 0; i < 3; i++) { cout <<

#include<iostream>#include<iomanip>#define m 5using namespace std;int main(){ enum weekday{sunday,monday,tuesday,wednesday,thurday,friday,saturday}; int A, B, C, D, E, F, G, loop; weekday day; F = thurday; for(A = sunday;A<=saturda

//实验七 牛顿迭代法#include<iostream>#include<cmath>#define Length 100using namespace std;class NewtonIterationMethod {public: void input(); double function(double x); double derivative(double x); double newtonmethod(double Xo); void analys.

//实验六 二分法和简单迭代法 #include<iostream>#include<cmath>#define Length 10using namespace std;class Extract {public: double fun1(double x); double fun2(double x); void input1(); void input2(); int methodofbisection(); int simpleiterationme.

//实验五 梯形逐次分半算法#include<iostream>#include<cmath>#include<iomanip>#include <chrono>#include <ratio>#define Length 10000using namespace std::chrono;using namespace std;class Trapezoid {public: void input(); double g.

//实验四 复合梯形和辛普森公式#include<iostream>#include<cmath>using namespace std;class formula{public: formula(double a,double b,int n); double function(double x); double Trapezoid(); double Simpson();private: double a; double b; int n;};fo.

//计算机科学数值与方法实验二#include<iostream>#include<cmath>#include<iomanip>using namespace std;#define Length 10double NewtonInterpolation(int n, double* x, double* y, double xi,double newtontime) { double sinx = 0.0; double DifQTable[Leng.

//计算机科学数值与方法实验一#include#include#define Length 100using namespace std;double Lagrange_Interpolation( int n , double * x ,double * y,double xi) {double fx=0.0;for (int i = 0; i <= n; i++) {double l = 1.0;for (int j = 0; j <= n; j++) {if (j !.