恨君秋月夜-CSDN博客

原创挖坑

好多题都没有做题思路，也就是完整的题解，有时间一道一道补上立博客为证

2020-12-24 02:43:21 195

原创【QBKbupt】洛谷P2956The Robot Plow G

（题目链接：https://www.luogu.com.cn/problem/P2956）#include<bits/stdc++.h>using namespace std;int main(){ int field[250][250],X,Y,I,XII,YII,Xur,Yur,ans; memset(field,0,sizeof(field)); ans=0; scanf("%d%d%d",&X,&Y,&I); for(int i=1;i&l

2020-12-15 23:21:45 202

原创【QBKbupt】洛谷P2524Uim的情人节礼物·其之弐

（题目链接：https://www.luogu.com.cn/problem/P2524）#include<bits/stdc++.h>using namespace std;int main(){ int tmp,pos,s,n,number=1,symbol=1,input[10],data[10]; char c; scanf("%d\n",&n); for(int i=1;i<=n;i++) { scanf("%c",&c); input

2020-12-15 22:59:19 193

原创【QBKbupt】洛谷P2525Uim的情人节礼物·其之壱

（题目链接：https://www.luogu.com.cn/problem/P2525）#include<bits/stdc++.h>using namespace std;int main(){ int tmp,pos,s,n,number,symbol=1,input[10],data[10],memory[10]; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&input[i]);

2020-12-15 22:59:13 165

原创【QBKbupt】第十章内部排序 D. 内部排序练习4

#include<bits/stdc++.h>using namespace std;int main(){ int a,b,c,n,data[10001]; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&data[i]); } sort(data+1,data+n+1); for(int i=n;i>=3;i--) { a=data[i]; b=data[i-1]; ..

2020-12-15 22:58:35 84

原创【QBKbupt】第十章内部排序 C. 内部排序练习3

#include<bits/stdc++.h>using namespace std;int main(){ int cnt=0,n,num[10][101],data[101]; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&data[i]); } memset(num,0,sizeof(num)); for(int i=1;i<=n;i++) { num[data[i]%1..

2020-12-15 22:58:06 83

原创【QBKbupt】第十章内部排序 B. 内部排序练习2

#include<bits/stdc++.h>using namespace std;int m;void quicksort(int s[],int a,int b){ int left=a,right=b,num; if(left<right) { num=s[left]; while(left!=right) { while(right>left&&++m&&s[right]>=num) ri..

2020-12-14 17:50:30 97

原创【QBKbupt】第十章内部排序 A. 内部排序练习1

#include<bits/stdc++.h>using namespace std;void quicksort(int s[],int a,int b){ int left=a,right=b,num; if(left<right) { num=s[left]; while(left!=right) { while(right>left&&s[right]>=num) right--; s[left]=s[r.

2020-12-14 17:50:03 99

原创【QBKbupt】第九章查找 D. 查找练习4

#include<bits/stdc++.h>int* search(int* N, int S, int T){ int* R=(int*)malloc(sizeof(int)*(2)); R[0]=-1,R[1]=-1; int l=0,r=S-1; while(l<=r) { if(N[l]!=T) l++; else R[0]=l; if(N[r]!=T) r--; else R[1]=r; if(R[0]!=-1&&R[1]!..

2020-12-14 17:49:25 127

原创【QBKbupt】第九章查找 C. 查找练习3

#include<bits/stdc++.h>using namespace std;struct Node{ int data; Node *p;};int main(){ int n,m,t,s,a[105],b[105]; Node c[105],*current,*head; double ans1=0,ans2=0; scanf("%d%d",&n,&m); for(int i=0;i<n;i++) scanf("%d",&a[.

2020-12-14 17:49:11 115

原创【QBKbupt】第九章查找 B. 查找练习2

#include<bits/stdc++.h>using namespace std;struct Node{ int x; double y;};int main(){ Node a[105]; int t=1,n,data[105]; double p[105],ans=0; scanf("%d",&n); data[0]=1; a[1].x=1; for(int i=1;i<=n;i++) scanf("%d %lf",&data[i].

2020-12-14 17:48:54 110

原创【QBKbupt】第九章查找 A. 查找练习1

#include<bits/stdc++.h>using namespace std;int main(){ int d,l,r,n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d%d%d",&d,&l,&r); if((l!=-1&&l>=d)||(r!=-1&&r<=d)) { printf("NO"); return.

2020-12-14 17:48:38 121

原创【QBKbupt】第七章图 F. 图练习6

#include<iostream>using namespace std;void findH(int,int);const int N=21;int vis[N],a[N][N],judge;int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%d",&a[i][j]); vis[0]=1; findH(n,0); jud..

2020-12-14 17:48:08 100

原创【QBKbupt】第七章图 E. 图练习5

#include<bits/stdc++.h>const int MAX=0x3f3f3f3f;using namespace std;int main(){ int n,w[21][21]; scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) {scanf("%d",&w[i][j]); if(!w[i][j]) w[i][j]=MAX;} for(int i=1;i<=n..

