JamesDoctor的专栏

逐步更新中。。。第1章110101     The 3n+1 problem                解答110102     Minesweeper                         解答110104     LC-Display                               解答110105     Gr

// Max = 1 + C(n, 2) + C(n, 4)// Refer to http://en.wikipedia.org/wiki/Dividing_a_circle_into_areas or // http://www.arbelos.co.uk/Papers/Chords-regions.pdf #include #include #include using

#include #include #include #include using namespace std;static int FindNumber(const vector& src, int target, int start, int end){ if (end < start) return -1; int mid = (start + end) / 2;

#include using namespace std;class SternBrocotNo{public: SternBrocotNo(int x, int y) : m_x(x), m_y(y) {} SternBrocotNo(const SternBrocotNo& other) : m_x(other.m_x), m_y(other.m_y) {} bool o

#include using namespace std;static int C(int n, int k){ if (k == 0) return 1; int a = 1, b = 1; for (int i = 1; i <= k; ++i) { b *= i; a *= n; --n; } return a / b;}static int

This solution gets "Wrong answer" result inhttp://www.programming-challenges.com/,but it gets "Accepted" result inhttp://uva.onlinejudge.org/.I don't know why so far.#include #include

#include #include using namespace std;static int s_Multiplier[] = {0, 1, 0, 7, 0, 0, 0, 3, 0, 9};static void Multiply(int src, int multiplier, int& result, int& flag){ result = src * multipli

// Suppose the given number is X, then// X*(10^Y) Y*log10 + logX < N < Y*log10 + log(X+1)// Another limitation is: Y > int(lgX) + 1#include #include using namespace std;static int SmallestIn

#include #include #include #include #include using namespace std;static bool IsReverse(const char* num, int len){ int mid = len / 2; for (int i = 0; i < mid; ++i) { if (num[i] != num[len

#include #include using namespace std;#define BUF_SIZE 1024static bool Add(const char& ch1, const char& ch2, bool currentFlag){ int num1 = ch1 - '0'; int num2 = ch2 - '0'; int flag = curren

This solution gets "Wrong answer" result inhttp://www.programming-challenges.com/,but it gets "Accepted" result inhttp://uva.onlinejudge.org/.I don't know why so far.#include #include

This solution gets "Wrong answer" result inhttp://www.programming-challenges.com/,but it gets "Accepted" result inhttp://uva.onlinejudge.org/.According to the explanation in http://www.program

#include #include #include #include using namespace std;static void GetDigitsFromNumber(int number, int& thousands, int& hundreds, int& tens, int& ones){ ones = number % 10; number /= 10; t

#include #include #include #include using namespace std;class TouristGuid{public: TouristGuid(int cities, int roads) { int city1, city2, capacity; m_cities.resize(cities); for (int i

#include #include #include using namespace std;class Graph{public: Graph(int vertexCnt) { m_vertexCnt = vertexCnt; int edges; cin >> edges; m_relations = new bool*[m_vertexCnt];

// Refer to http://blog.youkuaiyun.com/metaphysis/article/details/6553011 to see the design of following program.import java.util.*;public class Main { private static void ClearArray(long[][] data, int

