PAT
Missan
这个作者很懒,什么都没留下…
展开
-
1085. Perfect Sequence (25)
#include #include #include #include using namespace std;#define N 100000int main(int argc, char **argv) { int n, p; cin >> n >> p; long long seq[N] = {}; for(int i = 0; i < n; i ++) { s原创 2015-01-13 11:11:27 · 351 阅读 · 0 评论 -
1007. Maximum Subsequence Sum (25)
#include using namespace std;#define N 10000int main(int argc, char **argv) { int a[N]; int K, b, e, sum, xsum, mb, me; cin >> K; for(int i = 0;i < K; i ++) { cin >> a[i]; } xsum = -1原创 2014-12-31 20:56:34 · 202 阅读 · 0 评论 -
1008. Elevator (20)
#include using namespace std;int main(int argc, char **argv) { int n, a, b, time; b = 0; time = 0; cin >> n; for(int i = 0; i < n; i ++) { cin >> a; if(a > b) { time += (a-b)*6; }原创 2014-12-31 21:09:31 · 272 阅读 · 0 评论 -
1003. Emergency (25)
#include using namespace std;#define N 500struct Node { int d; int paths; int maxteam; bool done;};int main(int argc, char **argv) { int m, n, src, dst, c1, c2; int adj[N][N] = {{0}}, te原创 2014-12-31 16:48:49 · 163 阅读 · 0 评论 -
1005. Spell It Right (20)
#include #include using namespace std;#define N 101const char * digits[] = { "zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" };int main(int argc, char **argv) {原创 2014-12-31 20:02:21 · 196 阅读 · 0 评论 -
1006. Sign In and Sign Out (25)
#include #include #include using namespace std;int main(int argc, char **argv) { int n; cin >> n; map inR; map outR; for(int i = 0; i < n; i ++) { string id, inT, outT; cin >> id >> in原创 2014-12-31 20:16:38 · 243 阅读 · 0 评论 -
1001. A+B Format (20)
#include using namespace std;#define N 20int main(int argc, char **argv) { int a, b, sum; char sumstr[N]; cin >> a >> b; sum = a+b; bool flag = true; if(sum < 0) { flag = false; sum = -原创 2014-12-31 12:55:59 · 207 阅读 · 0 评论 -
1002. A+B for Polynomials (25)
#include #include using namespace std;#define N 1001int main(int argc, char **argv) { int K, n; double a[N] = {0}, c; for(int i = 0; i < 2; i ++ ) { cin >> K; for(int j = 0; j <原创 2014-12-31 14:17:15 · 263 阅读 · 0 评论 -
1010. Radix (25)
#include #include using namespace std;long long str2decimal(string &str, long long radix) { long long decimal = 0, oldvalue = 0; for(int i = 0; i < str.length(); i ++) { decimal *= radix; de原创 2015-01-01 01:05:29 · 243 阅读 · 0 评论 -
1009. Product of Polynomials (25)
#include #include #include using namespace std;#define N 1001int main(int argc, char **argv) { int K, n; double c[2][N] = {{0}}, p[N*2] = {0}; double co; for(int i = 0; i < 2; i ++ ) {原创 2014-12-31 22:51:58 · 225 阅读 · 0 评论 -
1004. Counting Leaves (30)
#include #include using namespace std;#define N 100int main(int argc, char **argv) { int n, m; int pid, cid, cn; list tree[N]; cin >> n >> m; for(int i = 0; i < m; i ++) { cin >> pid >>原创 2014-12-31 19:34:07 · 198 阅读 · 0 评论 -
1046. Shortest Distance (20)
#include #include #include #include using namespace std;#define N 100000#define step 1000int main(int argc, char **argv) { int n, m; int dist[N] = {}; int ld[N/step] = {}; cin >> n; in原创 2015-01-07 21:26:50 · 240 阅读 · 0 评论 -
1057. Stack (30)
#include #include #include #include #include #include #include using namespace std;#define N 100001void adjust(int &mid, int d, int push, int oldsize, int count[], int index[]) { if(push)原创 2015-01-10 13:22:09 · 266 阅读 · 0 评论 -
1073. Scientific Notation (20)
#include #include #include #include #include using namespace std;int main(int argc, char **argv) { bool sign = getchar() == '+'; vector digits; digits.push_back(getchar() - '0'); getchar()原创 2015-01-12 14:04:31 · 295 阅读 · 0 评论 -
1076. Forwards on Weibo (30)
#include #include #include #include #include #include using namespace std;#define N 1001int count(int src, int n, vector sn[], int level) { bool done[N] = {}; int dist[N] = {}; int node原创 2015-01-12 17:04:51 · 368 阅读 · 0 评论 -
1079. Total Sales of Supply Chain (25)
#include #include #include using namespace std;#define N 100000inline double rate(int i, double rr[], double r) { if(!rr[i]) { int j = i; for(; !rr[j]; j --) ; for(j ++; j <= i; j ++) {原创 2015-01-12 19:25:21 · 328 阅读 · 0 评论 -
1081. Rational Sum (20)
import java.math.BigInteger;import java.util.Scanner;import java.util.regex.MatchResult;class Rational { BigInteger n, d;}public class Main { public static Rational add(Rational r1, Rationa原创 2015-01-12 22:06:18 · 359 阅读 · 0 评论 -
1086. Tree Traversals Again (25)
#include #include #include #include using namespace std;struct node { int key; node *left, *right;};struct command { int type; int key;};node * create(command cmd[], int &index, int n)原创 2015-01-13 11:56:11 · 265 阅读 · 0 评论 -
1084. Broken Keyboard (20)
#include #include #include using namespace std;int main(int argc, char **argv) { char line1[100], line2[100]; gets(line1); gets(line2); bool out[128] = {}, miss[128] = {}; for(char *p = lin原创 2015-01-13 10:49:22 · 298 阅读 · 0 评论 -
1090. Highest Price in Supply Chain (25)
#include #include #include using namespace std;int dist(int n, int rid[], int dc[]) { if(rid[n] != -1 && !dc[n]) { dc[n] = dist(rid[n], rid, dc) + 1; } return dc[n];}#define N 100000int原创 2015-01-13 18:26:37 · 420 阅读 · 0 评论 -
1091. Acute Stroke (30)
#include #include #include #include using namespace std;#define NONE 0xffffffffunsigned int slice[60][1286][128] = {{{}}};unsigned int m, n, l, t;inline unsigned int root(unsigned int i, un原创 2015-01-13 19:12:33 · 325 阅读 · 0 评论 -
1089. Insert or Merge (25)
#include #include #include #include #include #include using namespace std;#define N 100int main(int argc, char **argv) { int n; cin >> n; int a[2][N] = {{}}; for(int i = 0; i < 2; i ++)原创 2015-01-13 18:15:34 · 278 阅读 · 0 评论 -
1011. World Cup Betting (20)
#include #include using namespace std;char A[] = { 'W', 'T', 'L' };int main(int argc, char **argv) { double odd[3][3] = {{0}}; int index[3] = {0}; for(int i = 0; i < 3; i ++) { for(int j原创 2015-01-01 12:28:45 · 296 阅读 · 0 评论 -
1010. Radix (25) (JAVA)
import java.math.BigInteger;import java.util.Scanner;public class Main { static BigInteger str2int(byte[] str, BigInteger radix) { BigInteger d = BigInteger.valueOf(0); for(int i = 0; i < s原创 2015-01-01 09:57:43 · 502 阅读 · 0 评论 -
1012. The Best Rank (25)
#include #include #include #include #include using namespace std;struct score { int s[4];};char ci[] = "CMEA";int main(int argc, char **argv) { int n, m; map ss; vector crs[4]; cin原创 2015-01-02 19:00:40 · 210 阅读 · 0 评论 -
1020. Tree Traversals (25)
#include #include #include #include using namespace std;#define N 30struct TreeNode { int key; TreeNode * left; TreeNode * right;};TreeNode * create(int in[], int post[], int ia, int ib,原创 2015-01-04 14:38:02 · 370 阅读 · 0 评论 -
1022. Digital Library (30)
#include #include #include #include #include #include using namespace std;int main(int argc, char **argv) { int n; cin >> n; map > index[5]; char line[100]; string id; for(int i = 0; i原创 2015-01-04 23:01:08 · 289 阅读 · 0 评论 -
1026. Table Tennis (30)
#include #include #include #include #include #include #include using namespace std;#define K 101struct customer { int ct; int pt; int vip; bool operator<(const customer &b) const {原创 2015-01-05 15:43:13 · 386 阅读 · 0 评论 -
1029. Median (25)
#include #include #include using namespace std;int median(int *a, int a1, int a2, int *b, int b1, int b2) { int m1 = (a1+a2) >> 1; int m2 = (b1+b2) >> 1; if(a[m1] > b[m2]) { swap(a, b); sw原创 2015-01-05 18:43:26 · 204 阅读 · 0 评论 -
1029. Median (25) (easy way)
#include #include #include using namespace std;int main(int argc, char **argv) { int n1, n2; cin >> n1; int *pa = new int[n1]; for(int i = 0; i < n1; i ++) scanf("%d", pa+i); cin >> n2原创 2015-01-05 18:54:09 · 200 阅读 · 0 评论 -
1028. List Sorting (25)
#include #include #include #include #include using namespace std;struct student { static int sm; string * attr[3]; bool operator<(const student &b) const { int r = strcmp(attr[sm-1]->c_s原创 2015-01-05 16:30:26 · 168 阅读 · 0 评论 -
1031. Hello World for U (20)
#include #include #include using namespace std;#define N 500int main(int argc, char **argv) { char line[100]; gets(line); int len = strlen(line); int n1, n2; n1 = (len+2)/3; n2 = len+2 -原创 2015-01-05 21:03:47 · 187 阅读 · 0 评论 -
1027. Colors in Mars (20)
#include using namespace std;int main(int argc, char **argv) { char digits[] = "0123456789ABC"; cout << '#'; for(int i = 0; i < 3; i ++) { int a; cin >> a; cout << digits[a/13] << digits原创 2015-01-05 16:03:01 · 217 阅读 · 0 评论 -
1032. Sharing (25)
#include #include #include using namespace std;#define N 100000int wordlen(int src, int next[]) { int len; for(len = 0; src != -1; len ++, src = next[src]) ; return len;}int main(int argc原创 2015-01-05 21:40:15 · 206 阅读 · 0 评论 -
1024. Palindromic Number (25)
import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); BigInteger n = scanner.nextBigIntege原创 2015-01-04 23:49:36 · 243 阅读 · 0 评论 -
1023. Have Fun with Numbers (20)
import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); BigInteger[] n = new BigInteger[2];原创 2015-01-04 23:25:51 · 228 阅读 · 0 评论 -
1017. Queueing at Bank (25)
#include #include #include using namespace std;#define N 10000#define K 100int main(int argc, char **argv) { int n, k; int lst[K]; int sq[N]; int wt = 0; int count = 0; cin >> n >> k原创 2015-01-04 09:36:56 · 389 阅读 · 0 评论 -
1013. Battle Over Cities (25)
#include #include #include #include using namespace std;#define N 1001int visit(list adj[], int mark[], int n, int lost) { int count = 0; for(int v = 1; v <= n; v ++) { if(v == lost || mar原创 2015-01-03 01:03:56 · 261 阅读 · 0 评论 -
1013. Battle Over Cities (25) (Disjoint Set)
#include #include #include #include using namespace std;#define N 1001int root(int n, int p[]) { int i = n; while(p[i] != i) i = p[i]; return i;}int main(int argc, char **argv) { bool原创 2015-01-03 12:56:43 · 218 阅读 · 0 评论 -
1015. Reversible Primes (20)
#include #include using namespace std;#define N 1000000int reverse(int n, int radix) { int d[30]; int dn = 0; while(n) { d[dn++] = n%radix; n /= radix; } for(int i = 0; i < dn; i ++) {原创 2015-01-03 15:06:34 · 373 阅读 · 0 评论