- 博客(17)
- 收藏
- 关注
RSS订阅原创 PAT B1004
#include <stdio.h> #include <string.h> int main() { int n; scanf("%d",&n); char name[11],id[11],max_name[11],max_id[11],min_name[11],min_id[11]; int score; int max=0,min=0; int max_grade=0,min_grade=100; for(int ...
2022-01-18 00:40:54
352
原创 PAT B1010
#include<cstdio> int main() { int a[1010] = {0}; int k,e,count = 0; while(scanf("%d%d",&k,&e)!=EOF){ a[e] = k; } a[0] = 0; for(int i = 1;i<=1000;i++) { a[i-1] = a[0]; a[0] = 0; if...
2022-01-18 00:40:24
165
原创 PAT B1028
#include<cstdio> struct Person{ char name[10]; int yy,mm,dd; }oldest,youngest,left,right,temp; bool lessequ(Person a,Person b) { if(a.yy!=b.yy) return a.yy <= b.yy; else if(a.mm!=b.yy) return a.mm<=b.mm; else return a.dd = b...
2022-01-18 00:39:53
61
原创 PAT B1041
#include<cstdio> const int maxn = 1011; struct Student{ long long id; int examSeat; }testSeat[maxn]; int main() { int n,m; int seat,examSeat; long long id; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%...
2022-01-18 00:39:28
44
原创 PAT A1002
#include<cstdio> const int maxn = 1111; double p[maxn] = {}; int main() { int n,k,count = 0; double a; scanf("%d",&k); for(int i=0;i<k;i++){ scanf("%d %lf",&n,&a); p[n] += a; } scanf("%d",&k...
2022-01-18 00:36:13
145
原创 PAT A1025
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; struct Student { char id[15]; int score; int location_number; int local_rank;//考场内排名 } stu[30010]; bool cmp(Student a,Student b) { if(a.score...
2022-01-18 00:35:43
39
原创 codeup 5901
#include<cstdio> #include<cstring> const int maxn = 256; bool judge(char str[]) { int len = strlen(str); for(int i=0;i<len/2;i++) { if(str[i] ==str[len-i-1]) return true; else return false; } }...
2022-01-17 22:39:51
45
原创 PAT B1046
#include<cstdio> int faila = 0,failb = 0; int main() { int n; scanf("%d",&n); int a1,a2,b1,b2; while(n>0) { scanf("%d%d%d%d",&a1,&a2,&b1,&b2); if(a2 == a1+b1&&b2 != a1+b1) { ...
2022-01-15 19:56:46
123
原创 PAT B1036
#include<cstdio> int main() { int row,col; char c; scanf("%d %c",&col,&c); if(col%2 == 1) row = col/2+1; else row = col/2; for(int i = 0; i<col; i++) { printf("%c",c); } printf("\n"); for...
2022-01-15 19:56:12
123
原创 PAT B1032
#include<stdio.h> const int maxn = 100000; int school[maxn] = {0}; int main() { int N; scanf("%d",&N); int x,score; for(int i=0; i<N; i++) { scanf("%d %d",&x,&score); school[x]+=score; } int max ...
2022-01-15 19:55:41
71
原创 PAT B1026
#include<cstdio> int main() { int c1,c2; scanf("%d%d",&c1,&c2); int ans = c2-c1; if(ans%100>=50) { ans = ans/100+1; } else ans = ans/100; printf("%02d:%02d:%02d\n",ans/3600,ans%3600/60,ans%60); return 0;...
2022-01-15 19:55:09
165
原创 PAT B1022
#include<cstdio> int main() { int A,B,D; scanf("%d %d %d",&A,&B,&D); int x =A+B; int a[31] = {0}; int num =0,i = 0; while(x) { a[i] = x%D; x = x/D; i++; num++; } for(in...
2022-01-15 19:54:36
44
原创 PAT B1016
#include<cstdio> int main() { long long A,DA,B,DB; long long PA = 0,PB = 0; scanf("%lld%lld%lldd%lld",&A,&DA,&B,&DB); while(A!=0) { if(A%10==DA) { PA = DA +PA*10; } A = A/10; } ...
2022-01-15 19:54:05
106
原创 PAT B1012
#include<cstdio> int main() { int count[5] = {0}; int ans[5] = {0}; int n,temp; scanf("%d",&n); for(int i=0; i<n; i++) { scanf("%d",&temp); if(temp%5 == 0) { if(temp%2 == 0) { ...
2022-01-15 19:53:35
42
原创 PAT B1008
#include<cstdio> const int maxn = 110; int a[maxn] = {0}; int main() { int n,m; scanf("%d%d",&n,&m); m = m%n; int count = 0; for(int i=0;i<n;i++) { scanf("%d",&a[i]); } for(int i=n-m;i<n;i++) ...
2022-01-15 19:53:01
31
原创 PAT A1046
#include<cstdio> #include<algorithm> using namespace std; const int MAXN = 100005; int dis[MAXN],A[MAXN]; int main() { int sum = 0,query,n,left,right; scanf("%d",&n); for(int i=0;i<=n;i++) { scanf("%d...
2022-01-15 19:51:49
39
原创 PAT A1042
#include<cstdio> const int N = 54; char mp[5] = {'s','h','c','d','j'}; int start[N+1],end[N+1],next[N+1]; int main() { int K; scanf("%d",&K); for(int i = 1;i<=K;i++) { start[i] = i; } for(int i = 1;i<=N;i++) ...
2022-01-15 19:50:58
92
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人