PAT甲级
Nebula_xuan
HUNAUer,希望在大学四年中在ACM这条路上越走越远~
展开
-
PAT甲级1044
solution#include <iostream>#include <vector>using namespace std;const int N = 100010;int n, k;int s[N];vector<int> anss;void solve(int i, int &j, int &tempsum){ int left = i, right = n; while (left < right)原创 2021-09-08 17:04:59 · 81 阅读 · 0 评论 -
PAT甲级1043
solution#include <iostream>#include <vector>using namespace std;bool isMirror;vector<int> pre, post;void getpost(int root, int tail){ if (root > tail) return; int i = root + 1, j = tail; if (!isMirror) {原创 2021-09-08 15:46:16 · 70 阅读 · 0 评论 -
PAT甲级1042
solution#include <iostream>#include <algorithm>using namespace std;const int N = 55, M = 1000010;int a[N], b[M], c[N];void solve(int x, int y){ swap(a[x], a[y]);}int main(){ for (int i = 1; i < N; i++) a[i] = i;原创 2021-09-08 13:55:54 · 79 阅读 · 0 评论 -
PAT甲级1041
solution#include <iostream>using namespace std;const int N = 100010;int a[N], m[N];int main(){ int n; scanf("%d", &n); for (int i = 0; i < n; i++) { cin >> a[i]; m[a[i]]++; } for (int i = 0;原创 2021-09-08 12:46:17 · 91 阅读 · 0 评论 -
PAT甲级1040
solution#include <iostream>#include <cstring>using namespace std;string a;int check(int i){ int count1 = 1; int x = i - 1, y = i + 1; while (a[x] == a[y] && x >= 0 && y < a.size()) { x--;原创 2021-09-08 12:25:18 · 70 阅读 · 0 评论 -
PAT甲级1039
solution#include <iostream>#include <queue>#include <cstring>#include <set>#include <map>using namespace std;const int N = 50010;map<string, set<int>> x1;int idxnumber = 1;int main(){ int n, k; s原创 2021-09-08 12:12:00 · 63 阅读 · 0 评论 -
PAT甲级1038
solution#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 10010;string a[N];bool cmp(string a, string b){ return a + b < b + a;}string ans;int main(){ int n; cin >>原创 2021-09-08 11:03:29 · 55 阅读 · 0 评论 -
PAT甲级1037
solution#include <cstdio>#include <vector>#include <algorithm>using namespace std;int main() { int m, n, ans = 0, p = 0, q = 0; scanf("%d", &m); vector<int> v1(m); for(int i = 0; i < m; i++) scanf原创 2021-09-07 15:23:41 · 56 阅读 · 0 评论 -
PAT甲级1036
solution#include<bits/stdc++.h>using namespace std;string nm;char ge;string id;int grade;int n;int main(){ int n; cin>>n; string fn="",mn=""; string fid,mid; int fg=-1,mg=101; for(int i=1;i<=n;i++) {原创 2021-09-07 14:22:48 · 44 阅读 · 0 评论 -
PAT甲级1035
solution#include <iostream>using namespace std;const int N = 1010;string a[N], b[N];int main(){ int n; scanf("%d\n", &n); string temp1, temp2; int count = 0; int idx = 1; for (int i = 1; i <= n; i++) {原创 2021-09-07 14:05:34 · 95 阅读 · 0 评论 -
PAT甲级1034
solution#include <iostream>#include <map>using namespace std;int G[2010][2010], wight[2010];bool vis[2010];map<string, int> stringToInt;map<int, string> intToString;map<string, int> ans;int idNumber = 1, k;int stoifu原创 2021-09-07 13:52:46 · 67 阅读 · 0 评论 -
PAT甲级1033
solution#include <iostream>#include <algorithm>#include <vector>using namespace std;const int inf = 99999999;struct station{ double price, dis;};bool cmp1(station a, station b){ return a.dis < b.dis;}int main(){原创 2021-09-07 12:03:40 · 49 阅读 · 0 评论 -
PAT甲级1033
solution#include <iostream>#include <algorithm>#include <vector>using namespace std;const int inf = 99999999;struct station{ double price, dis;};bool cmp1(station a, station b){ return a.dis < b.dis;}int main(){原创 2021-09-06 20:15:51 · 51 阅读 · 0 评论 -
PAT甲级1032
solution#include <iostream>#include <cstring>using namespace std;struct node{ char data; int key, flag;} add[100010];int main(){ int st1, st2, n; cin >> st1 >> st2 >> n; for (int i = 1; i <= n; i原创 2021-09-06 17:14:11 · 52 阅读 · 0 评论 -
PAT甲级1031
solution#include <iostream>#include <cstring>using namespace std;int main(){ string a; cin >> a; if (a.size() % 2 == 0) { int count = (a.size() + 2) / 3, idx = a.size() - 2 * count + 2; for (int i = 0;原创 2021-09-06 16:23:02 · 70 阅读 · 0 评论 -
PAT甲级1030
solution#include <iostream>#include <vector>#include <cstring>#include <algorithm>using namespace std;const int N = 510;vector<int> pre[N];int vis[N];int map[510][510], dis[510], money[510][510];int n, m, s, d;const原创 2021-09-06 16:00:30 · 90 阅读 · 0 评论 -
PAT甲级1029
solution#include <iostream>#include <vector>#include <algorithm>using namespace std;vector<long long> ans;int main(){ long long n; cin >> n; for (long long i = 0; i < n; i++) { long long x;原创 2021-09-06 15:59:57 · 38 阅读 · 0 评论 -
PAT甲级1028
solution#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 100010;struct node{ int a, c; string b;} records[N];bool cmp1(node x, node y){ return x.a < y.a;}bool cmp2(node原创 2021-09-06 15:59:50 · 40 阅读 · 0 评论 -
PAT甲级1027
solution#include <iostream>#include <algorithm>#include <cstring>using namespace std;int tt[100000];char s[14] = "0123456789ABC";string work2(int y){ string result = ""; if (y == 0) { return "00"; } whi原创 2021-09-05 22:14:32 · 56 阅读 · 0 评论 -
PAT甲级1025
solution#include <iostream>#include <cstring>#include <algorithm>#include <vector>using namespace std;const int N = 310;struct node{ long long x; int loc, fin, id, score;};vector<node> tester;bool cmp1(node原创 2021-09-05 18:29:08 · 45 阅读 · 0 评论 -
PAT甲级1024
solution#include <iostream>#include <algorithm>#include <cstring>using namespace std;string s;void add(string t){ int carry = 0; for (int i = 0; i < t.size(); i++) { s[i] = s[i] + t[i] + carry - '0';原创 2021-09-05 17:43:35 · 37 阅读 · 0 评论 -
PAT甲级1023
solution#include <cstdio>#include <string.h>using namespace std;int book[10];int main() { char num[22]; scanf("%s", num); int flag = 0, len = strlen(num); for(int i = len - 1; i >= 0; i--) { int temp = num[i] - '原创 2021-09-05 17:08:52 · 48 阅读 · 0 评论 -
PAT甲级1022
solution#include <iostream>#include <cstring>#include <map>#include <set>using namespace std;map<string, set<int>> title, author, key, pub, year;void query(map<string, set<int>> &m, string &str原创 2021-09-05 16:52:13 · 66 阅读 · 0 评论 -
PAT甲级1021
solution#include <iostream>#include <vector>#include <set>#include <cstring>#include <algorithm>using namespace std;const int N = 10010;set<int> s;vector<int> map[N], v, temp;int vis[N];int maxhight = 0原创 2021-09-05 13:15:17 · 37 阅读 · 0 评论 -
PAT甲级1020
solution#include <iostream>#include <vector>#include <algorithm>using namespace std;const int N = 31;int in[N], post[N];struct node{ int idx, value;};bool cmp(node x, node y){ return x.idx < y.idx;}vector<node原创 2021-09-05 11:59:34 · 58 阅读 · 0 评论 -
PAT甲级1019
solution#include <iostream>using namespace std;int idx=0;int len[10000000];int main(){ int a, b; cin >> a >> b; while (a) { len[idx++]=a%b; a /= b; } int flag = 1; for (int i = 0; i < id原创 2021-09-05 11:00:23 · 53 阅读 · 0 评论 -
PAT甲级1018
solution#include <iostream>#include <vector>#include <cstring>#include <algorithm>const int INF = 0x3f3f3f;using namespace std;const int N = 510;int map[N][N], dis[N], weight[N], vis[N], minNeed=INF, minBack=INF;int cmax,原创 2021-09-05 10:11:11 · 52 阅读 · 0 评论 -
PAT甲级1017
solution在这里插入代码片原创 2021-09-05 09:27:52 · 64 阅读 · 0 评论 -
PAT甲级1016
solution#include <map>#include <vector>#include <iostream>#include <algorithm>using namespace std;struct node{ string name; int status, month, time, day, hour, minute;};bool cmp(node a, node b){ return a.name !原创 2021-09-04 21:33:39 · 64 阅读 · 0 评论 -
PAT甲级1015
solution#include <iostream>#include <cmath>#include <cstring>using namespace std;bool is_prime(int x){ if (x <= 1) return false; for (int i = 2; i * i <= x; i++) { if (x % i == 0) return原创 2021-09-04 19:08:54 · 63 阅读 · 0 评论 -
PAT甲级1014
solution#include <iostream>#include <algorithm>#include <queue>#include <vector>using namespace std;struct node{ int poptime, endtime; queue<int> q;};const int N = 1010;int main(){ int n, m, k, q; c原创 2021-09-04 18:31:28 · 51 阅读 · 0 评论 -
PAT甲级1013
solution#include <iostream>#include <cstring>using namespace std;const int N = 1010;int map[N][N];int vis[N];int count;int n, m, k;void dfs(int x){ vis[x] = true; for (int i = 1; i <= n; i++) { if (!vis[i] &原创 2021-09-04 17:11:03 · 48 阅读 · 0 评论 -
PAT甲级1012
solution#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 2010;int vis[1000010];struct node{ int id; int score[4], rank[4], best;} stu[N];int flag = -1;bool cmp1(node x, node y)原创 2021-09-04 16:51:50 · 73 阅读 · 0 评论 -
PAT甲级1011
solution#include <iostream>#include <algorithm>using namespace std;char sum[4];int main(){ double a, b, c; double ans = 1.0; int idx = 0; while (cin >> a >> b >> c) { double maxx = max(a, max(原创 2021-09-04 11:55:05 · 118 阅读 · 0 评论 -
PAT甲级1010
solution#include <iostream>#include <cstring>#include <cmath>#include <algorithm>using namespace std;long long convert(string n, long long radix){ long long sum = 0, temp = 0, idx = 0; for (auto it = n.rbegin(); it !=原创 2021-09-04 11:41:23 · 52 阅读 · 0 评论 -
PAT甲级1009
solution#include <iostream>using namespace std;int main() { int n1, n2, a, cnt = 0; scanf("%d", &n1); double b, arr[1001] = {0.0}, ans[2001] = {0.0}; for(int i = 0; i < n1; i++) { scanf("%d %lf", &a, &b);原创 2021-09-04 10:04:19 · 64 阅读 · 0 评论 -
PAT甲级1008
solution#include <iostream>using namespace std;int up(int x,int y){int temp=5;temp+=(y-x)*6;return temp;}int down(int x,int y){int temp=5;temp+=(x-y)*4;return temp;}int main(){ int n; cin>>n; int idx=0; int ans=原创 2021-09-04 09:57:22 · 47 阅读 · 0 评论 -
PAT甲级1007
solution#include <iostream>using namespace std;const int N = 10010;int a[N];int main(){ int n; cin >> n; int temp = 0, ans = -1, tar1 = 0, tar2 = n - 1, tidx = 0; for (int i = 0; i < n; i++) { cin >>原创 2021-09-04 09:49:23 · 53 阅读 · 0 评论 -
PAT甲级1006
solution#include <iostream>#include <cstring>#include <algorithm>using namespace std;string fir, en;int first1=0x3f3f3f,end1;int main(){ int n; while (cin >> n) { for (int i = 1; i <= n; i++)原创 2021-09-03 23:14:34 · 56 阅读 · 0 评论 -
PAT甲级1005
solution#include <iostream>#include <cstring>using namespace std;string b[11] = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};int main(){ string a; cin >> a; int sum = 0; for (in原创 2021-09-03 21:25:16 · 62 阅读 · 0 评论