ZOJ
努力刷题
SYaoJun
这个作者很懒,什么都没留下…
展开
-
The Hardest Problem Ever【HDOJ1048】【ZOJ1392】
Problem Description Julius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one of th原创 2016-02-15 15:53:51 · 541 阅读 · 0 评论 -
ZOJ1151 Word Reversal
#include<iostream> #include<string> #include<vector> #include<algorithm> using namespace std; int main(){ int n, k; cin >> n; while(n--){ cin >> k; char c; ...原创 2019-08-25 16:53:45 · 135 阅读 · 0 评论 -
ZOJ1259 Reverse Text
#include<iostream> #include<string> #include<vector> #include<algorithm> using namespace std; int main(){ int n; cin >> n; getchar(); string str; for(int i = 0; i &...原创 2019-08-25 16:40:13 · 123 阅读 · 0 评论 -
ZOJ1241 Geometry Made Simple
#include<iostream> #include<string> #include<vector> #include<cstdio> #include<cmath> #include<unordered_map> using namespace std; int main(){ int a, b, c; int k...原创 2019-08-25 16:13:14 · 172 阅读 · 0 评论 -
ZOJ1251 Box of Bricks
#include<iostream> #include<string> #include<vector> #include<unordered_map> using namespace std; int main(){ int n, x; int k = 0; vector<int> v; while(cin>> n...原创 2019-08-25 15:53:58 · 181 阅读 · 0 评论 -
ZOJ1115 Digital Roots
减少第一轮求和的计算量是关键 #include<iostream> #include<string> #include<unordered_map> using namespace std; int main(){ string str; while(cin>>str){ if(str == "0") break; int ans = 0...原创 2019-08-25 15:40:41 · 151 阅读 · 0 评论 -
ZOJ2932 The Seven Percent Solution
#include<iostream> #include<string> #include<unordered_map> using namespace std; int main(){ unordered_map<char, string> mp; mp[' '] = "%20"; mp['!'] = "%21"; mp['$'] = "%2...原创 2019-08-25 15:30:58 · 165 阅读 · 0 评论 -
ZOJ2947 Abbreviation
#include<iostream> #include<string> using namespace std; int main(){ int T, n; cin>>T; while(T--){ cin >> n; string s, s1, s2; while(n--){ cin>>s; s1 += s[...原创 2019-08-25 15:22:41 · 149 阅读 · 0 评论 -
ZOJ2886 Look and Say
#include<iostream> #include<string> using namespace std; int main(){ int n; cin >> n; string str; while(n--){ cin >> str; string res; for(int i = 0; i < str.size()...原创 2019-08-25 15:10:47 · 165 阅读 · 0 评论 -
ZOJ2478 Encoding
#include<queue> #include<iostream> #include<algorithm> using namespace std; int main(){ int n; cin>>n; while(n--){ string s, res; cin>>s; int cnt = 0; for(in...原创 2019-08-25 11:16:39 · 165 阅读 · 0 评论 -
ZOJ1383 Binary Numbers
#include<string> #include<iostream> #include<bitset> #include<algorithm> using namespace std; int main(){ int T, n; cin>>T; while(T--){ cin>>n; string s = ...原创 2019-08-24 14:39:55 · 265 阅读 · 0 评论 -
ZOJ1240 IBM Minus One
#include<string> #include<iostream> #include<unordered_map> #include<algorithm> using namespace std; int main(){ int n; cin >> n; for(int i = 1; i <= n; i++){ ...原创 2019-08-24 14:25:56 · 116 阅读 · 0 评论 -
ZOJ2104 Let the Balloon Rise
#include<string> #include<iostream> #include<unordered_map> #include<algorithm> using namespace std; int main(){ int n; string s; while(cin >> n){ if(!n) break; ...原创 2019-08-24 14:17:45 · 116 阅读 · 0 评论 -
ZOJ2812 Quicksum
#include<string> #include<iostream> #include<algorithm> using namespace std; int main(){ string str; while(getline(cin, str)){ if(str == "#") break; int k = 0; int ans = 0;...原创 2019-08-24 14:07:41 · 261 阅读 · 0 评论