自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(63)
  • 收藏
  • 关注

原创 学生管理系统

以上是系统大致功能的介绍MYSQL版本为8.2.0MYSQL + JAVA + SWING 编程实现的一个学生成绩管理系统软件MYSQL eclipse Navicat学生成绩管理系统坑点eclipse新版MYSQL方式得变化eclipse与MYSQL之间的编码格式得一致https://blog.csdn.net/weixin_44193041/article/details/106575698连接新版MYSQL相对于旧版部分语句失效所以使用MYSQL语句时得考虑新版Express.

2020-06-05 18:35:54 1030

原创 oneApi实现并⾏排序算法

归并排序是⼀种分治算法,其基本原理是将待排序的数组分成两部分,分别对这两部分进行排序,然后将已排。少对全局内存的访问次数,从而提高排序的效率。需要注意的是,在实际应用中,要考虑到数组大小、线程块大小、数据访问模式等因素,来设计合适的算法和。将待排序的数组分割成多个较小的子数组,并将这些⼦数组分配给不同的线程块进行处理。参数设置,以充分利用目标计算硬件GPU的并行计算能力,提高排序的效率和性能。通过多次迭代,不断合并相邻的有序⼦数组,直到整个数组有序。每个线程块内部的线程协作完成子数组的局部排序。

2023-12-03 20:47:04 270

原创 苹果叶面病害分析及代码生成系统使用指南

一、代码模版创建1.侧边控制模块更为专业具体相关设置可以在以下界面阅读官方文档,本系统采用的是streamlit2.1.0版本。streamlit说明侧边控制模块必须包含以下内容,import streamlit as stdef show(): inputs = {} with st.sidebar: return inputsif __name__ == "__main__": show()在def show()函数内可以编写参数

2022-05-30 23:15:53 332 2

原创 python蓝桥杯从入门到~

输入与输出输入数组输入:可以提前定义a = [0 for i in range(1000)]或者arr = list(map(int,input().split()))输出import mathpi = math.pip = -1*piprint(pi)print('%.4f' % pi)# 2,前面补充前导0表示月份a = 2 # 2月输出02b = 11 # 11月输出11print('%02d' % a)print('%02d' % b)print('%d %d'

2021-10-28 09:42:00 608

原创 蓝桥杯python组国赛复盘

却道一句当时只道是寻常python国赛复盘我是个c++选手,python就国赛前学了半个下午加晚上,省赛前学了半天。所以填空题部分还是选择了,用c++编程,机房提供了DEV还是很不错的print(200/8)# 答案是25#include <iostream>#include <cstring>#include <algorithm>#include <stdio.h>using namespace std;typedef long

2021-06-17 13:02:57 2970 21

原创 13年12月CCF_CSP

CSP冲冲冲acwing 3192出现次数最多的数给定 nn 个正整数,找出它们中出现次数最多的数。如果这样的数有多个,请输出其中最小的一个。输入格式输入的第一行只有一个正整数 nn,表示数字的个数。输入的第二行有 nn 个整数 s1,s2,…,sns1,s2,…,sn。相邻的数用空格分隔。输出格式输出这 nn 个次数中出现次数最多的数。如果这样的数有多个,输出其中最小的一个。数据范围1≤n≤10001≤n≤1000,1≤si≤100001≤si≤10000输入样例:6

2021-02-15 10:54:34 161

原创 牛客挑战赛47

牛客挑战赛47A**多维的更相减损术得gcd(x,y,z) = gcd(x,y-x,z-y) **则gcd(a1+k,a2+k,a3+k…,an+k) = gcd(a1+k,a2-a1,a3-a2,a4-a3…,an-an-1)提前排好序#include <iostream>#include <algorithm>using namespace std;const int maxn = 1e5+10;long long a[maxn],n;int main(){

2021-01-10 12:11:20 233

原创 “红旗杯“第十四届东北地区大学生程序设计竞赛-热身赛

Problem AProblem DescriptionMo’s algorithm can solve some difficult data structure problems. Like this: You are given an array a1,a2,…,an and m queries. In each query, we want to get the mode number(the value that appears most often in a set of data) of

2020-10-10 14:15:23 1502

原创 CodeforcesRound#668

Codeforces Round #668 EditorialA题目链接A题A. Permutation Forgerytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation of length ???? is an array consisting of ???? distinct integers from 1 t

2020-09-09 17:07:01 295

原创 智算之道第一场

第一题#include<iostream>using namespace std;int main(){ int n,t; cin>>t; while(t--) { cin>>n; for(int i=1;i<=n;i++) cout<<1<<" "; cout<<endl; } return 0;}第二题#include<iostream>#include<

2020-07-12 21:32:31 2274 6

原创 Codeforces Round #655 (Div. 2)

