CCF/CSP
孤舟独钓寒江雪
这个作者很懒,什么都没留下…
展开
-
CCF-CSP_202006(第19次)
1-线性分类器#include<iostream>#include<vector>using namespace std;typedef struct point { int x; int y;}P;typedef struct line { int k0, k1, k2;}L;bool Classify(vector<P> A, vector<P> B, L line);//判断某条直线是否满足条件int m原创 2021-02-04 12:26:29 · 123 阅读 · 0 评论 -
CCF-CSP_201912(第18次)
1.报数#include<cstdio>bool judge(int n){ int t = 0; while(n && t!=7){ t = n%10; n /= 10; } return t == 7 ? true : false;}int main(){ int num ,total = 1; int skip[5] = {0}; scanf("%d", &am原创 2021-02-04 12:25:56 · 114 阅读 · 0 评论 -
CCF-CSP_201909(第17次)
1. 小明种苹果#include <iostream>using namespace std;int main(){ int n, m, sum = 0, num = 0, max = 1; scanf("%d%d",&n, &m);//the total number of trees or Rounds for(int i = 1; i <= n; i++){ int t , k, f = 0;原创 2021-02-04 02:18:56 · 103 阅读 · 0 评论 -
CCF-CSP_201903(第16次)
1.小中大#include <iostream>#include <algorithm>using namespace std;const int MAXN=100010;int main(){ int n, iMax, iMin, arr[MAXN]; double iMid; scanf("%d", &n); for(int i = 0; i < n; i++) scanf("%d", &ar原创 2021-02-04 02:18:14 · 118 阅读 · 0 评论 -
CCF-CSP_201812(第15次)
1.小明上学#include <stdio.h>#include <string.h>#define MAXN 105using namespace std;int main(){ int r, y, g, n, k, t, ans = 0; //Red[0,r) Green[r, r+g) Yello[r+g, r+g+y) scanf("%d%d%d", &r, &y, &g); scanf("%d", &原创 2021-02-03 23:38:07 · 95 阅读 · 0 评论 -
CCF-CSP_201809(第14次)
1. 卖菜#include<iostream>using namespace std;int a[100000];//a[0],a[n+1]=0;int main(){ int n; scanf("%d", &n); for(int i = 1;i <= n; ++i) scanf("%d", &a[i]); for(int i = 1;i <= n; ++i){ int ans =原创 2021-02-03 23:37:34 · 86 阅读 · 0 评论 -
CCF-CSP_201803(第13次)
1. 跳一跳//序列处理/* CCF201803-1 跳一跳 */#include <iostream>using namespace std;int main(){ int cur, ans = 0, plus = 0; //while(~scanf("%d",&cur) && cur) while(scanf("%d", &cur) != EOF && cur) { ans += cur;原创 2021-02-03 02:23:55 · 165 阅读 · 0 评论 -
CCF-CSP_201712(第12次)
1.最小差值#include <stdio.h>#include <algorithm>#define MAXN 1005#define INF 0x3f3f3f3fusing namespace std;int arr[MAXN];int main(){ int n; scanf("%d", &n); for(int i = 0;i < n; ++i) scanf("%d", &arr[i])原创 2021-02-03 02:23:02 · 187 阅读 · 0 评论 -
CCF/CSP-201709(第11次)
1.打酱油#include <iostream>#include <algorithm>using namespace std;int main() { int n, count=0; cin >> n; while(n > 0){ if(n >= 30 && n < 50){ count += 4; n -= 30;原创 2021-01-31 02:38:03 · 106 阅读 · 0 评论 -
CCF/CSP-201703(第10次)
1.分蛋糕#include <stdio.h>#define MAXN 1005int main(){ int n, k; int cur = 0, ans = 0, cake; scanf("%d%d", &n, &k); for(int i = 0;i < n; ++i){ scanf("%d", &cake); cur += cake; if(cur >= k){原创 2021-01-30 01:54:18 · 106 阅读 · 0 评论 -
CCF-CSP_201612(第9次)
1. 中间数/* CCF201612-1 中间数 */#include <iostream>#include <map>using namespace std; int main(){ map<int, int> m; int n, v; // 输入数据,构建Map cin >> n; for(int i=0; i<n; i++) { cin >> v;原创 2021-01-30 01:53:42 · 85 阅读 · 0 评论 -
CCF-CSP_201609(第8次)
1. 最大波动//水题#include<iostream>using namespace std;const int inf=999999999;int main(){ int n,max=-inf,pre,now; scanf("%d",&n); //n>=2 for(int i=0;i<n;i++){ scanf("%d",&now); if(i!=0&&max<abs(no原创 2021-01-30 01:52:53 · 92 阅读 · 0 评论 -
CCF-CSP_201604(第7次)
1-折点计数//水题#include<iostream>using namespace std;const int maxn=10000;int a[maxn];int main(){ int n,count=0; scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=1;i<=n-2;i++) if((a[i]&原创 2021-01-30 01:52:20 · 89 阅读 · 0 评论 -
CCF-CSP_201512(第6次)
1. 数位之和//水题#include<iostream>using namespace std;int main(){ int n,sum=0; scanf("%d",&n); while(n){ sum+=n%10; n/=10; } cout<<sum<<endl; return 0;}20151220 132. 消除类游戏/* CCF201512-2原创 2021-01-30 01:51:44 · 104 阅读 · 0 评论 -
CCF/CSP-201509(第5次)
1. 数列分段#include<stdio.h>int main(){ int n, ans = 0, pre = -1, cur; scanf("%d", &n); for(int i = 0; i < n; ++i){ scanf("%d", &cur); if(cur != pre) ans++; pre = cur; } printf("%d\n", ans);原创 2021-01-30 01:51:07 · 113 阅读 · 0 评论 -
CCF/CSP-201503(第4次)
1. 图像旋转#include<iostream>using namespace std;const int maxn=1010;int a[maxn][maxn];int main(){ int n,m; cin>>n>>m;//n行,m列 for(int i=0;i<n;i++) for(int j=0;j<m;j++) cin>>a[i][j]; for(in原创 2021-01-30 01:50:25 · 97 阅读 · 0 评论 -
CCF/CSP-201412(第3次)
1. 门禁系统#include<stdio.h>#define MAXN 1005int main(){ int n,d; int arr[MAXN] = {0}; scanf("%d",&n); while(n--){ scanf("%d",&d); printf("%d ",++arr[d]); } return 0;}5 1 2 1 1 31 1 2 3原创 2021-01-30 01:49:25 · 90 阅读 · 0 评论 -
CCF/CSP-201409(第2次)
1. 相邻数对#include<stdio.h>#include<algorithm>#define MAXN 1005using namespace std;int num[MAXN];int main(){ int n, ans = 0; scanf("%d", &n); for(int i = 0; i < n; ++i) scanf("%d", &num[i]); sort(num, nu原创 2021-01-30 01:43:18 · 81 阅读 · 0 评论 -
CCF/CSP-201403(第1次)
1. 相反数#include<iostream>#include<map>using namespace std;int main(){ int n, t, count = 0; map<int,int> mp; scanf("%d", &n); for(int i = 0;i < n; ++i){ scanf("%d", &t); mp[abs(t)]++;原创 2021-01-30 01:41:12 · 95 阅读 · 0 评论 -
CCF/CSP-201312(第0次)
1. 出现次数最多的数#include <iostream>#include <map>#define INF 0x3f3f3f3fusing namespace std;int main(){ int n, ans = INF, count = 0; map<int,int> mp; cin >> n; while(n--){ int v; cin &g原创 2021-01-29 11:09:06 · 72 阅读 · 0 评论