qq_41983962的博客

201809 1.卖菜 #include <bits/stdc++.h> using namespace std; int main() { int n,i,price[1005],new_price[1005]; cin>>n; for(i=0;i<n;i++) cin>>price[i]; new_price[0]=(price[0]+price[1])/2; new_price[n-1]=(price[n-1]+price[n-2])/2; f

1.小中大 #include <stdio.h> int main() { int i,n,t,a[100005],flag=0,temp=0; int a_min,a_max,a_mid; float a_middle; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&t); a[i]=t; } if(a[n-1]>a[0]) flag=1; if(flag==0) { a_max=a

201812 1.小明上学 #include <bits/stdc++.h> using namespace std; int main() { int r,y,g; cin>>r>>y>>g; int i,n,a,b,sum=0; cin>>n; for(i=0;i<n;i++) { cin>>a>>b; if(a==0) sum+=b; else if(a==1) sum+=b;

202006 ccf模拟 1.线性分类器 #include <bits/stdc++.h> using namespace std; struct point{ int x; int y; char c; }p[1005]; int main() { int n,m,i,j,a,b,c,flag; cin>>n>>m; int result,pri[25]; for(i=0;i<n;i++) cin>>p[i].x>>p[i

202009 CSP模拟 01检测点查询 #include <iostream> #include <algorithm> #include <utility> using namespace std; const int N=205; pair<int,int>p[N]; bool cmp(pair<int,int>a,pair<int,int>b) { if(a.second!=b.second) return a.secon