ZiQqing的博客

北京地铁线路查询系统

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

3个系数、b、用输，并根据的大小判断是否有实数根 有两实数，输出“方程有两个实数根分别为:1 2”有一个实数根，输出“程有一个实数根为:1”(保留3位小数，并进行四舍五入)，否则输出“方程没有实数根”样例1:输入:152输出:方程有两个实数根分别为:-0.438 -4.562样例2:输入:2-42输出:方程有一个实数根为: 1.000样例3:输入:123输出:方程没有实数根

乔普发现了藏宝图的和密，他打算去挖宝藏。可他来到宝藏入口处，要知道密码才能进入宝藏。经过观察,发现逵个密码的规律并不难，根据入口处石门上的字符串，将字符串里的所有数字（连续在一起的数字算一个数字）加起来，就是这个密码。例如，字符串asd123asd4b，对应的密码应该为:123+4=127.输入格式:第一行一个字符串。(不包含空格)输出格式:一个整数表示密码。输入样例1: asd123asd4b输入样例1: 127

编写程序显示4号影厅的座位图。影厅是9排座位，每排有9个座位。要求:以方阵的形式显示座位图没有订票的座位显示0，订票的座位显示1每排座位左侧显示排号1-9

//实验八 高斯消去法和LU三角分解法#include<iostream>#include<cmath>#define Length 10using namespace std;class DirectMethod {public: void gaussinput(); void luinput(); void gausselimination(); void lutriangulationmethod(); void gaussdisplay(); voi.

//闰年与非闰年的判定#include<iostream>using namespace std;int main(){ int year; cout << "please enter a year :"; cin >> year; if ((year % 4 == 0 && year % 100 != 0) || year % 400 == 0)//判断是否为闰年 cout << year << " is ";

//求100-200之间的所有素数#include<iostream>#include<cmath>#include<iomanip>using namespace std;int main(){ int i, k, m, n = 0; bool prime; for (m = 101; m<= 200;m=m+1)//选取100-200之间的素数 { prime = true; k = int(sqrt(m)); for (i =

//有五种颜色的球若干，分别取出三种球，要求颜色各不相同，并输出每一个情况#include<iostream>#include<iomanip>using namespace std;int main(){ enum color{red,yellow,blue,white,black}; color pri; int i, j, k, n, loop; n = 0; cout << "the result for:" << endl; f

//快速排序算法#include<iostream>using namespace std;void quickSort(int array[],int low,int high){ int pivot,p_pos,i,t; if(low<high){ p_pos=low; pivot=array[p_pos];//将第1个设置为枢纽 for(i=low+1;i<=high;i++){ if(array[i]<pivot){//判断排序顺序，该顺序为

//线性表的基本操作#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 length 100using namespace std;//以重量为贪心准则void WeightCriterion(int n, int c, int* wc, double* vc){ int i, j, weight; double w[length], v[length], value; for (i = 1; i <= n; i++)

//活动安排问题#include<iostream>#include<iomanip>#define Length 24using namespace std;//使用“将结束时间早的活动尽量先排"作为贪心准则。void GreedySelectorEndTime(int n, int s[],int f[]){ int i, j, t, temp, end[Length], a[Length], num = 1; for (j = 1; j <= n - 1

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) {

#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<iomanip>using namespace std;int main(){ double T[5], f[5], f0, m; cout << "请输入个质量对应的频率" << endl; for (int i = 0; i < 5; i++) { cin >> f+; T+ = 1.0 / pow(f+, 2); } for (int i = 0; i &

#include<iostream>#include<cmath>using namespace std;class scale{public: scale(double=0.0, double=0.0, double=0.0, double=0.0, int=0, int=0); void get_value(); void function(); void display();private: double A, B, C, m; int i, n;};

#include<iostream>#include<cmath>#define pi 3.1415926using namespace std;int main(){ double sum1 = 0, sum2 = 0, asum1 = 0.0,asum2=0; double s[5], average1, average2, u1, u2; double U1, U2, U, B, d[5]; int i; cout << "please inpu

#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<string>#include<iomanip>using namespace std;bool flag = false;int main(){ string name[50], find_name; string exchange_name; int n, i, j, num[50]; float score[50], temp; int k; cout << "please i

#include<iostream>#include<cmath>using namespace std;int main(){ double m(int a, int b, int c); double n(int a, int b, int c); double p(int a, int b, int c); double a, b, c, x, x1, x2, d; cout << "please enter the a,b,c:"; cin .

#include<iostream>#include<stdio.h>#include<math.h>#define N 11using namespace std;//初始化void init(int track[],int track2[]){ int i ; cout<<"请输入访问磁道序列：\n"; for (i=0;i<N;i++){ cin>>track[i]; track2[i] = track[i]

#include<iostream>using namespace std;void quickSort(int array[],int low,int high){ int pivot,p_pos,i,t; if(low<high){ p_pos=low; pivot=array[p_pos];//将第1个设置为枢纽 for(i=low+1;i<=high;i++){ if(array[i]<pivot){//判断排序顺序，该顺序为由小到大

//线性表的基本操作#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<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.