PAT
文章平均质量分 76
司马如若
凡心所向,素履所往,生如逆旅,一苇以航。
展开
-
PAT 1001
算法:取余压栈部分正确时:①注意输出格式里有逗号。②余数为0时,printf("%03d", s.top());③结果为1000时,输出位1,000。#include #include using namespace std;int main(){ stack s; int a, b; cin >> a >> b; if (a +原创 2016-08-18 09:43:26 · 246 阅读 · 0 评论 -
PAT(A) 101-133-1-2016-03-12 A. Finding Average (20)
A. Finding Average (20)时间限制 400 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 CHEN, YueThe basic task is simple: given N real numbers, you are suppos原创 2016-09-04 16:01:47 · 293 阅读 · 0 评论 -
PAT 1009
指数相加,系数相乘参考 1002#include #include #include using namespace std;map S1;map S2;map S3;int g_K = 0;//S3的项数void input(){ int K; cin >> K; while (--K >= 0) { int N; float A; ci原创 2016-08-25 12:31:25 · 220 阅读 · 0 评论 -
PAT 1008
#include using namespace std;int main(){ int N; cin >> N; int next, now = 0, sum = 0; while (N--) { cin >> next; if (next - now > 0) { sum += 6 * (next - now) + 5; } else {原创 2016-08-25 09:42:23 · 232 阅读 · 0 评论 -
PAT 1007
#include #include #include using namespace std;int main(){ int N, temp, sum = -1, sumTemp, start, end; vectora; cin >> N; for (int i = 0; i < N; ++i) { cin >> temp; a.push_back(temp);转载 2016-08-25 09:16:19 · 181 阅读 · 0 评论 -
PAT 1006
#include #include using namespace std;typedef struct member{ string id; string inTime; string outTime;}MEM;string first = "24:59:59";string last = "00:00:00";string firstId;string last原创 2016-08-25 08:53:24 · 263 阅读 · 0 评论 -
PAT 1005
思路:①输入的类型是string②string-int转换后,求和③int-string转换后,得出英文单词#include #include #include using namespace std;int main(){ string s; cin >> s; int n, sum = 0; for (auto c : s) { n = (int)c原创 2016-08-24 12:44:31 · 228 阅读 · 0 评论 -
PAT 1004
#include #include #include using namespace std;map >Tree;int record[101] = { 0 };void DFS(int ID, int level){ if (Tree[ID].empty()) { ++record[level]; return; } vector::iterator ite转载 2016-08-23 15:08:21 · 223 阅读 · 0 评论 -
PAT 1003
#include using namespace std;int N, M, C1, C2;int numTeam[501];int road[501][501];int visit[501];int minDistance = -1, maxAmount = -1;int cnt = 0;void input(){ cin >> N >> M >> C1 >> C转载 2016-08-23 14:44:43 · 236 阅读 · 0 评论 -
PAT 1012
#include #include #include #define MAX_NUM 0x7fffffff using namespace std;struct node{ string num; int score[4]; int bestRank; int bestCourse;};char map[4] = { 'C', 'M', 'E', 'A' };in转载 2016-08-30 14:26:17 · 195 阅读 · 0 评论 -
PAT 1002
算法:multimap注意:①求和后系数为0时,不计算其项数。②精确度。#include #include #include using namespace std;multimap S1;map S2;int g_K = 0;//S3的项数void input(){ int K; cin >> K; while (--K >= 0) {原创 2016-08-18 11:25:52 · 252 阅读 · 0 评论 -
PAT 1011
#include #include using namespace std;char S[3] = { 'W', 'T', 'L' };vector vi;int main(){ float a, temp, sum = 1.0; int i, j, index; for (i = 0; i < 3; ++i) { temp = 0; for (j = 0; j <原创 2016-08-26 09:21:12 · 163 阅读 · 0 评论