PAT-A
大道殊同
野生程序员
展开
-
PTA_A_1061
// PTA_A_1061.cpp #include <iostream>#include <string>#include <stdint.h>#include <algorithm>using namespace std;int main(){ string s1, s2, s3, s4; cin >>...原创 2020-02-06 14:33:05 · 175 阅读 · 0 评论 -
PTA_A_1056
#include <iostream>#include <queue>#define N 1000+10using namespace std;int main(){ int np, ng; cin >> np >> ng; int W[N]; int ans[N]; queue<int&g...原创 2020-02-02 23:34:45 · 205 阅读 · 0 评论 -
PTA_A_1058
#include <iostream>using namespace std;typedef struct node { int g, s, k;}Node;int main(){ Node A, B; scanf("%d.%d.%d", &A.g, &A.s, &A.k); scanf("%d.%d.%d", &a...原创 2020-02-02 10:54:17 · 221 阅读 · 0 评论 -
PTA_A_1054
使用map统计出现的最大数字即可,但要注意输入不能使用cin,会超时。#include <iostream>#include <map>using namespace std;map<int,int> color_count;int main(){ int m,n; cin>>m>>n; int max=0; for(...原创 2020-01-31 22:02:00 · 141 阅读 · 0 评论 -
PTA_A_1051
难得一次就AC#include <iostream>using namespace std;#define N 1000+10int main() { int m,n,k; cin>>m>>n>>k; while(k--) { int num[N]={0}; int pos[N]={0}; int flag=1; i...原创 2020-01-30 13:04:43 · 195 阅读 · 0 评论 -
PTA_A_1050
#include <iostream>#include <string>#include <cstring>#include <stdio.h>using namespace std;#define N 10000+10int main(){ char s1[N],s2[N]; int F[500]={0}; cin.getl...原创 2020-01-30 00:12:31 · 193 阅读 · 0 评论 -
1017
模拟题,逻辑很简单,但这题有一点没提到,只要是在下午五点之前到达的客户,都可以完成业务,就算超过五点才开始也是可以的,但五点之后到达就不行。 有些地方初始化没注意到,卡了很久。//2020_01_19 20:50/* 所有到银行的人都按到达时间排队,只要有空闲的窗口就可以开始业务 判断队列第一个人的到达时间是否小于当前时间,如果不是则要增加当前时间,如果是...原创 2020-01-22 15:13:51 · 2198 阅读 · 0 评论 -
1033
一道贪心题,一直过不了,看了其他人的思路,发现依然是数学太差的锅,逻辑混乱,不能考虑到所有情况。思路如下:预处理:添加费用为0,距离为终点的加油站,然后以距离和费用为标准进行排序; 假设当前在下标为[i]的加油站,寻找所能到达的最大距离范围内的价格最低的加油站,如果遇到比当前加油站费用低的加油站,立刻结束寻找,否则直到寻找到范围内最优解; 根据第(2)步的结果分情况计算如果没找到,说...原创 2020-01-06 22:59:02 · 159 阅读 · 0 评论 -
1016
对于这种模拟题,总感觉脑容量不够用,虽然看起来很简答,但具体实现的时候却总有各种麻烦。//time:2020/1/1 19:31//PAT A 1016#include <iostream>#include <queue>#include <map> #include <string>#include <algorithm&g...原创 2020-01-01 20:51:13 · 166 阅读 · 0 评论 -
1012
自己写的一直段错误,看了其他博主的代码重写才过。其实也是很基础的排序题,但一遇到稍微复杂点的大脑就很混乱,数学渣真的影响逻辑思路,遇到不熟悉的就一片混乱,并且也很难静下心来思考。//time:2019/12/29 21:30//PAT A 1012#include<iostream> #include<vector>#include<alg...原创 2019-12-29 22:08:24 · 138 阅读 · 0 评论 -
1037
#include<iostream>#include<string>#include<vector>#include<algorithm>using namespace std;typedef long long INT;int main(){ vector<INT> C, B; int n, m; cin >...原创 2019-02-24 15:28:12 · 348 阅读 · 0 评论 -
1036
#include<iostream>#include<string>#include<vector>using namespace std;class Students{public: string name, gender, id; int grade; bool flag;};int main(){ int n; cin >...原创 2019-02-24 11:40:34 · 287 阅读 · 0 评论 -
1035
#include<iostream>#include<vector>#include<string>using namespace std;class Person{public: static int num; string name, password; bool flag;};int Person::num = 0;vector&...原创 2019-02-24 11:18:20 · 153 阅读 · 0 评论 -
1038
#include<iostream>#include<string>#include<vector>#include<algorithm>using namespace std;bool cmp(string a, string b) { return a + b < b + a; }int main(){ int n;...原创 2019-02-24 17:32:19 · 163 阅读 · 0 评论 -
1034
#include<iostream>#include<string>#include<map>#include<stack>#include<vector>#include<algorithm>using namespace std;class Person{public: stack<string...原创 2019-02-24 10:54:52 · 104 阅读 · 0 评论 -
1032
#include<iostream>#include<string>#include<map>using namespace std;#define N 100010typedef struct node{ string data; int nextad; bool flag;}Node;map<int, Node> S;N...原创 2019-02-23 11:31:29 · 148 阅读 · 0 评论 -
1042
#include<iostream>#include<string>#include<iomanip>using namespace std;void Init(string A[100]);void Change(int B[100], int n, string A[100]);int main(){ string A[100]; int...原创 2019-02-26 13:35:00 · 540 阅读 · 0 评论 -
1152
素数判断,暴力搜索string.substr(start,len); //参数分别是开始位置,和截取字串长度。数字转字符串 to_string(int value);字符串转数字 stoi(string str); stol(string str); stof(string...原创 2019-02-27 16:44:44 · 287 阅读 · 0 评论 -
1153
cin cout 输入输出会超时 用scanf() printf()输入输出string类的输入输出方式 scanf(): string.resize(length); scanf("%s", &string[0]); printf():printf("%s", string.c_str());#include<io...原创 2019-03-01 09:44:01 · 145 阅读 · 0 评论 -
1154
#include<iostream>#include<map>#include<cstring>#include<queue>#include<vector>using namespace std;#define N 10010int Ver[N];int n, m;vector<int> Map[N];...原创 2019-03-01 10:36:20 · 219 阅读 · 0 评论 -
1155
#include<iostream>#include<vector>#include<stack>using namespace std;bool IsMaxHeap(vector<int>&A);bool IsMinHeap(vector<int>&A);void Print(vector<int&g.原创 2019-03-01 12:06:42 · 385 阅读 · 0 评论 -
1039
#include<iostream>#include<string>#include<map>#include<vector>#include<algorithm>using namespace std;int main(){ map<string, vector<int>> S; int n,原创 2019-02-25 17:35:39 · 160 阅读 · 0 评论 -
1040
#include<iostream>#include<string>using namespace std;int main(){ string a; getline(cin, a); int L = a.length(); int max = 1; int i, j, t; t = 0; while (t < L) { i = t - ...原创 2019-02-25 19:43:25 · 256 阅读 · 0 评论 -
1041
#include<iostream>#include<vector>using namespace std;#define N 10010struct node{ int v; int p;};int main(){ node A[N] = { 0,0 }; int n; cin >> n; int max = 0;...原创 2019-02-25 20:46:22 · 138 阅读 · 0 评论 -
1043
#include<iostream>#include<vector>using namespace std;typedef struct node{ int v; struct node *left; struct node *right;}Node, *TreeNode;TreeNode Insert1(TreeNode P, int a);Tree...原创 2019-02-26 16:08:06 · 123 阅读 · 0 评论 -
1044
第一次用尺取法,写的很杂乱。#include<iostream>#include<vector>#include<queue>using namespace std;#define INF 0xfffffffint Solve(vector<int> A, int m,int n, queue<int> &B);...原创 2019-02-27 10:43:02 · 296 阅读 · 0 评论 -
1008
#include<iostream>using namespace std;int main(){ int sum = 0; int n, a, b; a = b = 0; cin >> n; while (n--) { cin >> b; if (b > a) ...原创 2018-05-21 12:26:58 · 146 阅读 · 0 评论 -
1031
#include<iostream>#include<string>using namespace std;int main(){ string s; cin >> s; int l = s.length(); l += 2; int c; for (int i = l; i >= 0; i--) { if (i % 3 == ...原创 2019-02-22 21:24:39 · 208 阅读 · 0 评论 -
1029
#include<iostream>#include<vector>#include<algorithm>#include<queue>using namespace std;int main(){ int n, m; queue<int> A, B; cin >> n; for (int i = 0; ...原创 2019-02-22 21:07:34 · 134 阅读 · 0 评论 -
1014
注意:五点之前被服务而五点之后结束服务的可以正常服务,只有五点之后(包含五点)开始服务的才输出Sorry。#include<iostream>#include<vector>#include<queue>#include<stack>#define N 100#define M 1000+10using namespace std;...原创 2018-07-30 00:48:32 · 257 阅读 · 0 评论 -
1013
DFS: cin cout在最后一个测试点会超时。#include&lt;iostream&gt;#include&lt;string.h&gt;#include&lt;cstdio&gt;#define N 1000+10using namespace std;int visit[N];int map[N][N];void DFS(int s, int c, int n)...原创 2018-07-19 23:41:12 · 194 阅读 · 0 评论 -
1011
#include<iostream>#include<iomanip>#include<algorithm>using namespace std;int main(){ double a, b, c, maxnum; char Ans[5]; maxnum = 1; for (int i = 1; i <= 3;...原创 2018-06-10 22:48:10 · 161 阅读 · 0 评论 -
1010
#include<iostream>#include<cstring>#include<cmath>#include<algorithm>using namespace std;#define N 10+10typedef unsigned long long LL;LL Change_D(char A[], int r);int...原创 2018-06-09 15:02:51 · 121 阅读 · 0 评论 -
1009
#include<iostream>#include<iomanip>using namespace std;#define N 1000*1000+10int NA, NB;float A[N], B[N], C[N];int main(){ for (int i = 0; i <= 1000 * 1000; i++) { ...原创 2018-06-04 13:29:31 · 1203 阅读 · 0 评论 -
1007
#include<stdio.h>int main() { int n,a[100010],i=0,j=0,k=0; int sum,maxsum; sum=0; maxsum=-1; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&a[i...原创 2018-05-21 12:27:53 · 268 阅读 · 0 评论 -
1006
#include<iostream>#include<cstring>#include<algorithm>#define N 20#define INF 0x7ffffffusing namespace std;int Transform(char s[]);int main(){ int m; char First_Id[N]...原创 2018-05-20 22:37:26 · 100 阅读 · 0 评论 -
1005
#include<iostream>#include<cstring>#define N 100+10using namespace std;int main(){ char s[N]; char word[N][N] = { "zero","one","two","three","four","five",原创 2018-05-19 19:05:41 · 550 阅读 · 0 评论 -
1003
#include<iostream>#include<queue>#define N 500+10#define INF 0x0fffffffusing namespace std;void DFS(int p,int len,int sum);void init();int Count, Maxnum, Maxl;int n, m, c1, c2;i...原创 2018-05-19 17:51:29 · 226 阅读 · 0 评论 -
1004
#include&lt;iostream&gt;#define N 100+10using namespace std;int n, m, level;int sum[N];int num[N][N];void Find(int f, int l);int main(){ for (int i = 0; i &lt; N; i++) { sum[i...原创 2018-05-19 17:50:01 · 117 阅读 · 0 评论 -
1002
PAT_A_1002#include<stdio.h>#define N 1000+10double A1[N], A2[N];int k1, k2, k3;void Init(){ int i; for (i = 0; i <= 1000; i++) { A1[i] = A2[i] = 0; }}void I...原创 2018-04-08 12:25:58 · 171 阅读 · 0 评论