Missan-CSDN博客

原创 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 312

原创 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 399

原创 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 265

原创 1088. Rational Arithmetic (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-13 16:29:39 304

原创 1087. All Roads Lead to Rome (30)

#include #include #include #include #include #include using namespace std;inline int id(char str[]) { int n = 0; for(int i = 0; i < 3; i ++) { n *= 26; n += (str[i] - 'A'); } return n;

2015-01-13 15:42:43 586

原创 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 249

原创 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 336

原创 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 284

原创 1083. List Grades (25)

#include #include #include #include #include using namespace std;struct record { char name[11]; char id[11]; int grade; bool operator<(const record &b) const { return grade > b.grade; }

2015-01-13 10:40:16 358

原创 1082. Read Number in Chinese (25)

#include #include #include using namespace std;char *pron[] = { "ling", "yi", "er", "san", "si", "wu", "liu", "qi", "ba", "jiu" };inline const char * unit(int i) { if(i == 1000) return " Qia

2015-01-13 10:20:31 423

原创 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 346

原创 1080. Graduate Admission (30)

#include #include #include #include using namespace std;#define N 40000#define M 100#define K 5struct student { int id; int ge; int gi; bool operator<(const student &b) const { int t1

2015-01-12 19:57:57 227

原创 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 308

原创 1078. Hashing (25)

#include #include #include #include using namespace std;int nextprime(int n) { if(n > 1) { for(;; n++) { bool prime = true; for(int i = 2; i*i <= n; i ++) { if(n%i == 0) { prim

2015-01-12 18:44:51 265

原创 1077. Kuchiguse (20)

#include #include #include #include using namespace std;#define N 100int main(int argc, char **argv) { int n; scanf("%d", &n); getchar(); char line[N][300] = {{}}; int length[N] = {};

2015-01-12 18:08:51 242

原创 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 357

原创 1075. PAT Judge (25)

#include #include #include #include #include #include using namespace std;#define N 10001#define K 6struct user { int id; int ts; int psp; bool operator<(const user &b) const { if(ts

2015-01-12 16:20:43 372

原创 1074. Reversing Linked List (25)

#include #include #include #include #include #include using namespace std;#define N 100000bool reverse(int &head, int &last, int key[], int next[], int k) { if(head != -1) { int i = 0;

2015-01-12 15:35:47 232

原创 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 274

原创 1072. Gas Station (30)

#include #include #include #include #include using namespace std;#define N 1010struct road { int next; int dist; road(int d1, int d2) : next(d1), dist(d2) {}};inline int uid(char str[]

2015-01-12 13:45:22 246

原创 1071. Speech Patterns (25)

#include #include #include #include #include using namespace std;inline bool alpha(char c) { return c >= '0' && c = 'a' && c = 'A' && c <= 'Z';}int main(int argc, char **argv) { map, int>

2015-01-11 23:08:30 314

原创 1070. Mooncake (25)

#include #include #include #include using namespace std;struct inv { double amount; double price; double ppu; bool operator<(const inv &b) const { return ppu > b.ppu; }};#define N 100

2015-01-10 21:34:25 368

原创 1069. The Black Hole of Numbers (20)

#include #include #include #include using namespace std;int main(int argc, char **argv) { int n; cin >> n; int d[4]; do { for(int i = 0; i < 4; i ++) { d[i] = n%10; n /= 10; } s

2015-01-10 21:16:45 291

原创 1068. Find More Coins (30)

#include #include #include #include using namespace std;#define N 10000bool check(int index, int sum, int remain, int total, int n, int cs[], vector &seq) { if(sum == total) return true;

2015-01-10 20:59:56 233

原创 1067. Sort with Swap(0,*) (25)

#include #include using namespace std;#define N 100000inline int root(int n, int rid[]) { while(n != rid[n]) n = rid[n]; return n;}inline void connect(int a, int b, int rid[], int count[])

2015-01-10 20:37:22 288

原创 1066. Root of AVL Tree (25)

#include #include using namespace std;struct node { int key; node *left, *right; int h;};inline void update(node *t) { int lh = t->left ? t->left->h : 0; int rh = t->right ? t->right->h :

2015-01-10 19:13:32 248

原创 1065. A+B and C (64bit) (20)

import java.util.Scanner;import java.math.BigInteger;public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for(int i = 1; i

2015-01-10 18:31:25 543

原创 1064. Complete Binary Search Tree (30)

#include #include #include #include using namespace std;void inorder(int t, int maxt, vector &tl){ if(t <= maxt) { inorder(t<<1, maxt, tl); tl.push_back(t); inorder((t<<1)+1, maxt, tl);

2015-01-10 18:12:41 306

原创 1063. Set Similarity (25)

#include #include #include #include using namespace std;#define N 51int countcommon(vector &_s1, vector &_s2) { vector *p1 = &_s1, *p2 = &_s2; if(p1->size() > p2->size()) swap(p1, p2); ve

2015-01-10 17:55:53 266

原创 1062. Talent and Virtue (25)

#include #include #include #include using namespace std;int L, H;struct man { int id; int vg; int tg; bool operator<(const man &b) const { if((vg+tg)^(b.vg+b.tg)) return vg+tg > b.vg

2015-01-10 16:39:20 223

原创 1061. Dating (20)

#include #include using namespace std;#define N 100char *day[] = { "MON", "TUE", "WED", "THU", "FRI", "SAT", "SUN" };int main(int argc, char **argv) { char s1[N], s2[N], *p1, *p2; scanf("%s%

2015-01-10 16:17:38 314

原创 1060. Are They Equal (25)

#include #include #include #include using namespace std;#define N 300void copydigits(int n[], char s1[], char s2[]) { int len1 = strlen(s1); for(int i = 0; i < len1; i ++) { n[100-1-i] = s

2015-01-10 15:38:33 285

原创 1059. Prime Factors (25)

#include #include #include using namespace std;int nextp() { static int flag[65536] = {}; static int p = 1; while((++p) < 65536 && flag[p]) ; if(p == 65536) return 0; for(int i = 2; i*p

2015-01-10 14:19:30 216

原创 1058. A+B in Hogwarts (20)

#include #include using namespace std;int main(int argc, char **argv) { int v[2][3]; for(int i = 0; i < 2; i ++) { scanf("%d.%d.%d", &v[i][0], &v[i][1], &v[i][2]); } int full[3] = { 0, 17,

2015-01-10 13:37:07 246

原创 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 253

原创 1056. Mice and Rice (25)

#include #include #include using namespace std;#define N 1000struct player { int rank; int id; bool operator<(const player &b) const { return rank < b.rank; }};int main(int argc, char

2015-01-10 01:19:59 183

原创 1055. The World's Richest (25)

#include #include #include #include using namespace std;struct people { string * name; int age; int wealth; bool operator<(const people & b) const { return (wealth != b.wealth) ? (wealt

2015-01-08 18:35:58 236

原创 1054. The Dominant Color (20)

#include #include using namespace std;int main(int argc, char **argv) { int m, n; cin >> m >> n; int dcolor, count = 0; for(int i = 0; i < m*n; i ++) { int color; scanf("%d", &color);

2015-01-08 16:54:03 228

原创 1053. Path of Equal Weight (30)

#include #include #include #include #include #include using namespace std;#define N 100struct path { vector *p; bool operator<(const path & b) const { bool flag = false; for(int i = 0;

2015-01-08 16:14:06 260

原创 1052. Linked List Sorting (25)

#include #include #include #include using namespace std;#define N 100000struct node { int key; int addr; bool operator<(const node & b) const { return key < b.key; }};int main(int arg

2015-01-08 15:23:58 197

空空如也

空空如也