badmartin-CSDN博客

原创 Paper Notes: Empirical Comparison of Algorithms for Network Community Detection

Paper title: Empirical Comparison of Algorithms for Network Community DetectionAuthor: Jure Leskovec, Kevin J.Lang, Michael W.MahoneyConference: WWW 2010, Raleigh, North Carolina, USAYear:

2013-10-29 21:03:04 1200

原创 Paper Notes: On Community Detection in Real-world Networks and the Importance of Degree Assortativit

Paper title: On Community Detection in Real-world Networks and the Importance of Degree AssortativitAuthor: Marek Ciglan, Michal Laclavik, Kjetil NorvagConference: KDD 2013, Chicago, Illinois,

2013-10-18 15:48:50 1298

原创 Google Practice Round_C: Moist

ProblemMoist has a hobby -- collecting figure skating trading cards. His card collection has been growing, and it is now too large to keep in one disorganized pile. Moist needs to sort the cards in

2013-09-14 14:42:53 1084

原创 Google Practice Round_A: Bad Horse

ProblemAs the leader of the Evil League of Evil, Bad Horse has a lot of problems to deal with. Most recently, there have been far too many arguments and far too much backstabbing in the League,

2013-09-14 14:34:23 2510 7

原创 PAT_1064: Complete Binary Search Tree

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node's key.The righ

2013-08-31 20:50:20 1030

原创 PAT_1063: Set Similarity

Given two sets of integers, the similarity of the sets is defined to be Nc/Nt*100%, where Nc is the number of distinct common numbers shared by the two sets, and Nt is the total number of distinct n

2013-08-31 20:42:34 1102

About 900 years ago, a Chinese philosopher Sima Guang wrote a history book in which he talked about people's talent and virtue. According to his theory, a man being outstanding in both talent and virt

2013-08-31 20:30:09 1000

原创 PAT_1061: Dating

Sherlock Holmes received a note with some strange strings: "Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm". It took him only a minute to figure out that those strange strings are a

2013-08-31 20:25:34 741

原创 PAT_1032: Sharing

To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may let the words share the same sublist if they share the same suffix. For example,

2013-08-29 15:38:40 612

原创 PAT_1031: Hello World for U

Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as:h de ll rlowoThat is, the characters must be pr

2013-08-29 11:23:19 748

原创 PAT_1034: Head of a Gang

One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a relation is defined to be t

2013-08-28 21:57:12 959

原创 PAT_1056: Mice and Rice

Mice and Rice is the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given map. The goal of each mouse is to eat as much rice

2013-08-28 19:04:16 1628 2

原创 PAT_1038: Recover the Smallest Number

Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-8

2013-08-28 12:42:18 774

原创 Paper Notes: Fast unfolding of communities in large networks

Paper title: Fast unfolding of communities in large networksAuthor: Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte and Etienne LefebvreJournal: Journal of Statistical Mechanics: Theory a

2013-08-26 21:12:41 1361

原创 Paper Notes: Online Community Detection for Large Complex Networks

自己学校的文章，仰慕一下~Paper title: Online Community Detection for Large Complex NetworksAuthor: Wangsheng Zhang, Gang Pan, Zhaohui Wu, Shijian LiConference: IJCAIYear: 2013My notes:This pap

2013-08-26 19:13:46 1043

原创 PAT_1048: Find Coins

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However,

2013-08-21 16:49:13 729

原创 PAT_1025: PAT Ranking

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists w

2013-08-21 14:36:03 644

原创 Paper Notes: Near linear time algorithm to detect community structures in large-scale networks

Paper title: Near linear time algorithm to detect community structures in large-scale networksAuthor: UN Raghavan, R Albert, S KumaraYear: 2007Journal: Physical ReviewMy notes: This pape

2013-08-19 15:18:20 1866 1

原创 PAT_1024: Palindromic Number

A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers

2013-08-15 10:04:10 670

原创 PAT_1023: Have Fun with Numbers

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number con

2013-08-13 22:44:45 690

原创 PAT_1022: Digital Library

A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number a

2013-08-10 12:55:51 907

原创 PAT_1060: Are They Equal

If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123*105 with simple chopping. Now given the number of significa

2013-08-09 16:16:11 808

原创 PAT_1059: Prime Factors

Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^k1* p2^k2 *…*pm^km.Input Specification:Each input file contains one test ca

2013-08-07 12:50:32 767

原创 PAT_1051: Pop Sequence

Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of t

2013-08-07 12:23:00 710

原创 PAT_1052: Linked List Sorting

A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now give

2013-08-05 10:08:26 742

原创 POJ_2386: Lake Counting

DescriptionDue to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains

2013-08-03 23:14:35 680

原创 PAT_1050: String Subtraction

Given two strings S1 and S2, S = S1 - S2 is defined to be the remaining string after taking all the characters in S2 from S1. Your task is simply to calculate S1 - S2 for any given strings. However,

2013-08-03 20:38:03 993

原创 PAT_1027: Colors in Mars

People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number, where the first 2 digits are for Red, the middle 2 dig

2013-08-02 20:47:29 859

原创 PAT_1028: List Sorting

Excel can sort records according to any column. Now you are supposed to imitate this function.InputEach input file contains one test case. For each case, the first line contains two integers N

2013-08-02 20:21:41 648

原创 PAT_1029: Median

Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The

2013-08-02 19:55:51 1153

原创 PAT_1030: Travel Plan

A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path b

2013-08-02 16:07:17 849

原创 PAT_1037: Magic Coupon

The magic shop in Mars is offering some magic coupons. Each coupon has an integer N printed on it, meaning that when you use this coupon with a product, you may get N times the value of that product b

2013-08-02 11:01:53 723

原创 PAT_1039: Course List for Student

Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who comes

2013-08-01 21:50:21 906

原创 PAT_1054: The Dominant Color

Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called the d

2013-08-01 20:00:08 915

原创 PAT_1055: The World's Richest

Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world's wealthiest people. Now you are supposed to simulate this job, but concentrate only on the peopl

2013-07-31 20:44:50 927

原创 PAT_1041: Be Unique

Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1, 104]. The first one who bets on

2013-07-30 10:28:09 727

原创 PAT_1053: Path of Equal Weight

Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum of the weights of all the nodes along the path from R to

2013-07-30 09:32:41 795

原创 PAT_1020: Tree Traversals

Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the cor

2013-07-26 23:27:50 727

原创 PAT_1021: Deepest Root

A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root

2013-07-26 18:35:35 765

原创 PAT_1016: Phone Bills

A long-distance telephone company charges its customers by the following rules:Making a long-distance call costs a certain amount per minute, depending on the time of day when the call is made. Wh

2013-07-25 21:44:16 838

空空如也

空空如也