2016年01月_lizhaowei213

原创 HDU 3308 LCIS

LCIS Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5890 Accepted Submission(s): 2555 Problem Description Given n integers. You ha

2016-01-31 14:59:27 355

原创 Android开发解决"ADB Not Responding"ADB占用冲突

在Android Studio里给真机调试的时候出现了"ADB Not Responding"。如果在环境均配置无误的情况下，一般原因都是那些PC上的安卓相关软件占用了ADB，比如，QQ，百度，360，各种刷机ROOT软件。解决方法:使用DOS命令首先进入控制台win+r->cmd adb运行的默认端口是5037，因此通过命令行 netstat -aon |findstr

2016-01-30 21:26:17 510

原创 SPOJ SUBST1 New Distinct Substrings

SUBST1 - New Distinct Substrings no tags Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T Output For each test case output o

2016-01-28 16:13:01 627

原创 UVA 11388 GCD LCM

#include long long G,L; int main() { int t; scanf("%d",&t); while(t--) { scanf("%lld%lld",&G,&L); if(L%G!=0) pr

2016-01-28 16:10:06 347

原创 HDU 2147 kiki's game

kiki's game Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/10000 K (Java/Others) Total Submission(s): 8869 Accepted Submission(s): 5285 Problem Description Recently kiki has

2016-01-28 16:08:57 271

原创 UVA 11538 Chess Queen

组合数学题排列组合算横的加竖的再算斜的，用数学公式化简，就能得到最后答案的公式了。 #include #include using namespace std; long long m,n; int main() { while(scanf("%lld%lld",&m,&n)>0) { if(m==0&&n==0)

2016-01-28 16:04:07 363

原创 CSU 1228 ACM小组的数字游戏