2020-12-14 17:47:45 90

原创【QBKbupt】第七章图 D. 图练习4

#include<bits/stdc++.h>using namespace std;const int MAX=0x3fffffff;int n,a[21][21],v[21],d[21],ans;int prime();int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&a[i][j]); printf("%d",prime()).

2020-12-14 17:47:02 107

原创【QBKbupt】第七章图 C. 图练习3

#include<stdio.h>int main(){ int n,a[25][25],i,j,k,p[25],x,y,ans; scanf("%d",&n); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&a[i][j]); for(i=1;i<=n;i++) p[i]=i; for(i=1;i<=n;i++) { for(j=i+1;j<=n;j++) { if(.

2020-12-14 17:46:52 126

原创【QBKbupt】第七章图 B. 图练习2

#include<bits/stdc++.h>using namespace std;int main(){ int n,sum,a=0,b=0,m[25][25]={0}; scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&m[i][j]); for(int i=1;i<=n;i++) { sum=0; for(int j=1;j<=n.

2020-12-13 12:38:23 128

原创【QBKbupt】第七章图 A. 图练习1

#include<cstdio>#include<cmath>using namespace std;int main(){ int m[25][25]={0}; int n,s,u,v; scanf("%d%d",&n,&s); for(int i=1;i<=s;i++) { scanf("%d%d",&u,&v); m[u][v]=1; m[v][u]=1; } for(int i=1;i<=n;i+.

2020-12-13 12:37:11 88

原创【QBKbupt】第六章树和二叉树 F. 树和二叉树练习6

#include<bits/stdc++.h>using namespace std;struct element{ double weight; int lchild,rchild,parent;};void selectMin(element a[],int n,int &s1,int &s2)//选取权值最小的两个结点{ for(int i=0;i<n;i++) { if(a[i].parent==-1) { s1=i; br.

2020-12-13 12:31:00 80

原创【QBKbupt】第六章树和二叉树 E. 树和二叉树练习5

#include<bits/stdc++.h>struct Node{ int data; int lchild,rchild,parent;};int construct(Node *root,int n,int parent,int pre[110],int in[110],int len);void post(Node *root,int r,int n,int num);void level(Node *root,int Q[110],int n);void find.

2020-12-13 12:29:26 74

原创【QBKbupt】第六章树和二叉树 D. 树和二叉树练习4

#include<cstdio>#include<cmath>using namespace std;int main(){ int n,m,u,x,y,p,q; int d[105]; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d%d%d",&u,&x,&y); if(x>0) d[x]=u; if(y>0) d[y]=u; } scanf(..

2020-12-13 12:27:32 84

原创【QBKbupt】第六章树和二叉树 C. 树和二叉树练习3

#include<cstdio>#include<cmath>using namespace std;int main(){ int n,k,q,father; scanf("%d%d%d",&n,&k,&q); if(q%k<=1) father=q/k; else father=q/k+1; printf("%d\n%d",father,k*q-k+2); for(int i=k*q-k+3;i<=k*q+1;i++) ..

2020-12-13 12:24:07 61

原创【QBKbupt】第六章树和二叉树 B. 树和二叉树练习2

#include<cstdio>#include<cmath>using namespace std;int main(){ int a,n,i=0,N=1; scanf("%d",&n); while(scanf("%d",&a)!=EOF) { N+=((++i-1)*a); } printf("%d",N); return 0;}

2020-12-13 12:22:29 113

原创【QBKbupt】第六章树和二叉树 A. 树和二叉树练习1

#include<cstdio>#include<cmath>using namespace std;int main(){ double m,k; scanf("%lf%lf",&m,&k); printf("%.0lf",(1-pow(k,m))/(1-k)); return 0;}

2020-12-13 12:20:35 63

原创【QBKbupt】第五章数组和广义表 D.数组和广义表练习4

#include<bits/stdc++.h>using namespace std;int main(){ int n1,n2,m1,m2,m3=0,data1[110][5],data2[110][5],data3[10010][5]; int symbol=1,num=0; scanf("%d%d",&n1,&m1); for(int i=1;i<=m1;i++) scanf("%d%d%d",&data1[i][1],&data1[..

2020-12-13 12:16:10 108

原创【QBKbupt】第五章数组和广义表 C.数组和广义表练习3

#include<bits/stdc++.h>using namespace std;int main(){ int a[21][21]={0}; int n,m,x,y,z; scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) { scanf("%d%d%d",&x,&y,&z); a[y][x]=z; } printf("%d %d",n,m); for(int i=1;i&l...

2020-12-13 10:04:21 81

原创【QBKbupt】第五章数组和广义表 B.数组和广义表练习2

#include<bits/stdc++.h>using namespace std;int main(){ int *a; int x=1,y,n=1,ans=0,t; a=(int*)malloc(sizeof(int)*(n+1)); while(scanf("%d",&a[n++])==1) a=(int*)realloc(a,sizeof(int)*(n+1)); n-=2; y=n; while(x!=y) { t=min(a[x],a[y])*..

