PAT-乙级
springflower02
来吧,来吧,一起来吧
展开
-
PAT-乙-1025 1025 反转链表 (25 分)
代码#include <iostream>#include <vector>using namespace std;const int MAX = 100000;struct node { int id; int data; int next;};int main() { int start, n, k; scanf("%d %原创 2018-10-15 21:51:16 · 1051 阅读 · 0 评论 -
PAT-乙-1060 1060 爱丁顿数 (25 分)
代码#include <iostream>#include <algorithm>#include <vector>using namespace std;int main() { int n; cin>>n; vector<int> v; for(int i=0; i<n; i++) { int ...原创 2018-10-26 20:08:41 · 203 阅读 · 0 评论 -
PAT-乙-1061 1061 判断题 (15 分)
代码#include <stdio.h>int main() { int n, m; scanf("%d %d", &n, &m); int score[m] = {0}; int ans[m] = {0}; for(int i=0; i<m; i++){ scanf("%d", &score[i]); } for...原创 2018-10-26 21:47:35 · 155 阅读 · 0 评论 -
PAT-乙-1062 1062 最简分数 (20 分)
代码#include <iostream>#include <algorithm>using namespace std;int maxCommon(int a, int b) { if(a>b) { swap(a, b); } while(b%a) { int t = b%a; b = a; a = t; } return a...原创 2018-10-26 22:03:07 · 291 阅读 · 0 评论 -
PAT-乙-1063 1063 计算谱半径 (20 分)
代码#include <stdio.h>#include <math.h>int main() { int n; scanf("%d", &n); double max = 0; for(int i=0; i<n; i++){ int a, b; scanf("%d %d", &a, &b); double t ...原创 2018-10-26 22:07:14 · 129 阅读 · 0 评论 -
PAT-乙-1064 1064 朋友数 (20 分)
代码#include <iostream>#include <vector>#include <set>#include <algorithm>using namespace std;int main() { int n; cin>>n; vector<int> v; for(int i=0; i&...原创 2018-10-26 23:37:48 · 152 阅读 · 0 评论 -
PAT-乙-1074 1074 宇宙无敌加法器 (20 分)
代码#include <iostream>using namespace std;int main(){ string s, s1, s2; cin>>s>>s1>>s2; while(s1.length()<s.length()){ s1 = "0" + s1; } while(s2.length()<...原创 2018-10-31 18:59:02 · 407 阅读 · 0 评论 -
PAT-乙-1075 1075 链表元素分类 (25 分)
代码#include <iostream>#include <vector>using namespace std;const int MAX = 100000;struct node { int id; int data; int next;};int main() { int start, n, k; scanf("%d %d %d...原创 2018-10-31 19:17:49 · 641 阅读 · 0 评论 -
PAT-乙-1076 1076 Wifi密码 (15 分)
代码#include <iostream>using namespace std;int main(){ int n; cin>>n; string ans; for(int i=0; i<n; i++){ string s; for(int j=0; j<4; j++){ cin>>s; if(s.a...原创 2018-10-31 19:20:38 · 205 阅读 · 0 评论 -
PAT-乙-1077 1077 互评成绩计算 (20 分
代码#include <iostream>#include <vector>#include <algorithm>using namespace std;int main() { int N, M; scanf("%d %d", &N, &M); for(int i=0; i<N; i++) { vect...原创 2018-10-31 19:24:17 · 786 阅读 · 0 评论 -
PAT-乙-1059 1059 C语言竞赛 (20 分)
代码#include <iostream>#include <map>#include <math.h>using namespace std;bool isPrime(int n){ for(int i=2; i<=sqrt(n); i++){ if(n%i==0){ return false; } } return...原创 2018-10-26 19:59:03 · 222 阅读 · 0 评论 -
PAT-乙-1073 1073 多选题常见计分法 (20 分)
代码#include <iostream>#include <vector>#include <iomanip>#include <string.h>using namespace std;const int LEN = 5;struct ques { int score; int ans[LEN]; //答案向量,1表...原创 2018-10-29 20:05:57 · 581 阅读 · 0 评论 -
PAT-乙-1058 1058 选择题 (20 分)
代码#include <iostream>#include <vector>using namespace std;const int LEN = 5;struct ques { int score; int ans[LEN] = {0}; //答案向量,1表示含此答案,0表示不含此答案 int wrongNum = 0; //答错次数};i...原创 2018-10-29 19:59:27 · 396 阅读 · 0 评论 -
PAT-乙-1050 1050 螺旋矩阵 (25 分)
代码#include <stdio.h>#include <math.h>#include <algorithm>#include <string.h>using namespace std;int main() { int n; scanf("%d", &n); int a[n]; for(int i=0; i...原创 2018-10-15 22:54:58 · 804 阅读 · 0 评论 -
PAT-乙-1051 1051 复数乘法 (15 分)
代码#include <stdio.h>#include <math.h>int main() { double r1, p1, r2, p2; scanf("%lf %lf %lf %lf", &r1, &p1, &r2, &p2); double ans1 = r1 * r2 * cos(p1) * cos(p2) -...原创 2018-10-19 22:19:35 · 685 阅读 · 2 评论 -
PAT-乙-1034 1034 有理数四则运算 (20 分)
代码#include &lt;iostream&gt;#include &lt;math.h&gt;using namespace std;struct fenshu { long long int fenzi; long long int fenmu;};long long int maxFactor(long long int a, long long int b) {...原创 2018-10-22 13:11:27 · 192 阅读 · 0 评论 -
PAT-乙-1052 1052 卖个萌 (20 分)
代码#include <iostream>#include <vector>using namespace std;const int SIZE = 3;int main() { string s[SIZE]; for(int i=0; i<SIZE; i++){ getline(cin, s[i]); } vector< ve...原创 2018-10-21 09:27:12 · 450 阅读 · 0 评论 -
PAT-乙-1053 1053 住房空置率 (20 分)
代码#include <stdio.h>int main() { int n, D; double e; scanf("%d %lf %d", &n, &e, &D); double re1 = 0; double re2 = 0; for(int i=0; i<n; i++){ int K; scanf("%d", &a...原创 2018-10-21 15:41:36 · 391 阅读 · 0 评论 -
PAT-乙-1054 1054 求平均值 (20 分)
代码import java.math.BigDecimal;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); double sum ...原创 2018-10-21 20:03:09 · 268 阅读 · 0 评论 -
PAT-乙-1055 1055 集体照 (25 分)
代码#include <iostream>#include <algorithm>#include <vector>using namespace std;struct Stu{ string name; int height;};int compare(Stu a, Stu b){ if(a.height!=b.height){...原创 2018-10-21 20:23:33 · 485 阅读 · 0 评论 -
PAT-乙-1056 1056 组合数的和 (15 分)
代码#include <stdio.h>int main() { int n; scanf("%d", &n); int a[n]; for(int i=0; i<n; i++){ scanf("%d", &a[i]); } int sum = 0; for(int i=0; i<n; i++){ for(int...原创 2018-10-21 21:04:16 · 159 阅读 · 0 评论 -
PAT-乙-1057 1057 数零壹 (20 分)
代码#include <iostream>using namespace std;int main() { string s; getline(cin, s); int sum = 0; for(int i=0; i<s.length(); i++){ if(s.at(i)>='A' && s.at(i)<='Z')...原创 2018-10-21 21:09:25 · 164 阅读 · 0 评论 -
PAT-乙-1078 1078 字符串压缩与解压 (20 分)
代码#include <iostream>#include <sstream>using namespace std;int strToInt(string s) { stringstream ss; int t; ss<<s; ss>>t; return t;}int main() { string s1, s2...原创 2018-10-31 19:29:51 · 171 阅读 · 0 评论 -
PAT-乙-1065 1065 单身狗 (25 分)
代码#include <iostream>#include <vector>#include <algorithm>using namespace std;const int MAX = 100000;int main() { int n; scanf("%d", &n); int m[MAX] = {-1}; for(...原创 2018-10-27 07:28:36 · 639 阅读 · 1 评论 -
PAT-乙-1066 1066 图像过滤 (15 分)
代码#include <stdio.h>int main() { int n, m; int a, b, c; scanf("%d %d %d %d %d", &n, &m, &a, &b, &c); int s[n][m]; for(int i=0; i<n; i++) { for(int j=0; j<...原创 2018-10-27 07:33:55 · 252 阅读 · 0 评论 -
PAT-乙-1087 1087 有多少不同的值 (20 分)
代码#include <stdio.h>int main(){ int n; scanf("%d", &n); int a[15000] = {0}; for(int i=1; i<=n; i++){ a[i/2 + i/3 + i/5] = 1; } int count = 0; for(int i=0; i<15000; ...原创 2018-11-03 22:02:16 · 127 阅读 · 0 评论 -
PAT-乙-1085 1085 PAT单位排行 (25 分)
代码#include <iostream>#include <map>#include <algorithm>using namespace std;struct company { int rank; string name; int sum; double sumtmp; int count;};int compare(co...原创 2018-11-04 14:16:17 · 216 阅读 · 0 评论 -
PAT-乙-1088 1088 三人行 (20 分)
代码#include <stdio.h>#include <math.h>int me, x, y;int print(double t){ if(me==t){ printf(" Ping"); } else if(me<t){ printf(" Cong"); } else{ printf(" Gai"); }}int...原创 2018-11-04 15:25:59 · 369 阅读 · 0 评论 -
PAT-乙-1089 1089 狼人杀-简单版 (20 分)
代码#include <iostream>#include <sstream>using namespace std;int strToInt(string s){ stringstream ss; ss<<s; int a; ss>>a; return a;}int main() { int n; cin&...原创 2018-11-04 16:23:44 · 782 阅读 · 0 评论 -
PAT-乙-1090 1090 危险品装箱 (25 分)
代码#include <iostream>#include <vector>using namespace std;const int MAX = 100001;int main() { int n, m1; cin>>n>>m1; vector< vector<int> > v(MAX); ...原创 2018-11-04 16:47:55 · 526 阅读 · 0 评论 -
PAT-乙-1084 1084 外观数列 (20 分)
代码#include <iostream>using namespace std;int main() { string d; int N; cin>>d>>N; while(--N){ string ans; char c = d[0]; int count = 0; for(int i=0; i<d.l...原创 2018-11-08 23:03:20 · 121 阅读 · 0 评论 -
PAT-乙-1093 1093 字符串A+B (20 分)
代码#include <iostream>using namespace std;int main() { string s1, s2; getline(cin, s1); getline(cin, s2); int a[128] = {0}; for(int i=0; i<s1.length(); i++){ if(a[s1.at(i)]==...原创 2018-12-26 21:22:58 · 288 阅读 · 0 评论 -
PAT-乙-1092 1092 最好吃的月饼 (20 分)
代码#include &lt;iostream&gt;#include &lt;vector&gt;using namespace std;int main() { int n,m; cin&gt;&gt;n&gt;&gt;m; long num[n] = {0}; int max = -1; vector&lt;int&原创 2018-12-26 21:19:42 · 581 阅读 · 0 评论 -
PAT-乙-1091 1091 N-自守数 (15 分)
代码#include &lt;iostream&gt;#include &lt;sstream&gt;using namespace std;string intToString(int a){ stringstream ss; ss&lt;&lt;a; string s; ss&gt;&gt;s; return s;}int main() { i原创 2018-12-26 21:12:17 · 356 阅读 · 0 评论 -
PAT-乙-1086 1086 就不告诉你 (15 分)
代码#include <iostream>#include <sstream>using namespace std;string intToString(long long t){ stringstream ss; ss<<t; string tmp; ss>>tmp; return tmp;}int stringT...原创 2018-11-03 21:58:17 · 586 阅读 · 0 评论 -
PAT-乙-1083 1083 是否存在相等的差 (20 分)
代码#include <iostream>#include <map>#include <math.h>using namespace std;int main() { int n; cin>>n; map<int, int> m; for(int i=1; i<=n; i++){ int t; ...原创 2018-11-03 21:52:33 · 175 阅读 · 0 评论 -
PAT-乙-1082 1082 射击比赛 (20 分)
代码#include <stdio.h>#include <math.h>int main() { double min = 10000; double max = -1; int N; scanf("%d", &N); int minId; int maxId; for(int i=0; i<N; i++) { i...原创 2018-11-03 21:48:42 · 129 阅读 · 0 评论 -
PAT-乙-1067 1067 试密码 (20 分)
代码#include <iostream>using namespace std;int main() { string s; int n; cin>>s>>n; string t; getline(cin, t); int tryNumber = 0; getline(cin, t); while(t.compare("#...原创 2018-10-27 07:37:54 · 215 阅读 · 0 评论 -
PAT-乙-1068 1068 万绿丛中一点红 (20 分)
代码#include <iostream>#include <map>#include <math.h>using namespace std;const int MAX = 1001;long long int a[MAX][MAX];int count = 0;int row;int col;map<long long i...原创 2018-10-27 08:57:12 · 195 阅读 · 0 评论 -
PAT-乙-1069 1069 微博转发抽奖 (20 分)
代码#include <iostream>#include <vector>#include <map>using namespace std;int main() { int m, n, s; cin>>m>>n>>s; string str; getline(cin, str); ve...原创 2018-10-27 09:21:33 · 261 阅读 · 0 评论