STL
string、vector、map、satck、queue等
斯文~
努力搬砖 低调潜水
展开
-
c++ unique去重 STL
对有序数组去重#include<iostream>#include<algorithm>using namespace std;int main(){ int n; int g[110]; vector<int> q; cin>>n; for(int i=0; i<n; i++) { cin>>g[i]; q.push_back(g[i]); } sort(q.begin(),q.end()); in原创 2021-12-10 20:29:33 · 529 阅读 · 0 评论 -
CodeForces - 501B Misha and Changing Handles
https://vjudge.net/problem/CodeForces-501B#include<iostream>#include<algorithm>#include<unordered_map>using namespace std;int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; string a,b; unordered_map<str原创 2021-08-22 20:33:02 · 83 阅读 · 0 评论 -
HDU - 1247 Hat’s Words
https://vjudge.net/problem/HDU-1247和这一题一样https://blog.csdn.net/weixin_52341477/article/details/119851075原创 2021-08-22 20:04:52 · 77 阅读 · 0 评论 -
UVA - 10391 Compound Words
https://vjudge.net/problem/UVA-10391用uordered_map的话输出字典序不对#include<iostream>#include<algorithm>#include<unordered_set>#include<set>using namespace std;int main(){ string s; set<string> q; while(cin>>s) q.ins原创 2021-08-22 12:27:19 · 99 阅读 · 0 评论 -
CodeForces - 4C Registration system
https://vjudge.net/problem/CodeForces-4C#include<iostream>#include<algorithm>#include<unordered_map>using namespace std;int main(){ int n; while(cin>>n) { unordered_map<string,int> q; string s; for(int i=0;i<原创 2021-08-21 21:36:45 · 142 阅读 · 0 评论 -
计蒜客 - T1145 输出最高分数的学生姓名
https://vjudge.net/problem/%E8%AE%A1%E8%92%9C%E5%AE%A2-T1145#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>using namespace std;struct node{ int s; char name[25]; bool operator<(const node w)const{原创 2021-08-21 21:31:48 · 116 阅读 · 0 评论 -
计蒜客 - 131 学生成绩查找系统
https://vjudge.net/problem/%E8%AE%A1%E8%92%9C%E5%AE%A2-131#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<unordered_map>using namespace std;int main(){ int s; string op,na; unordered_m原创 2021-08-21 21:27:44 · 96 阅读 · 0 评论 -
POJ - 2153 Rank List
https://vjudge.net/problem/POJ-2153#include<iostream>#include<algorithm>#include<cstdio>#include<map>#include<cstring>using namespace std;int main(){ int n; while(cin>>n) { getchar(); map<string,int>原创 2021-08-21 21:14:37 · 91 阅读 · 0 评论 -
POJ - 3250 Bad Hair Day
https://vjudge.net/problem/POJ-3250#include<iostream>#include<algorithm>#include<cstdio>#include<stack>using namespace std;int main(){ int n; while(~scanf("%d",&n)) { if(n==0) break; long long ans=0; stack<int原创 2021-08-21 21:05:02 · 72 阅读 · 0 评论 -
HDU - 1251 统计难题
https://vjudge.net/problem/HDU-1251#include<iostream>#include<algorithm>#include<unordered_map>#include<cstring> using namespace std;int main(){ char a[15],b[15]; unordered_map<string,int> q; while(cin.getline(a,11)原创 2021-08-21 20:59:36 · 64 阅读 · 0 评论 -
HDU - 1263 水果
题目夏天来了~~ 好开心啊,呵呵,好多好多水果~~Joe经营着一个不大的水果店.他认为生存之道就是经营最受顾客欢迎的水果.现在他想要一份水果销售情况的明细表,这样Joe就可以很容易掌握所有水果的销售情况了.Input第一行正整数N(0<N<=10)表示有N组测试数据.每组测试数据的第一行是一个整数M(0<M<=100),表示工有M次成功的交易.其后有M行数据,每行表示一次交易,由水果名称(小写字母组成,长度不超过80),水果产地(小写字母组成,长度不超过80)和交易的水果数原创 2021-05-02 22:06:00 · 96 阅读 · 0 评论 -
HDU - 1004 Let the Balloon Rise
https://vjudge.net/problem/HDU-1004#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<unordered_set>#include<set>#include<unordered_map>using namespace std;int main(){ int n;原创 2021-08-21 20:43:58 · 123 阅读 · 0 评论 -
UVALive - 3638 Printer Queue
https://vjudge.net/problem/UVALive-3638#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<vector>using namespace std;#define PII pair<int,int>int T;int main(){ cin>>T; while(原创 2021-08-21 20:38:11 · 75 阅读 · 0 评论 -
POJ - 2503 Babelfish
https://vjudge.net/problem/POJ-2503#include<iostream>#include<algorithm>#include<map>using namespace std;int main() { ios::sync_with_stdio(false); //用cin要关闭同步不然超时 cin.tie(0); cout.tie(0); string s,a,b; map<string,string>x;原创 2021-08-21 18:22:26 · 155 阅读 · 0 评论 -
HDU - 1251 统计难题
https://vjudge.net/problem/HDU-1251#include<iostream>#include<algorithm>#include<unordered_map>#include<cstring> using namespace std;int main(){ char a[15],b[15]; unordered_map<string,int> q; while(cin.getline(a,11)原创 2021-08-20 15:38:02 · 101 阅读 · 0 评论 -
UVA - 136 Ugly Numbers
注意输出要求#include<iostream>#include<algorithm>#include<queue>#include<unordered_set>#include<cstdio>using namespace std;int main(){ int prime[3]={2,3,5}; unordered_set<long long> a; priority_queue<long long,ve原创 2021-08-19 21:36:34 · 78 阅读 · 0 评论 -
HDU - 1412 {A} + {B}
#include<iostream>#include<algorithm>#include<cstring>#include<cstdio>#include<unordered_set>#include<set>using namespace std;int main(){ int n,m; while(cin>>n>>m) {// unordered_set<int> q;原创 2021-08-19 21:30:53 · 76 阅读 · 0 评论 -
HDU - 1029 Ignatius and the Princess IV
https://vjudge.net/problem/HDU-1029#include<iostream>#include<algorithm>using namespace std;int main(){ int n,tt; while(cin>>n) { int t,u,s=0; for(int i=0;i<n;i++) { cin>>t; if(s==0) { u=t; s++;原创 2021-08-19 21:25:11 · 56 阅读 · 0 评论 -
UVA - 10935 Throwing cards away I
https://vjudge.net/problem/UVA-10935vector#include<iostream>#include<algorithm>#include<queue>#include<unordered_set>#include<cstdio>using namespace std;int main(){ int n; while(cin>>n) { if(n==0) break;原创 2021-08-19 15:22:10 · 131 阅读 · 0 评论 -
UVA - 1594 Ducci Sequence
https://vjudge.net/problem/UVA-1594set#include<iostream>#include<algorithm>#include<set>#include<vector>using namespace std;int main(){ int T; cin>>T; while(T--) { int n,x; cin>>n; vector<int> h;原创 2021-08-19 12:28:24 · 69 阅读 · 0 评论 -
POJ - 1363 E - Rails
https://vjudge.net/contest/446946#problem/E题目There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to establish原创 2021-07-14 21:21:34 · 75 阅读 · 0 评论 -
HDU - 1022 Train Problem I
https://vjudge.net/problem/HDU-1022HDU - 1022 Train Problem I题目AC代码题目As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fa原创 2021-07-14 21:12:43 · 84 阅读 · 0 评论 -
POJ - 2823 Sliding Window
https://vjudge.net/problem/POJ-2823POJ - 2823 Sliding Window题目AC代码题目An array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the wi原创 2021-07-13 21:56:12 · 162 阅读 · 0 评论 -
HDU1276 士兵队列训练问题
HDU1276题目AC代码#include<iostream>#include<algorithm>#include<cstring>using namespace std;int h[5010];int main(){ int t,n; while(cin>>t) { while(t--) { cin>>n; if(n<=3) { printf("1"); for(int原创 2021-07-13 08:16:22 · 122 阅读 · 0 评论 -
HDU1702 ACboy needs your help again! (STL)
题目ACboy was kidnapped!!he miss his mother very much and is very scare now.You can’t image how dark the room he was put into is, so poor ????.As a smart ACMer, you want to get ACboy out of the monster’s labyrinth.But when you arrive at the gate of the ma原创 2021-07-12 17:12:52 · 80 阅读 · 0 评论 -
HDU1237 简单计算器 (STL)
题目读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。Input测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。Output对每个测试用例输出1行,即该表达式的值,精确到小数点后2位。Sample Input1 + 24 + 2 * 5 - 7 / 110Sample Output3.0013.36...原创 2021-07-12 17:15:06 · 198 阅读 · 0 评论 -
HDU1873 看病要排队 优先队列法+朴素做法
题目看病要排队这个是地球人都知道的常识。不过经过细心的0068的观察,他发现了医院里排队还是有讲究的。0068所去的医院有三个医生(汗,这么少)同时看病。而看病的人病情有轻重,所以不能根据简单的先来先服务的原则。所以医院对每种病情规定了10种不同的优先级。级别为10的优先权最高,级别为1的优先权最低。医生在看病时,则会在他的队伍里面选择一个优先权最高的人进行诊治。如果遇到两个优先权一样的病人的话,则选择最早来排队的病人。现在就请你帮助医院模拟这个看病过程。Input输入数据包含多组测试,请处理到文原创 2021-07-12 17:19:29 · 167 阅读 · 0 评论 -
HDU1870 愚人节的礼物
HDU1870 愚人节的礼物原创 2021-07-12 17:28:16 · 104 阅读 · 0 评论 -
HDU1062 Text Reverse
HDU1062题目AC代码#include<iostream>#include<algorithm>#include<cstring>#include<stack>using namespace std;int main(){ int n; char ch; scanf("%d",&n); getchar(); while(n--) { stack<char> s; while(1) {原创 2021-07-12 17:34:28 · 101 阅读 · 0 评论