1228: ACM小组的数字游戏 Time Limit: 10 Sec Memory Limit: 128 MB Submit: 27 Solved: 18 [Submit][Status][Web Board] Description gestapolur近来喜欢上了一种填数字的游戏，如下图所示的4×4方格中，我们要选择从数字1到16来填满这十六个格子(Aij，其中i＝

2016-01-27 13:10:50 723

原创 CSU 1003 UC Browser

1003: UC Browser Time Limit: 1 Sec Memory Limit: 128 MB Submit: 1386 Solved: 465 [Submit][Status][Web Board] Description Brother Xi has recently bought a smart mobile phone. Now he surfs In

2016-01-27 13:05:05 1303

原创 CSU 1401 插入排序

1401: 插入排序 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 218 Solved: 108 [Submit][Status][Web Board] Description 每次选择序列最左边的数，然后将其插入到序列中任意一个位置。求至少需要重复进行多少次上述操作，才可以将序列变为一个递增序列。 Input

2016-01-27 13:02:33 439

原创 CodeForces 501B Misha and Changing Handles

B. Misha and Changing Handles time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Misha hacked the Codeforces site. Then h

2016-01-27 11:59:05 904

原创 CodeForces 501A Contest

A. Contest time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Misha and Vasya participated in a Codeforces contest. Unfor

2016-01-27 11:56:50 449

原创 CodeForces 617A Elephant

A. Elephant time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output An elephant decided to visit his friend. It turned out tha

2016-01-26 12:54:21 338

原创 CodeForces 614B Gena's Code

B. Gena's Code time limit per test 0.5 seconds memory limit per test 256 megabytes input standard input output standard output It's the year 4527 and the tanks game that we all kn

2016-01-26 11:34:13 778

原创 CodeForces 614A Link/Cut Tree

A. Link/Cut Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Programmer Rostislav got seriously interested in the

2016-01-25 22:28:31 599

原创 UVA 11646 Athletics Track

题目链接 http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=23833 这题完全是数学几何题，用几何知识解一下就得出来结果的公式了，一开始题没读明白。计算几何简单题。 #include #include #define PI 3.14159265358979 int main() {

2016-01-24 21:03:42 351

原创 CSU 1098 Happy watering

1098: Happy watering Time Limit: 1 Sec Memory Limit: 16 MB Submit: 132 Solved: 60 [Submit][Status][Web Board] Description GBQC国的小明家里有N棵树，每天小明都会给其中一棵树浇水，每次浇水后，树都会长高一些，但由于树的品种不同，每次增长的高度也有所区别。

2016-01-23 18:49:56 504

原创 CSU 1469 Handles

1469: Handles Time Limit: 1 Sec Memory Limit: 128 MB Submit: 258 Solved: 65 [Submit][Status][Web Board] Description 　　There are N·M handles on the ground. Every handle can be in one of tw

2016-01-23 18:16:47 331

原创 POJ 2533 Longest Ordered Subsequence

Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 42063 Accepted: 18507 Description A numeric sequence of ai is ordered if a1 a2 a

2016-01-23 17:45:56 319

原创 POJ 3671 Dining Cows

Dining Cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7758 Accepted: 3282 Description The cows are so very silly about their dinner partners. They

2016-01-23 12:45:01 736

原创 POJ 3617 Best Cow Line

Best Cow Line Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15366 Accepted: 4343 Description FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annu

2016-01-23 12:38:59 284

原创 CodeForces 603A Alternative Thinking

A. Alternative Thinking time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Kevin has just recevied his disappointing res

2016-01-21 20:58:19 856 1

原创 CodeForces 609C Load Balancing

C. Load Balancing time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output In the school computer room there are n servers whi

2016-01-21 12:34:49 335

原创 CodeForces 615A Bulbs

A. Bulbs time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasya wants to turn on Christmas lights consisting of m bulbs

2016-01-21 12:30:45 307

原创 CodeForces 14D Two Paths

D. Two Paths time limit per test 2 seconds memory limit per test 64 megabytes input standard input output standard output As you know, Bob's brother lives in Flatland. In Flatland

2016-01-20 22:21:29 671

原创 CodeForces 584E Anton and Ira

E. Anton and Ira time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Anton loves transforming one permutation into another

2016-01-20 09:20:40 374

原创 HDU 5522 Numbers

Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/262144 K (Java/Others) Total Submission(s): 924 Accepted Submission(s): 517 Problem Description There are n numbers A1,

2016-01-19 19:02:10 387

原创 CodeForces 27E Number With The Given Amount Of Divisors

E. Number With The Given Amount Of Divisors time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Given the number n, find

2016-01-19 17:51:12 471

原创 CodeForces 527D Clique Problem

D. Clique Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output The clique problem is one of the most well-known NP

2016-01-19 08:30:28 481

原创 CodeForces 527C Glass Carving

C. Glass Carving time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Leonid wants to become a glass carver (the

2016-01-18 11:32:11 523

原创 HDU 3911 Black And White

Black And White Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4447 Accepted Submission(s): 1297 Problem Description There are

2016-01-17 15:31:15 538

原创 CodeForces 584D Dima and Lisa

D. Dima and Lisa time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Dima loves representing an odd number as th

2016-01-17 15:05:09 527

原创 CodeForces 527A Playing with Paper

A. Playing with Paper time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One day Vasya was sitting on a not so

2016-01-17 14:57:42 329

原创 CodeForces 527B Error Correct System

B. Error Correct System time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Ford Prefect got a job as a web dev

2016-01-17 14:25:17 283

原创 POJ 3667 Hotel

Hotel Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 14702 Accepted: 6356 Description The cows are journeying north to Thunder Bay in Canada to gain cul

2016-01-16 14:04:39 238

原创 UVA 11300 Spreading the Wealth

UVA - 11300 分金币问题，大白书上的一道题，具体的过程第一次看的感觉很神奇，后来边看边想，确实这个中位数求的很有道理。这道题通过建模列n个方程，可以抽象成给定数轴上n个点，在数轴上的所有点中，中位数离所有点的距离之和最小。想了想，假设最优点向中位数点左侧移动d距离，那么原来在左边的点距离之和减去a个d,原来在右边的点距离之和加上a个d.总距离不变。但是中位数和最优点之间

2016-01-13 22:06:58 258

原创 UVA 11729 Commando War

UVA - 11729 寒假到了，刷题又开始了。贪心小水题按照J的值排降序，判断做完上一次最耗时的事情后，这一次做完结束的时间是在后还是在前，在前则表明上一次做完的时候，这一次早已做完，在后，则取B的累加+这一次的J #include #include #define N 1005 using namespace std; typedef struct {

2016-01-13 18:59:50 344

lizhaowei213的博客