![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PAT
霍雨浩——舞麟
这个作者很懒,什么都没留下…
展开
-
1047 Student List for Course (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=40010;vector<int>v[maxn];char mp[maxn][10];bool cmp(int a,int b){ return strcmp(mp[a],mp[b])<0;}int main(){ int n,k; scanf("%d%d",&n,&a.原创 2021-10-28 22:56:37 · 59 阅读 · 0 评论 -
1039 Course List for Student (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int N=40010;const int M=26*26*26*10+11;vector<int>selectcource[M];int getid(char name[]){ int id=0; for(int i=0; i<3; i++) { id=id*26+(name[i].原创 2021-10-27 23:56:43 · 73 阅读 · 0 评论 -
1024 Palindromic Number (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longstruct bign{ int d[1000]; int len; bign() { memset(d,0,sizeof(d)); len=0; }};bign change(char str[]){ bign a; int len=strlen(str); .原创 2021-10-27 23:06:39 · 77 阅读 · 0 评论 -
1023 Have Fun with Numbers (20 分)
#include<bits/stdc++.h>using namespace std;#define ll long longint vis[100];struct bign{ int d[1000]; int len; bign() { memset(d,0,sizeof(d)); len=0; }};bign change(char str[]){ bign a; a.len=s.原创 2021-10-27 22:35:15 · 56 阅读 · 0 评论 -
1096 Consecutive Factors (20 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e5+100;int main(){ ll n; scanf("%lld",&n); ll ansi=0; ll anslen=0; for(ll i=2;i*i<=n;i++) { ll temp=1,j=i; while(1).原创 2021-10-24 23:52:56 · 47 阅读 · 0 评论 -
1078 Hashing (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e4+100;int prime[maxn];bool p[maxn]= {0};void find_prime(){ p[1]=1; int cnt=0; for(int i=2; i<maxn; i++) { if(p[i]==false) {.原创 2021-10-23 00:00:55 · 53 阅读 · 0 评论 -
1015 Reversible Primes (20 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e5+100;int prime[maxn];bool p[maxn]= {0};void find_prime(){// p[1]=1; int cnt=0; for(int i=2; i<maxn; i++) { if(p[i]==false) {.原创 2021-10-22 23:13:05 · 55 阅读 · 0 评论 -
1088 Rational Arithmetic (20 分)
#include<bits/stdc++.h>using namespace std;#define ll long longstruct fraction{ ll up,down;};ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b);}fraction reduction(fraction result){ if(result.down<0) { .原创 2021-10-21 23:55:14 · 65 阅读 · 0 评论 -
1081 Rational Sum (20 分)
#include<bits/stdc++.h>using namespace std;#define ll long longll gcd(ll a,ll b){ if(b==0) return a; return gcd(b,a%b);}struct fraction{ ll up,down;};fraction reduction(fraction result){ if(result.down<0) { .原创 2021-10-21 23:14:38 · 53 阅读 · 0 评论 -
1049 Counting Ones (30 分)
#include<bits/stdc++.h>using namespace std;int main(){ int n,a=1,ans=0; int left,now,right; scanf("%d",&n); while(n/a!=0) { left=n/(a*10); now=n/a %10; right=n%a; if(now==0) ans+=left*a; .原创 2021-10-21 22:30:00 · 54 阅读 · 0 评论 -
1008 Elevator (20 分) (巨水题)
#include<bits/stdc++.h>using namespace std;const int maxn=1e5+100;int q[maxn];int main(){ int n; int ans=0; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&q[i]); } for(int i=1;i<=n;i++) .原创 2021-10-21 22:24:31 · 55 阅读 · 0 评论 -
1104 Sum of Number Segments (20 分)
#include<bits/stdc++.h>using namespace std;int main(){ long double a[100010],sum=0; int n; cin>>n; for(int i=1; i<=n; i++) { long double x; cin>>x; sum+=x*(n+1-i)*i; } printf("%..原创 2021-10-20 23:28:13 · 57 阅读 · 0 评论 -
1069 The Black Hole of Numbers (20 分)
#include<bits/stdc++.h>using namespace std;#define ll long longint cmp(int a,int b){ return a>b;}int main(){ int n; scanf("%d",&n); int p=n; int q[10]; while(1) { memset(q,0,sizeof(q)); for(.原创 2021-10-20 22:47:58 · 48 阅读 · 0 评论 -
1101 Quick Sort (25 分)
#include<bits/stdc++.h>using namespace std;const int maxn=1e5+10;const int inf=0x3fffffff;int a[maxn],leftmax[maxn],rightmin[maxn];int ans[maxn],num=0;int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) { s.原创 2021-10-19 23:54:04 · 43 阅读 · 0 评论 -
1093 Count PAT‘s (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e5+10;const int mod=1000000007;int l[maxn];int r[maxn];int main(){ string s; cin>>s; int cnt=0; for(int i=0;i<s.size();i++) { .原创 2021-10-19 23:36:23 · 51 阅读 · 0 评论 -
1029 Median (25 分) (巨水题)
#include<bits/stdc++.h>using namespace std;const int maxn=2e6+100;int q[maxn];int w[maxn];int main(){ int n,m; scanf("%d",&n); int cnt=1; for(int i=1;i<=n;i++) { scanf("%d",&q[cnt++]); } scanf("%d.原创 2021-10-19 23:34:13 · 51 阅读 · 0 评论 -
1089 Insert or Merge (25 分)
#include<bits/stdc++.h>using namespace std;int q[200];int w[200];int p[200];int main(){ int n; scanf("%d",&n); for(int i=1; i<=n; i++) { scanf("%d",&q[i]); p[i]=q[i]; } for(int i=1; i<=n; .原创 2021-10-19 22:44:11 · 56 阅读 · 0 评论 -
1085 Perfect Sequence (25 分)
#include<bits/stdc++.h>using namespace std;const int maxn=1e5+110;int sum[maxn];int inf=0x3f3f3f;int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",&sum[i]); sum[i]+=sum[.原创 2021-10-18 23:26:29 · 44 阅读 · 0 评论 -
1044 Shopping in Mars (25 分)
#include<bits/stdc++.h>using namespace std;const int maxn=1e5+110;int sum[maxn];int inf=0x3f3f3f;int main(){int n,m;scanf("%d%d",&n,&m);for(int i=1;i<=n;i++){scanf("%d",&sum[i]);sum[i]+=sum[i-1];}for(int i=1;i<=n;i++)原创 2021-10-18 23:02:44 · 49 阅读 · 0 评论 -
1038 Recover the Smallest Number (30 分)
#include<bits/stdc++.h>using namespace std;#define ll long longbool cmp(string a,string b){ return a+b<b+a;}const int maxn=1e4+10;string str[maxn];int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++) { .原创 2021-10-15 22:50:47 · 46 阅读 · 0 评论 -
1067 Sort with Swap(0, i) (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e5+10;int pos[maxn];int main(){int n,ans=0;scanf("%d",&n);int left=n-1;int num;for(int i=0;i<n;i++){scanf("%d",&num);pos[num]=i;if(num==i&&am原创 2021-10-14 23:30:41 · 51 阅读 · 0 评论 -
1037 Magic Coupon (25 分) (水题)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e5+100;int q[maxn];int w[maxn];int cmp(int a,int b){ return a>b;}int main(){ int n,m; scanf("%d",&n); for(int i=1;i<=n;i++) { .原创 2021-10-14 22:45:00 · 52 阅读 · 0 评论 -
1033 To Fill or Not to Fill (25 分) (贪心)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int inf=0x3f3f3f;struct station{ double price,dis;}sta[600];int cmp(station a,station b){ return a.dis<b.dis;}int main(){ double cmax,davg,d; int n;.原创 2021-10-13 23:16:55 · 87 阅读 · 0 评论 -
1070 Mooncake (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longstruct dongxi{ double kucun; double sz; double jz;} q[1005];int cmp(dongxi a,dongxi b){ if(a.jz==b.jz) { return a.kucun>b.kucun; } return .原创 2021-10-12 23:10:20 · 55 阅读 · 0 评论 -
1050 String Subtraction (20 分) (巨水题)
#include<stdio.h>#include<string.h>const int maxn=1e4+100;char q[maxn];char w[maxn];int vis[maxn]={0};int main(){ gets(q); gets(w);// memset(vis,0,sizeof(vis)); for(int i=0;i<strlen(w);i++) { vis[w[i]]=1;.原创 2021-10-12 22:54:32 · 46 阅读 · 0 评论 -
1041 Be Unique (20 分) (巨水题)
#include<bits/stdc++.h>using namespace std;#define ll long longmap<char,int>mp;const int maxn=1e5+100;int vis[maxn];int q[maxn];int main(){ int n; scanf("%d",&n); memset(vis,0,sizeof(vis)); for(int i=1;i<=n;i++).原创 2021-10-12 22:47:02 · 54 阅读 · 0 评论 -
1092 To Buy or Not to Buy (20 分) (水题)
#include<bits/stdc++.h>using namespace std;#define ll long longmap<char,int>mp;int main(){ char q[1020]; char w[1020]; scanf("%s",q); scanf("%s",w); for(int i=0;i<strlen(q);i++) { int c=q[i]; m.原创 2021-10-12 22:40:11 · 51 阅读 · 0 评论 -
1084 Broken Keyboard (20 分)
#include<bits/stdc++.h>using namespace std;#define ll long longmap<char,int>mp;int main(){ char q[100]; char w[100]; scanf("%s",q); scanf("%s",w); for(int i=0; i<strlen(q); i++) { int c=q[i]; i.原创 2021-10-12 22:26:30 · 48 阅读 · 0 评论 -
1095 Cars on Campus (30 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e4+100;struct car{ char id[10]; int time; char status[10];} all[maxn],valid[maxn];int num=0;map<string,int>parktime;int timecount(int h,int.原创 2021-10-09 23:52:42 · 56 阅读 · 0 评论 -
1080 Graduate Admission (30 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=40005;struct stu{ int ge,gi; int id; int fs[10];///理想学校 int fg; /// int ra; /// bool state; ///是否已经被录取} q[maxn];struct school{ int.原创 2021-10-09 13:22:01 · 74 阅读 · 0 评论 -
1083 List Grades (25 分) (巨水题)
#include<bits/stdc++.h>using namespace std;#define ll long longstruct stu{ char name[20]; char id[20]; int grade;} q[200];int cmp(stu a,stu b){ return a.grade>b.grade;}int main(){ int n; scanf("%d",&n); f.原创 2021-10-09 10:39:52 · 74 阅读 · 0 评论 -
1075 PAT Judge (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e4+100;struct stu{ int id; int score[10]; int sum; int pf; ///完美题解数 bool state;///是否有通过编译的提交} q[maxn];int que[10];int cmp(stu a,stu b){ .原创 2021-10-09 10:29:29 · 53 阅读 · 0 评论 -
1055 The World‘s Richest (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e5+100;struct peo{ string name; int age; int m;} q[maxn],valid[maxn];int age[maxn]= {0};int vis[maxn];int cmp(peo a,peo b){ if(a.m==b.m) { .原创 2021-10-05 23:22:36 · 52 阅读 · 0 评论 -
1028 List Sorting (25 分) (水题)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1e5+100;struct stu{ string id; string name; int grade;}q[maxn];int cmp1(stu a,stu b){ return a.id<b.id;}int cmp2(stu a, stu b){ if(a.name.原创 2021-10-04 23:36:12 · 61 阅读 · 0 评论 -
1016 Phone Bills (25 分)
#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn=1010;int toll[25];struct record{ char name[25]; int mon,dd,hh,mm; bool status;}rec[maxn],temp;bool cmp(record a,record b){ int s=strcmp(a.name,b.原创 2021-10-03 23:51:24 · 50 阅读 · 0 评论 -
1012 The Best Rank (25 分)
在这里插入图片描述#include<bits/stdc++.h>using namespace std;#define ll long longstruct stu{ int c,m,e,a; int num; int rank_c; int rank_m; int rank_e; int rank_a;}q[2005];int ask[2005];int cmp1(stu a,stu b){ return a.c&g原创 2021-10-03 22:57:34 · 57 阅读 · 0 评论 -
1062 Talent and Virtue (25 分) (水题)
#include<bits/stdc++.h>using namespace std;const int maxn=1e5+10;#define ll long longstruct stu{ int num; int d,c; int lei; int sum;}q[maxn];int cmp(stu a,stu b){ if(a.lei==b.lei) { if(a.sum==b.sum) {.原创 2021-10-03 22:13:28 · 52 阅读 · 0 评论 -
1082 Read Number in Chinese (25 分)
好不容易看懂了一道题,却不会做!!!题解代码越看越有味道,越想与有道理!!!#include<bits/stdc++.h>using namespace std;#define ll long longchar wei[100][100]= {"Shi","Bai","Qian","Wan","Yi"};char num[100][100]= {"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};int main(){.原创 2021-10-02 23:43:10 · 61 阅读 · 0 评论 -
1077 Kuchiguse (20 分)
#include<stdio.h>#include<string.h>int minn(int a,int b){ if(a<b) return a; else return b;}int main(){ char q[150][300]; int n; scanf("%d",&n); getchar(); int len=300; for(int i=0; i<n; i++) .原创 2021-09-29 22:21:44 · 44 阅读 · 0 评论 -
1035 Password (20 分) (水题)
#include<bits/stdc++.h>using namespace std;#define ll long longstruct pass{ char name[52]; char mi[52]; int flag=0;;} q[3300];int cmp(pass a,pass b){ return strcmp(a.name,b.name)>0;}int main(){// char q[25]; int .原创 2021-09-28 23:29:17 · 52 阅读 · 0 评论