2016年09月_huatian5

原创 Codeforces Round #189 (Div. 2) B

B. Ping-Pong (Easy Version)time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn this problem at each moment

2016-09-28 20:32:54 618

原创 POJ 3295 Tautology（构造）（栈）

TautologyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12068 Accepted: 4597DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six

2016-09-28 19:32:37 746 1

原创 CodeForces 417C（RCC 2014 Warmup (Div. 2) C）（构造）

C. Footballtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day, at the "Russian Code Cup" event it was

2016-09-28 18:56:21 770

原创 NYOJ 题目2 括号配对问题（栈）（指针）

括号配对问题时间限制：3000 ms | 内存限制：65535 KB难度：3描述现在，有一行括号序列，请你检查这行括号是否配对。输入第一行输入一个数N（0输出每组输入数据的输出占一行，如果该字符串中所含的括号是配对的，则输出Yes,如果不配对则输出No样例输入3[(])(])([[]()])样例输出NoNoYes

2016-09-25 21:55:28 421

原创 HDU-5904 LCIS(dp)

LCISTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 329 Accepted Submission(s): 144Problem DescriptionAlex has two sequences a1,a

2016-09-25 10:04:02 536

原创 Codeforces Round #373 (Div. 2)

A. Vitya in the Countrysidetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputEvery summer Vitya comes to visi

2016-09-24 10:16:36 610

原创 HDU 1171 Big Event in HDU(背包)（母函数）

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36462 Accepted Submission(s): 12654Problem DescriptionNowadays,

2016-09-21 22:41:21 784

原创 HDU-1878 欧拉回路（DFS）（并查集）

欧拉回路Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13302 Accepted Submission(s): 4964Problem Description欧拉回路是指不令笔离开纸面，可画过图中每条边仅一

2016-09-21 20:34:32 448

原创 hihocoder1143 骨牌覆盖问题·一（矩阵快速幂）

#1143 : 骨牌覆盖问题·一时间限制:10000ms单点时限:1000ms内存限制:256MB描述骨牌，一种古老的玩具。今天我们要研究的是骨牌的覆盖问题：我们有一个2xN的长条形棋盘，然后用1x2的骨牌去覆盖整个棋盘。对于这个棋盘，一共有多少种不同的覆盖方法呢？举个例子，对于长度为1到3的棋盘，我们有下面几种覆盖方式：

2016-09-21 17:07:35 512

原创 UVA 1395 Slim Span（MST）

http://vjudge.net/problem/UVA-1395题目大意：让求最小生成树满足苗条度最小的条件（苗条度：最大边与最小边的差值）思路：在书上。根据Kruskal的思想，当所有点连通了就停止枚举左边界，记录最小苗条度。紫书的代码好稠#include#include#include#include#include#includeusing namespace

2016-09-20 14:42:59 1318

原创 HDU-5879 Cure（精度）（极限）

CureTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7400 Accepted Submission(s): 1099Problem DescriptionGiven an integer n, we

2016-09-18 14:26:05 568

原创 HDU-5878 I Count Two Three(打表)

I Count Two ThreeTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 501 Accepted Submission(s): 256Problem DescriptionI will show yo

2016-09-18 11:36:28 1570

原创 codeforces 600 A. Extract Numbers（字符串模拟）

A. Extract Numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given string s. Let's call word any larg

2016-09-16 22:28:09 571

原创 HDU-2680 Choose the best route(SPFA)

Choose the best routeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13284 Accepted Submission(s): 4295Problem DescriptionOne day

2016-09-15 17:57:41 461

原创 UVA-10579 Fibonacci Numbers(Java大数)

