m0_51033005的博客

待处理patB1054题目链接如下:添加链接描述代码如下:#include<iostream>#include<string>#include<algorithm>#include<deque>using namespace std;bool xiaoshu(string s) { string s3; for (int i = 0; i < s.size(); i++) { if (s[i] == '.') { st

pat B1081题目链接如下:添加链接描述注意:用户的输入可能有空格，使用getline()获得密码的输入。所给用例没有这种情况：只有小数点，且长度不小于6.代码如下:#include<iostream> #include<deque>#include<string>#include<algorithm>using namespace std;int main() { int N; deque<string> id

##待处理 pat B1025题目链接如下:添加链接描述代码如下:#include <iostream>#include<string>#include<unordered_map>#include<deque>struct Node { int data; int add; int next;}node[110000],d;using namespace std;int main() { int begin, N, K;

pat B1016添加链接描述代码如下:#include<iostream>#include<string>#include<deque>using namespace std;int main() { string a, b,da, db; cin >> a >> da >> b >> db; int hash1[128] = { 0 }; int hash2[128] = { 0 }; for

pat B1019题目链接如下:添加链接描述代码如下:#include <iostream>#include<string>#include<algorithm>using namespace std;bool higher(int a, int b) { return a > b;}int main() { string s1(4, 0); cin >> s1; for (int i = 0; i < s1.s

pat B1039题目链接如下:添加链接描述代码如下:#include<deque>#include<iostream>#include<string>using namespace std;int main() { string s1, s2; cin >> s1 >> s2; deque<int> hash(128, 0); for (int i = 0; i < s2.size(); i++) {

pat B1041题目链接如下：添加链接描述代码如下：#include <iostream>#include<string>#include<deque>struct Person { std::string str1; int num1; int num2;}p[1100], d;using namespace std;int main() { int N; cin >> N; for (int i = 0; i <

pat B1009题目链接如下：添加链接描述代码如下：方法一：#include<deque>#include<iostream>#include<string>using namespace std;int main() { string s; deque<string> ideq; while (cin >> s) { ideq.push_back(s); } for (int i = ideq.size() -

pat B1013题目链接如下:添加链接描述代码如下:#include <iostream>#include <string> using namespace std;int main() { string s1; cin >> s1; if (s1.size() == 3) { for (int i = 0; i < s1[0] - '0'; i++) cout << "B"; } if (s1.size() >= 2)

pat B1004题目链接如下https://pintia.cn/problem-sets/994805260223102976/problems/994805321640296448代码如下#include<iostream>#include<string>#include<algorithm>using namespace std;struct Student { string name1,name2; int grades;}stu[100

待处理pat B1093题目如下添加链接描述代码如下#include <iostream>#include<string>using namespace std;int main() { ios::sync_with_stdio(false); cin.tie(0); string s,s1,s2; getline(cin, s); getline(cin, s1); s2 = s + s1; auto it = s2.begin(); for

pat B1043题目链接如下：添加链接描述代码如下：#include <iostream>#include <string>#include<deque>#include <algorithm>using namespace std;int main() { deque<int> hash(128,0); string s, out = "PATest"; cin >> s; int sum = 0;//统

pat B1028题目链接如下添加链接描述代码如下:#include <iostream>#include <string> #include <deque>#include <algorithm>using namespace std;struct Person { //定义结构体 string name; int year; int month; int day;}p[100010],d;bool

pat B1031题目链接如下添加链接描述代码如下:#include<iostream>#include<string>#include<deque> #include <algorithm>using namespace std;int main() { int N; cin >> N; string s, s1; deque<bool> pass(N, true); int weight[17] = {

pat B1042题目链接如下添加链接描述代码如下#include<iostream>#include<deque>#include<string>#include <algorithm>using namespace std;int main() { deque<int> hash(128, 0); string s1; getline(cin, s1); for (int i = 0; i < s1.siz

pat B1033题目链接如下添加链接描述代码如下#include <iostream>#include <string>#include <stdlib.h>#include <deque>using namespace std;bool hashTable[256];int main() { deque <bool> hash(128, 0); string s1, s2; getline(cin, s1); ge

pat B1076解法一：#include<iostream>#include<string> using namespace std;using gg = long long;int main() { ios::sync_with_stdio(false); gg N, n; cin >> N; n = N * 4; string s1, s; for (int i = 0; i < n; i++) { cin >&gt