我不太难:-CSDN博客

原创 web作业—简历信息管理系统

引言：本系统基于IDEA和Tomcat开发，采用HTML+CSS+JS+Servlet+JSP+Mysql等技术实现了用户区分、权限设置、注册登录、修改密码、简历信息的增删改查和导入导出Excel文件等功能。成果展示登录/注册/修改密码页面管理员页面普通用户页面...

2021-05-31 23:04:05 397 8

题目链接#include <bits/stdc++.h>using namespace std;int n,l,r,t;long long res = 0;int a[605][605];long long sum[605][605] = {0};int fun(int xl,int xr,int yl,int yr){ int x = xr - xl + 1,y = yr - yl + 1; long long cnt = 0; long long

2021-04-22 22:28:32 827 1

原创 cspISBN号码

题目链接#include <iostream>using namespace std;string str;int main() { cin>>str; int a[9]; a[0] = str[0] - '0'; a[1] = str[2] - '0'; a[2] = str[3] - '0'; a[3] = str[4] - '0'; a[4] = str[6] - '0'; a[5] = str[7

2021-04-11 00:34:44 148

原创 csp窗口

题目链接#include <bits/stdc++.h>using namespace std;int N,M;int x,y,x2,y2;pair<pair<int,int>,pair<int,int>>h[100],h1[100];int toTop(int i){ h[N] = h[i]; for (int j = i; j < N; ++j) { h[j] = h[j+1]; }}

2021-04-11 00:34:35 286

原创 csp画图

题目链接#include <bits/stdc++.h>using namespace std;int n;long long sum = 0;pair<pair<int,int>,pair<int,int>>site[1005];bool judge(int i,int j){ for (int k = 0; k < n; ++k) { if(i >= site[k].first.first &

2021-04-11 00:34:25 238

原创 cspZ字形扫描

题目链接#include <iostream>#include <vector>using namespace std;int n;int main() { cin>>n; int a[n][n]; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { cin>>a[i][j]; }

2021-04-11 00:34:11 117 1

原创 csp数字排序

题目链接#include <iostream>#include <map>#include <vector>#include <algorithm>using namespace std;int n;map<int,int>mp;map<int,int>::iterator it;pair<int,int>h[1005];vector<int>vec;int cmp(pair&lt

2021-04-10 23:33:02 230

原创 csp日期计算

题目链接#include <iostream>#include <map>using namespace std;int a[366];map<int,int>mp;int y,t;bool isR(int year){ if(( year%4 == 0 && year%100 != 0) || ( year % 400 == 0) ) return true; else return fa

2021-04-10 23:31:02 266

原创 csp消除类游戏

题目链接#include <bits/stdc++.h>using namespace std;int n,m;int a[100][100];int length(int i,int j){ int lll = 1; for (int k = j; k < m-1; ++k) { if(a[i][k] == a[i][k+1]) lll++; else break;

2021-04-10 23:28:45 75

原创 csp火车购票

题目链接#include <bits/stdc++.h>using namespace std;int n;int cmd;int main(){ cin>>n; vector<int>site[20]; for (int i = 0,j = 1; j < 101; ++j) { site[i].push_back(j); if(j % 5 == 0) i++;

2021-04-10 23:22:52 111

原创 csp工资计算

题目链接#include<iostream>using namespace std;int S;int T;int main(){ cin>>T; if (T <= 3500) S = T; else if (T <= 4955) S = (T - 3500) / 97 * 100 + 3500; else if (T <= 7655) S = (T - 4955) /

2021-04-10 23:17:58 99

原创 csp小明放学

题目链接！！！注意40%以上的数据会爆int，所以用long long#include <iostream>using namespace std;int n;long long sum;int r,y,g;int circle;int nowTime(int b){ long long ti = (sum + b) % circle; long long ndt = 0; if(ti < y + r) ndt = r + y

2021-04-10 21:40:40 99 2

原创 csp公共钥匙盒

题目链接#include <bits/stdc++.h>using namespace std;int N,K;int key[2010] = {0};pair<int,int>startT[2010],endT[2010];pair<pair<int,bool>,int>a[2010];set<int>st;int j = 0,stime = 0,etime = 0;int cmp(pair<pair<int

2021-04-10 20:12:43 67

原创 csp游戏

题目链接#include <bits/stdc++.h>using namespace std;int n,k;int main() { cin>>n>>k; map<int,bool>baby; int num = 0; for (int i = 0; i < n; ++i) baby[i] = true; int index = 0; int sum = n; while

2021-04-10 20:12:12 172

原创 csp碰撞的小球

题目链接#include <bits/stdc++.h>using namespace std;int n,l,t;void re(bool &a){ if (a) a = false; else a = true;}void judge(pair<int,bool>a[]){ for (int i = 0; i < n; ++i) { for (int j = i+1; j < n; ++j) {

2021-04-09 21:36:11 75

原创 csp买菜

题目链接#include <bits/stdc++.h>using namespace std;int n;int time(pair<int,int>a,pair<int,int>b){ if(a.second<=b.first || b.second<=a.first) return 0; else if(a.first <= b.first && a.second >= b.se

2021-04-09 21:31:54 85

原创 csp二十四点

题目链接#include <iostream>using namespace std;int n;int main() { ios::sync_with_stdio(false); cin>>n; string str; int num[4]; long long sum; string op = " "; while (n--){ cin>>str; sum =

2021-04-09 21:24:06 80

原创 csp小明种苹果（续）

题目链接#include <bits/stdc++.h>using namespace std;int n,m,x,e;long long sum;int main(){ cin>>n; sum = 0; e = 0; map<int,int>cnt; set<int>st; for(int j=0;j<n;++j){ cin>>m; int

2021-04-09 21:20:11 54

原创 csp回收站选址

题目链接#include <iostream>#include <map>using namespace std;int n;int score[5] = {0};int select(map< pair<int,int> , int>mp,pair<int,int>h){ int sum = 0; pair<int,int>t[4]; t[0].first = h.first + 1;

2021-04-09 21:17:30 60

原创 csp稀疏向量

题目链接#include <iostream>#include <map>using namespace std;int main() { ios::sync_with_stdio(false); int n,a,b; cin>>n>>a>>b; long long sum = 0; map<int,int>mp; int x,y; for (int i = 0;

2021-04-09 21:11:38 152

原创 csp风险人群筛查

题目链接#include <iostream>#include <set>using namespace std;int n,k,t,xl,yl,xr,yr;set<int>st;int main(){ int x,y,count,res = 0; cin>>n>>k>>t>>xl>>yl>>xr>>yr; for (int i = 0; i &

2021-04-09 21:00:56 79

原创 csp称检测点查询

题目链接#include <bits/stdc++.h>using namespace std;int n;int x,y;int cmp(pair<pair<int,int>,int>&a,pair<pair<int,int>,int>&b){ int s1 = (a.first.first - x) * (a.first.first - x) + (a.first.second - y) * (a.f

2021-04-09 20:54:52 72

原创 csp期末预测之最佳阈值

题目链接#include <bits/stdc++.h>using namespace std;int cmp(pair<int,int>&a,pair<int,int>&b){ if(a.first == b.first) return a.second<b.second; return a.first < b.first;}int cmp1(pair<int,int>&a

2021-04-09 20:39:36 258

原创 csp期末预测之安全指数

题目链接#include <iostream>using namespace std;int main() { int n; cin>>n; int a,b; long long sum = 0; while (n--){ cin>>a>>b; sum += a * b; } if (sum < 0) cout<<0;

2021-04-09 20:31:18 129

weixin_45686899的博客