摘要：
集合和容器都是Java中的容器。 区别 数组特点：大小固定，只能存储相同数据类型的数据 集合特点：大小可动态扩展，可以存储各种类型的数据 转换 数组转换为集合： Arrays.asList(数组) 示例： 集合转换为数组： 集合.toArray(); 示例： 阅读全文
摘要：
题意：给一个二分图，存在重边，求使各点度数至少为k（0<=k<=min(d[i])）的最小边集合。 分析：首先建立一个源点s向二分图左边连边，建立一个汇点e，所有二分图右边的点向e点连边。要使每个点的度数大于等于k，可使流过每个点的流量小于等于d[i]-k。(d[i]为每个点的度数)，就可以在建立源 阅读全文
摘要：
题目链接： http://codeforces.com/contest/976/problem/E 题目： Recently Max has got himself into popular CCG “BrainStone”. As “BrainStone” is a pretty intellec 阅读全文
摘要：
Degree Set time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Degree Set time limit per tes 阅读全文
摘要：
Problem Statement Iroha is very particular about numbers. There are K digits that she dislikes: D1,D2,…,DK. She is shopping, and now paying at the cas 阅读全文
摘要：
文字列大好きいろはちゃんイージー / Iroha Loves Strings (ABC Edition) AtCoder - 1978 Problem Statement Iroha has a sequence of N strings S1,S2,…,SN. The length of each 阅读全文
摘要：
和風いろはちゃんイージー / Iroha and Haiku (ABC Edition) AtCoder - 1977 Problem Statement Iroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku con 阅读全文
摘要：
Problem Statement We have a large square grid with H rows and W columns. Iroha is now standing in the top-left cell. She will repeat going right or do 阅读全文
摘要：
Problem Description Julyed is preparing for her CET-6. She has N words to remember, but there is only M days left. If she can’t remember all these wor 阅读全文
摘要：
Little Q loves playing with different kinds of graphs very much. One day he thought about an interesting category of graphs called ``Cool Graph'', whi 阅读全文