2020-10-19 22:33:16 78

原创【QBKbupt】第五章数组和广义表 A.数组和广义表练习1

#include<bits/stdc++.h>using namespace std;int main(){ int pos; int i=0; int a[25]; scanf("%d",&pos); while(scanf("%d",&a[++i])==1); i--; for(int j=1;j<=i;j++) { printf("%d",a[(j+i-pos-1)%i+1]); if(j!=i) { printf(" ");.

2020-10-19 21:05:20 56

原创【QBKbupt】第四章串 D.串练习4

#include<bits/stdc++.h>using namespace std;int main(){ char r[105]; int num[105]; int l,i,result=0; scanf("%s",r); l=strlen(r); for(i=1;i<=l;i++) { switch(r[i-1]) { case 'I':num[i]=1;break; case 'V':num[i]=5;break; case 'X'.

2020-10-09 16:47:39 223

原创【QBKbupt】第四章串 C.串练习3

#include<bits/stdc++.h>using namespace std;const int MAX=1000000+5;int main(){ char s[MAX],t[MAX]; int next[MAX]; scanf("%s\n%s",s,t); int s_len=strlen(s); int t_len=strlen(t); int i=0,j=-1; next[0]=-1; while(i<=t_len) { if((t[i]=..

2020-10-09 16:46:30 96

原创【QBKbupt】第四章串 B.串练习2

#include<bits/stdc++.h>using namespace std;int main(){ char s[205],t[205],r[410],x; int flag=0,pos,l1,l2,i; scanf("%s\n%s\n%c",s,t,&x); l1=strlen(s); l2=strlen(t); for(i=0;i<l1;i++) { if(s[i]==x) { flag=1; pos=i; break;.

2020-10-09 16:44:19 96

原创【QBKbupt】第四章串 A.串练习1

#include<bits/stdc++.h>using namespace std;int main(){ char s[30],t[30]; scanf("%s\n%s",s,t); int l1=strlen(s); int l2=strlen(t); int flag; for(int i=0;i<l1;i++) { flag=1; for(int j=0;j<l2;j++) { if(s[i]==t[j]) { flag.

2020-10-09 16:43:00 260

原创【QBKbupt】第三章栈和队列 C.栈和队列练习3

#include<bits/stdc++.h>using namespace std;char *s;double get_number();double operation(double number[],char operate[]);int main(){ s=(char*)malloc(sizeof(char)*1005); scanf("%s",s); printf("%.3lf",get_number());}double get_number(){ dou

2020-10-09 16:41:15 81

原创【QBKbupt】第三章栈和队列 B.栈和队列练习2

#include<bits/stdc++.h>using namespace std;struct lifo{ char *data; int length;};int main(){ char s[105]; lifo a; a.data=(char*)malloc(sizeof(char)*105); a.length=0; scanf("%s",s); for(int i=strlen(s);i>=1;i--) s[i]=s[i-1]; for(int

2020-10-09 16:39:59 87

原创【QBKbupt】第三章栈和队列 A.栈和队列练习1

#include<bits/stdc++.h>using namespace std;struct lifo{ int *data; int length;};struct fifo{ int *data; int length;};int main(){ int n,num; char order[5]; lifo a; fifo b; a.length=0; b.length=0; scanf("%d",&n); a.data=(int*)m

2020-10-09 16:38:58 95

原创【QBKbupt】第二章线性表 C.线性表练习3

#include<bits/stdc++.h>using namespace std;struct Node{ int in; int cn; Node *next;};void init(Node **);void create(Node *,int);void calculate(Node *,Node *,Node *);void print(Node *);int main(){ int n,m; Node *head1,*head2,*head3; ..

2020-09-30 18:05:27 87

原创【QBKbupt】第二章线性表 B.线性表练习2

#include<bits/stdc++.h>using namespace std;struct Node{ int data; Node *next;};int main(){ int n,x,y; char operate[10]; Node head,*ptr,*ptr2; head.data =1; head.next=NULL; ptr=&head; ptr2=&head; scanf("%d",&n); for(int ..

2020-09-30 18:03:04 90

原创【QBKbupt】第二章线性表 A.线性表练习1

A. 线性表练习1

2020-09-30 17:58:28 103

原创【QBKbupt】CSP-201403-2-窗口

#include<bits/stdc++.h>using namespace std;int begin_x[11],begin_y[11],end_x[11],end_y[11],number[11],change[5],n,m,x,y,sym;int main(){ scanf("%d%d",&n,&m); for(int i=1;i<=n;i...

2019-12-09 17:30:26 203

原创【QBKbupt】洛谷P2955奇数偶数Even? Odd?

（题目链接：https://www.luogu.com.cn/problem/P2955）#include<bits/stdc++.h>using namespace std;int n;char a[10005];int main(){ scanf("%d",&n); while(n--) { scanf("%s",a); if((a[strle...

2019-12-09 14:39:52 150

空空如也

空空如也