让球第n个斐波那契数，Java大数，用Java写大数就是简单，虽然效率可能比C++的慢点。类似题目HDU-1316题解import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String [] args){ Scanner in = n

2016-09-14 10:00:40 1019

原创 HDU-1316 How Many Fibs?(Java大数)

Here给定一个区间求斐波那契数的个数，利用循环递推即可import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String [] args){ Scanner in = new Scanner(System.in);

2016-09-14 09:57:36 583

原创 HDU-5601 N*M bulbs(推导||规律)

N*M bulbsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 464 Accepted Submission(s): 276Problem DescriptionN*M bulbs are in a re

2016-09-13 22:43:05 341

原创 HDU-1297 Children’s Queue（递推）（高精度）

Children’s QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13954 Accepted Submission(s): 4596Problem DescriptionThere are ma

2016-09-10 10:06:25 487

原创半数集与半数单集问题

半数集：多重集http://115.28.203.224/problem.php?id=1176#include#include#includeusing namespace std;int a[1005];int HalfSet(int n){ if(a[n] > 0) return a[n]; else {

2016-09-09 23:20:34 2818

原创 hihocoder #1227 : The Cats' Feeding Spots(枚举)

#1227 : The Cats' Feeding Spots时间限制:1000ms单点时限:1000ms内存限制:256MB描述In Yan Yuan, the Peking University campus, there are many homeless cats. They all live happy lives becaus

2016-09-08 15:29:03 609

原创 Java Number类

Java Number类抽象类Number的子类包括Byte、Short、Integer、Long、Float、Double六个包装类，编译器将内置数据类型包装为包装类。常用方法add(); //相加subtract(); //相减multiply(); //相乘divide(); //相除取整remainder();

2016-09-07 20:28:05 703

原创 Java大数的使用

参考飘过的小牛的博客，练习NYOJ的Java大数题目，主要是为了熟悉一下Java语言。（都快算抄袭了，，，）Java中的运算符和常用方法的使用——链接NYOJ 28 大数阶乘import java.math.BigInteger;import java.util.Scanner;public class Main{ public static void m

2016-09-07 13:09:12 534

原创 UVA-12555 - Baby Me（控制精度）

链接UVA-12555斤两转化成kg，注意一下小数点后消0的操作，Yes。/*BNUOJ27888：Baby Meuva-12555 - Baby Me*/#include#include#includeusing namespace std;char str[100];int main(){ int t; cin >> t; for(i

2016-09-06 23:00:17 782

原创 FZU Problem 2232 炉石传说（匈牙利算法）

Problem 2232 炉石传说Accept: 170 Submit: 619Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionGG学长虽然并不打炉石传说，但是由于题面需要他便学会了打炉石传说。但是传统的炉石传说对于刚入门的GG学长来说有点复杂，所以他决定自己开发一个简化版

2016-09-06 20:53:49 736

原创 Educational Codeforces Round 16 B. Optimal Point on a Line（中位数）

B. Optimal Point on a Linetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n points on a line

2016-09-06 15:15:57 334

原创 FZU 2231 平行四边形数（几何）（思维）

Problem 2231 平行四边形数Accept: 168 Submit: 531Time Limit: 2000 mSec Memory Limit : 32768 KB Problem Description在一个平面内给定n个点，任意三个点不在同一条直线上，用这些点可以构成多少个平行四边形？一个点可以同时属于多个平行四边形。 Input

2016-09-05 22:01:58 512

原创 UVA-11080 Place the Guards（二分图染色）

UVA-11080题意：用最少的士兵看守每条街道，但不可以相邻。//代码参考自，，，#include#include#include#includeusing namespace std;const int maxn = 230;int n , m , c[maxn];vector G[maxn];int color_now , color_all;bool d

2016-09-05 17:38:03 432

原创 Codeforces-687A NP-Hard Problem(二分图染色)

A. NP-Hard Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Pari and Arya did some researc

2016-09-04 17:09:46 486

原创 HDU-1285 确定比赛名次（拓扑排序）

确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10358 Accepted Submission(s): 4046Problem Description有N个比赛队（1

2016-09-03 21:40:21 410

原创 NYOJ-117 求逆序数（离散化+树状数组）/（归并）

求逆序数时间限制：2000 ms | 内存限制：65535 KB难度：5描述在一个排列中，如果一对数的前后位置与大小顺序相反，即前面的数大于后面的数，那么它们就称为一个逆序。一个排列中逆序的总数就称为这个排列的逆序数。现在，给你一个N个元素的序列，请你判断出它的逆序数是多少。比如 1 3 2 的逆序数就是1。输入第一行输入一个整数T表示测试数据的组数（1<=T<=5)每组测试数据的...

2016-09-03 21:32:30 390

原创 HDU-5695 Gym Class（拓扑排序）

Gym ClassTime Limit: 6000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 183 Accepted Submission(s): 76Problem Description众所周知，度度熊喜欢各类体育活动。今天，它

2016-09-03 21:32:14 556

原创 POJ-3041 Asteroids（匈牙利算法）

AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20568 Accepted: 11168DescriptionBessie wants to navigate her spaceship through a dangerous astero

2016-09-03 15:29:42 444

原创 POJ-3273 Monthly Expense(二分)

Monthly ExpenseTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22803 Accepted: 8930DescriptionFarmer John is an astounding accounting wizard and has rea

2016-09-03 15:11:56 704

原创 POJ-2299 Ultra-QuickSort（树状数组）（离散化）

Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 56014 Accepted: 20694DescriptionIn this problem, you have to analyze a particular sorting a

2016-09-03 11:19:23 619

原创 HDU-2838 Cow Sorting（树状数组）

Cow SortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3219 Accepted Submission(s): 1080Problem DescriptionSherlock's N (1 ≤

2016-09-02 15:01:37 663

huatian5的博客