HDOJ
xqch12345
这个作者很懒,什么都没留下…
展开
-
杭电OJ 2030汉字统计
#include <iostream>#include <string>using namespace std;char s[10000];int main(){ int T; cin >> T; getchar(); for (int i = 0; i < T; i++) { gets_s(s); int num = 0; ...原创 2018-05-30 16:02:53 · 256 阅读 · 0 评论 -
杭电OJ 1019 Least Common Multiple
求最小公倍数#include <iostream>#include <vector>using namespace std;int minMul(int a, int b){ if (b < a) swap(a, b); for (int i = a; i >= 1;i--) if (b%i == 0&&a%i==0) {...原创 2018-06-18 18:25:43 · 202 阅读 · 0 评论 -
杭电OJ 1018 Big Number
斯特林公式原创 2018-06-18 18:24:38 · 186 阅读 · 0 评论 -
杭电OJ 1017
#include <iostream>using namespace std;int main(){ int T; cin >> T; for (int i = 0; i < T; i++) { int m, n, num1 = 0; while (cin >> n >> m && (m != 0 || n...原创 2018-06-18 18:21:32 · 409 阅读 · 0 评论 -
杭电OJ 1013 Digital Roots
#include <iostream>#include <string>using namespace std;int main(){ string s; while (cin >> s&&s != "0") { int n=0; for (auto a : s) n += a - '0'; int sum = 0...原创 2018-06-18 18:20:17 · 213 阅读 · 0 评论 -
杭电OJ 1012 u Calculate e
#include <iostream>using namespace std;int main(){ cout << "n e" << endl; cout << "- -----------" << endl; double sum = 1.0; cout << 0 <&a原创 2018-06-18 18:19:10 · 208 阅读 · 0 评论 -
杭电 OJ 1009 FatMouse' Trade
#include <iostream>#include <vector>using namespace std;typedef struct { int J; int F; double pro;}MES;int main(){ int M, N; while (cin >> M >> N) { if (M == -1)...原创 2018-06-16 21:25:37 · 235 阅读 · 0 评论 -
杭电 OJ 1008 Elevator
#include <iostream>#include <vector>using namespace std;int main(){ int N; while (cin >> N&&N != 0) { int sum = N * 5; vector<int> vec(N); for (int i = 0;...原创 2018-06-16 21:23:58 · 135 阅读 · 0 评论 -
杭电 OJ 1006 Tick and Tick
开始直接通过概率论计算,精度不够一直WA#include <iostream>using namespace std;int main(){ int D; while (cin >> D&&D != -1) { double result = (360 - D * 3)* (360 - D * 3) / 360.0 / 360.0*100.0...原创 2018-06-16 21:21:42 · 1553 阅读 · 0 评论 -
杭电 OJ 1005
#include <iostream>#include <vector>using namespace std;int main(){ int A, B, n; while (cin >> A >> B >> n) { if (A == 0 && B == 0 && n == 0)原创 2018-06-16 21:18:19 · 140 阅读 · 0 评论 -
杭电OJ 1004 求出现次数最多的字符串
#include <string>#include <iostream>#include <vector>#include <map>using namespace std;int main(){ int T; while (cin >> T&&T!=0) { map<string,int>原创 2018-06-16 21:15:28 · 171 阅读 · 0 评论 -
杭电OJ 1003 求和最大连续子序列
#include <iostream>#include <vector>#include <algorithm>using namespace std;int main(){ int T; cin >> T; for (int i = 0; i < T; i++) { int n; cin >> n; ...原创 2018-06-16 21:13:17 · 261 阅读 · 0 评论 -
杭电OJ 1002 大数相加
#include <iostream>#include <string>using namespace std;int main(){ int n; cin >> n; for (int i = 0; i < n; i++) { string a, b; cin >> a >> b; cout <&...原创 2018-06-16 21:11:18 · 510 阅读 · 0 评论 -
杭电OJ 2031 进制转换
#include <iostream>#include <string>using namespace std;int main(){ int N, R; while (cin>>N>>R) { if (N < 0) cout << "-"; string s; N = abs(N); while..原创 2018-05-30 16:18:06 · 575 阅读 · 0 评论 -
杭电OJ 1021 Fibonacci Again
#include <iostream>using namespace std;int main(){ int a[8] = { 1, 2, 0, 2, 2, 1, 0, 1 }; int n; while (cin >> n) { if (a[n % 8]) cout << "no" << endl; else co...原创 2018-06-18 18:27:28 · 163 阅读 · 0 评论