Codeforces Round #655 (Div. 2)A. Omkar and CompletionA题time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have been blessed as a child of Omkar. To express your gratitude, please solve this probl

2020-07-12 15:59:59 350

原创 PAT甲1140字符串

PAT甲1140字符串题目链接1140 Look-and-say Sequence (20分)Look-and-say sequence is a sequence of integers as the following:D, D1, D111, D113, D11231, D112213111, …where D is in [0, 9] except 1. The (n+1)st number is a kind of description of the nth number. For e

2020-06-12 13:15:23 155

原创 PAT甲1005字符串

PAT甲1005字符串题目链接1005 Spell It Right (20分)Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each input file contains one test case. Each case occupies

2020-06-12 13:05:21 140

原创 PAT甲1035字符串

PAT甲1035题目链接1035 Password (20分)To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (z

2020-06-12 12:18:02 206

原创 PAT甲1077字符串

PAT甲1077题目链接1077 Kuchiguse (20分)The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as a reflection of the speaker’s personality. Such a preference is called “Kuchiguse” and is of

2020-06-12 12:11:51 202

原创 PAT甲1112字符串

PAT甲11121112 Stucked Keyboard (20分)On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.Now given a resulting string on screen

2020-06-12 12:05:06 135

原创 Mac下登陆mysql

以下操作皆为终端操作vim ~/.bash_profile在文件中加入export PATH=$PATH:/usr/local/mysql/bin保存退出使其生效source ~/.bash_profile终端输入mysql -u root -p然后输入密码即可登陆

2020-06-06 09:45:43 425

原创 mysql创建班级,院系,专业

解释:以下数据库语句,可以在终端运行,打开mysql,然后运行也可以连接上mysql数据库的可视化工具中选中执行,输入数据库代码运行即可。以下数据库只插入了18级计算机科学与技术专业,软件工程专业,网络工程专业。还有1-9个班。所以程序操作数据库在操作这几个班时不会出错。若要操作更多专业年级,更新数据库内容即可create database StudentSystemDao;use StudentSystemDao;create table tb_Department( #所属院系表De

2020-06-05 18:33:41 7190

原创 mysql8.0.20桥接方式

java连接8.0.20与之前版本有些不同首先将url原来的com.mysql.jdbc.Driver改为com.mysql.cj.Driver此外mysql8.0不需要ssl连接所以要显示关闭最终url可以设置为jdbc:mysql://localhost/数据库名?useSSL=FALSE&serverTimezone=UTC当然如果中文连接到数据库失败的话可以考虑以下几种方式(1)将workspace 改为UTF-8编码(2)将text改为UTF-8编码为什么呢:为

2020-06-05 18:15:15 789 2

原创 PAT甲1022

10221022 Digital Library (30分)A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any quer

2020-05-29 21:29:55 156

原创 PAT甲1063Set的使用

10631063 Set Similarity (25分)Given two sets of integers, the similarity of the sets is defined to be N​c​​ /N​t​​ ×100%, where N​c​​ is the number of distinct common numbers shared by the two sets, and N​t​​ is the total number of distinct numb

2020-05-28 18:22:48 114

原创 PAT甲1047Map的使用

PAT10471047 Student List for Course (25分)Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.Input Specification:

2020-05-27 12:45:03 112

原创 PAT甲1039Map的使用

PAT10391039 Course List for Student (25分)Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes for a query.

2020-05-27 12:18:02 118

原创 PAT甲1054Map的使用

PATA10541054 The Dominant Color (20分)Behind the scenes in the computer’s memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called the dominant color. A

2020-05-27 12:04:23 113

原创 codeforces round 644 div3

题目链接ABCDEA. Minimal Squaretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFind the minimum area of a square land on which you can place two identical rectangular ????×???? houses. The sides o

2020-05-27 11:43:56 482

原创 PAT甲1065 简单模拟

坑点:溢出,当表现为负溢出,当a,b都大于0时,表示a+b>c,当表现为正溢出,且当a,b都小于0,时表示a+b<c,其它类型则正常判断。坑点在于刚好在long long 的界限边缘,存在溢出可能。代码:#include<iostream>using namespace std;typedef long long ll;ll a,b,c,res;int main(){ int t; cin>>t; for(int i=1;i<=t;i++)

2020-05-17 20:09:24 132

原创 PAT甲1046 简单模拟

题目链接思路:用前缀和计算前缀的和为多少,然后判断两种方法直接到还是走两段的付出少,记为ans代码:#include<iostream>using namespace std;const int maxn=1e5+7;typedef long long ll;ll sum[maxn],total;int a[maxn];void pd(int &x,int &y){ int t; if(x>y) { t=x; x=y; y=t; }

2020-05-17 20:05:25 102

原创 PAT甲1042 简单模拟

题目链接代码:#include<iostream>#include<string.h>#include<stdio.h>using namespace std;const int N = 54;int current[N];int next[N];int trans[N];char t[5]={'S','H','C','D','J'};int main(){ int k; cin>>k; for(int i=1;i<=N;i

2020-05-14 15:10:04 82

原创 PAT甲1124 简单模拟

题目链接代码:#include<iostream>#include<set>using namespace std;const int maxn=1004;string s[maxn];string ans[maxn];set<string> st;int main(){ int m,n,k; cin>>m>>n>>k; for(int i=1;i<=m;i++) cin>>s[i];

2020-05-14 07:52:36 142

原创 PAT甲1011 简单模拟

题目链接代码:#include<iostream>#include<algorithm>using namespace std;struct node{ double a; char c;};node A[4][4];bool cmp(node a,node b){ return a.a>b.a;}int main(){ for(int i=1;i<=3;i++) { for(int j=1;j<=3;j++) { c

2020-05-13 12:58:20 111

原创 PAT甲1036 简单模拟

题目链接代码#include<iostream>#include<algorithm>#include<vector>using namespace std;struct node{ string name; string id; int score;};vector<node> v1,v2;bool cmp(node a,node b){ return a.score<b.score;}int main(){ int

2020-05-13 12:36:41 94

原创 PAT甲1006 简单模拟

A1006题目链接#include<iostream>using namespace std;int hour=3600,minute=60;struct node{ int start; int endd;};int main(){ int n; cin>>n; int start=24*3600; int endd=0; string anss,anse,str; int a,b,c,k1,k2; for(int i=1;i<=n;i++)

2020-05-13 12:19:15 101

原创 PAT甲1008 简单模拟

题目链接模拟即可代码:#include<iostream>using namespace std;int main(){ int n,t,ans,k; cin>>n; ans=n*5; cin>>t; ans+=t*6; for(int i=2;i<=n;i++) { cin>>k; if(k-t==0) continue; else if(k-t>0) { ans+=(k-t)*6; }

2020-05-13 12:16:37 84

原创 codeforces round 641div2

codeforces round 641div2好久没写博客了额A. Orac and Factorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOrac is studying number theory, and he is interested in the properties of divisors.For two pos

2020-05-13 11:14:11 149

原创 2020蓝桥省模拟赛

2020蓝桥省模拟赛AKA填空题问题描述  将LANQIAO中的字母重新排列,可以得到不同的单词,如LANQIAO、AAILNOQ等,注意这7个字母都要被用上,单词不一定有具体的英文意义。  请问,总共能排列如多少个不同的单词。答案提交  这是一道结果填空的题,你只需要算出结果后提交即可。本题的结果为一个整数,在提交答案时只填写这个整数,填写多余的内容将无法得分。答案1372...

2020-04-19 15:25:46 224

原创 牛客算法周周练2

牛客算法周周练2题目链接A#include<bits/stdc++.h>#define sc(x) scanf("%lld",&x);#define pf printf#define rep(i,s,e) for(int i=s;i<=e;i++)#define dep(i,e,s) for(int i=e;i>=s;i--)using namesp...

2020-04-15 19:54:21 147

原创 Codeforces Round #634 (Div. 3)

Codeforces Round #634 (Div. 3)AA. Candies and Two Sisters(题目链接)A. Candies and Two Sisterstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTh...

2020-04-15 18:09:20 319

原创 洛谷 传智杯

传智杯:没ak。。。A 软工实习题目链接题意:看题易知解题思路:sort排序每一列,即每一组队伍的评分。然后每一列不合格数值剔除,然后再计算每个人,再sort排序。注意,分数相同按照字母序小的在前面,还有四舍五入,函数用round。代码:#include<bits/stdc++.h>#define sc(x) scanf("%lld",&x);#define...

2020-04-13 18:08:06 1662

原创 codefoces Round 633

codefoces Round #633A题目链接点击就进去了题意:菱形的构造方法,这个题意还是直接看链接原题好理解题解:易知,每次竖着放,然后就是n题解#include<iostream>using namespace std;int main(){ int t; cin>>t; while(t--) { int n; cin>&g...

2020-04-13 16:29:33 150

原创 牛客练习赛61

牛客练习赛61题目链接点击就进去了A题意:你是一个勇士要去杀怪,自己有h滴血,然后a是自己的攻击力,H是怪物的血,A是怪物的攻击力。你每次能打n只怪物,不过这n只怪物也会打你,你得保证自己活着的前提下杀最多只怪物,问你能最多杀多少只怪物,如果能杀无数只则输出-1。题解:暴力吧。设i是你能杀死的怪物个数。计算出你杀一个怪物需要K次,然后怪物则会打你K-1次,则你可以杀n/(k-1)*y)只怪...

2020-04-13 16:11:25 164

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除