import java.util.*;import static java.lang.Math.*;public class Main { private static List s_Primes; static { s_Primes = new LinkedList(); s_Primes.add(2L); long limit = (long)sqrt(200000

import java.util.*;public class Main { private static void EuclidAlgorithm(int a, int b) { if (a < b) { EuclidAlgorithm(b, a); int temp = ResultX; ResultX = ResultY; ResultY = te

import java.util.*;import static java.lang.Math.*;public class Main { private static Map s_PrimesInfo; static { s_PrimesInfo = new HashMap(); } private static boolean IsPrime(int x) { B

import java.util.*;import static java.lang.Math.*;public class Main { private static boolean IsPrime(int x) { int mid = (int)(sqrt(x)); for (int i = 2; i <= mid; ++i) if ((x % i) == 0)

import java.util.*;public class Main { private static long GetGCD(long a, long b) { if (a == b) return a; if (a < b) return GetGCD(b, a); while(true) { long temp = b; b =

import java.util.*;import static java.lang.Math.*;public class Main { private static boolean IsPrime(long number) { long mid = (long)(sqrt((double)number)); for (long i = 2; i <= mid; ++i)

//import java.io.*;import java.util.*;import static java.lang.Math.*;class Main implements Runnable{ /* static String ReadLn(int maxLength){ // utility function to read from stdin,

#include #include #include using namespace std;class Integer{public: Integer(const char* buf, int len) { Init(buf, len); } Integer() {} void Init(const char* buf, int len) { for (

#include #include #include #include #include #include using namespace std;static const int STEP = 4;static const int UNIT = pow(10, STEP);class Integer{public: Integer(char* buf, int le

#include #include using namespace std;class Integer{public: Integer(char* buf, int len) { for (int i = 0; i < len; ++i) m_data.push_back(buf[i] - '0'); } Integer() {} void Print()

This solution gets "Wrong answer" result inwww.programming-challenges.com/,but it gets "Accepted" result inhttp://uva.onlinejudge.org/.According to the explanation in http://www.programm

#include using namespace std;class ShoeMaker{public: void Init(int index, int days, int punishment) { m_index = index; m_days = days; m_punishment = punishment; } class Comparer { p

#include #include #include #include #include #include #include using namespace std;#define ERDOS "Erdos, P."struct AuthorInfo{public: AuthorInfo(const string& authorName) : m_Name(autho

#include #include #include using namespace std;void SetStrikeDays(char* pDays, int nDays, int interval){ for(int i = interval; i <= nDays; i += interval) { int day = i % 7; if ((day != 6)

#include #include using namespace std;#define DIM_SIZE (8 + 2 + 2)#define LINE_SIZE 8#define DELTA ((DIM_SIZE - LINE_SIZE) / 2)enum ChessType_t{ BLACK = 0, WHITE};class Chess{public:

#include #include #include #include #include #include using namespace std;typedef unsigned int SIZE_t;typedef char DATA_t;static char s_Elems[] = {' ', '-', '|'};static bool s_Properties[

#include #include #include #include using namespace std;typedef unsigned int Dim_t;class MineMatrix{public: MineMatrix(Dim_t rows, Dim_t cols) : m_rows(rows + 2), m_cols(cols + 2), m_Mi

#include #include #include #include #include using namespace std;#define POKER_CNT 52#define LINE_BUF_CNT 6static char s_Line[LINE_BUF_CNT];void ShuffleOnPokers(int* target, int* shuffleMe

#include #include #include #include #include #include using namespace std;#define MAX_WORD_LEN 16#define MAX_BUF_SIZE 4096typedef vector DictStrCol_t;typedef vector LineStrCol_t;typedef ma

#include #include #include #include using namespace std;enum Color_t{ RED_HEART, BLACK_HEART, SQUARE, GRASS};enum RankType_t{ MAX = 0, PAIR, DOUBLE_PAIR, TRIPLE, SEQ, SAME_COLOR,

#include using namespace std;inline int abs(int prev, int next){ int sub = next - prev; if (sub < 0) return -sub; return sub;}inline void OutputResult(bool success){ if (success) { c

#include #include #include #include using namespace std;#define BIT_CNT 3#define REG_CNT 10#define MEM_CNT 1000#define ADD(x, y) (((x) + (y)) % 1000)#define MULT(x, y) (((x) * (y)) % 1000)

#include #include #include #include using namespace std;#define MAX_DIM 250#define INIT_COLOR 'O'typedef int Dim_t;typedef char Color_t;struct Graph{ Graph() : Row(0), Col(0) {

#include #include #include #include #include #include using namespace std;#define PUNISH_TIME 20class Team{public: Team(int no) : m_No (no), m_solvedProblems(0), m_totalTime(0) { } ~