记录一下坑。。 1上一次写sql语句发现用linq写不出来。。。然后写原生的查询。。。最后发现要在c#里面加N。。更要命的是,,智障的我老是在字符串里面加入要查询的字符串。。。最后搞了半天发现了,,分开拼接就完事了。。。2 有一个数据库的字段是varbinary。。然后有一个需求就是这个字段要存一组坐标(x,y)。。然后我和前端沟通了一下。。叫他给我字符串数组。。然后我研究了一下byte这个东西。。每个dou
DELAUNAY三角网算法(生长算法、逐点插入算法、分治算法) DELAUNAY三角网算法是什么东西呢。。。大概就是对于许多密集的点,,,可以形成一个三角网。。然后最近的三个点搞成一个三角形。任何一个三角形的外接圆都不包含其他的点。并且没有相交边,并且所有三角面的合集就是一个凸包。,Delaunay三角剖分所形成的三角形的最小角最大。1.最接近:以最近的三点形成三角形,且各线段(三角形的边)皆不相交。2.唯一性:不论从区域何处开始构建,最终
Java 各种map tree 。。 比如什么HashMap,HashTable,TreeMap,LinkHashMap,ConcurrentHashMap,hashCode,HashSet,TreeSet。。LinkHashSet这tm的秀的我头晕。。。一个一个讲,,首先是Hashmap,,我跑了下代码,确定了它是无序访问的。。。然后找了以前的博客,发现实现是基于数组+链表的。。然而jdk1.8已经加入了红黑树。它大概是什么思想
sql一些笔记 A表,a_id,a_name,a_tel三个字段。 B表,b_id,b_address,b_sol三个字段。 关联表,ref_id,a_id,b_id,存储着AB两表的id, 比如:A有 a0001,zhang3,139555533 a0002,li4,1397788888 a0003,wang5,13655566 B有 b0001,shanghai,234 b
Java LinkedList 直接放源码package java.util;public class LinkedList extends AbstractSequentialList implements List, Deque, Cloneable, java.io.Serializable{ // 链表的表头,表头不包含任何数据。Entry是个链表类数据结构。 private t
Java笔记 1public/private/protected的具体区别public 表示可以被其他包访问到。private表示只有这个类能访问。。protected表示可以被儿子的类访问。2抽象类。拿来写借口or扩展用的?可以new一个非抽象类儿子对象。然后方法在儿子对象里面写,不过自己本身也要定义那个方法。有抽象方法的都定义成抽象类。3final 这玩意好像是不可变的,比如
792C - Divide by Three C. Divide by Threetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA positive integer number n is written on
Mike and gcd problem CodeForces - 798C Mike has a sequence A = [a1, a2, ..., an] of length n. He considers the sequence B = [b1, b2, ..., bn] beautiful if the gcd of all its elements is bigger than 1, i.e. .Mike wants to change his s
L2-022. 重排链表 L2-022. 重排链表时间限制 500 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 陈越给定一个单链表 L1→L2→...→Ln-1→Ln,请编写程序将链表重新排列为 Ln→L1→Ln-1→L2→...。例如:给定L为1→2→3→4→5→6,则输出
Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) B. The Meeting Place Cannot Be Change B. The Meeting Place Cannot Be Changedtime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe main road in Bytecity is a
PAT L3-014. 周游世界 L3-014. 周游世界时间限制 200 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 陈越周游世界是件浪漫事,但规划旅行路线就不一定了…… 全世界有成千上万条航线、铁路线、大巴线,令人眼花缭乱。所以旅行社会选择部分运输公司组成联盟,每家公司提供一条线
POJ 1753 (暴力搜索) Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 44180 Accepted: 18986DescriptionFlip game is played on a rectangular 4x4 field with two-sided pie
HDU 1724 EllipseTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1971 Accepted Submission(s): 828Problem DescriptionMath is important!! Man
CSU 1808 (最短路 把边当成点来跑 dijkstra) Bobo 居住在大城市 ICPCCamp。ICPCCamp 有 n 个地铁站,用 1,2,…,n 编号。 m 段双向的地铁线路连接 n 个地铁站,其中第 i 段地铁属于 ci 号线,位于站 ai,bi 之间,往返均需要花费 ti 分钟(即从 ai 到 bi 需要 ti 分钟,从 bi 到 ai 也需要 ti 分钟)。众所周知,换乘线路很麻烦。如果乘坐第 i 段地铁来到地铁站 s,又乘坐第
上周六装了ubuntu后... 花了不少时间折腾呀,,目前换了阿里云的源搞定了网易云搞定了梯子搞定了搜狗可以用vim写写c++,装了一些插件,自己定制了一些快捷键.以及熟悉了vim的一些基本操作,(还是个菜鸟),瞎jb折腾vimrc..还能一键显示时间作者信息啥的.一键编译c/c++/Java/python等.有目录树,自动补全..快速跳转...然而没什么卵用,装了个codeblocks或者其他I
换电脑/系统后,,如何同步github上原有的项目呢?...linux下... 由于分支不同,所以无法直接ssh连接后同步..以下步骤.. 首先先搞个SSH,然后在github上建立新的ssh对于新建的库.在本地文件夹,打开终端一些命令省略了)1 git init()2 git remote add origin https://github.com/username/xxxx.git3 add4 commit5 push origin m
用vim编辑器打acm (c++) 首先,我的系统是ubuntu16.04 LTS 下的.我主要是参考了这个点击打开链接.然后我们必须要编译和运行吧.添加如下的配置到vimrcfunc! CompileGcc() exec "w" let compilecmd="!gcc " let compileflag="-o %< " if search("mpi\.h") != 0
ZOJ-2849 ZOJ-2849-Attack of Panda Virus Time Limit: 3 Seconds Memory Limit: 32768 KBIn recent months, a computer virus spread across networks in China. The virus came with an ico
ubuntu 16.04LTS 下解决无线wifi网络速度慢的问题。 1、在终端运行:sudo gedit /etc/modprobe.d/iwlwifi.conf2、在打开的这个配置文件中空白处添加:options iwlwifi 11n_disable=13、保存文件并重启。4、然后速度就变快了好多。
天梯赛好咸鱼。。 太久没做acm题目果然不行,一道题卡了两小时。。害我固执的没去做其他的题目。pat 功夫传人。#includeusing namespace std;const int N=100005;vectorg[N];mapmp;typedef long long ll;double gongli[N];double r;/*一开始题目看错
1075. PAT Judge (25) pat的排名算法 The ranklist of PAT is generated from the status list, which shows the scores of the submittions. This time you are supposed to generate the ranklist for PAT.Input Specification: Each input file
记录一下= = 感觉简历做的太水了。。。然后就是自己还是蛮水的。。。面试官是做后端的,不过前端水平应该也比我高。Q:行内元素和块状元素的区别?A :我说的是块状元素单独占满一行,行内元素一行可以有许多个。。Q:说几个块状元素和行内元素。A:我答是是:行内: span,input,b,i 块状:div,table,h,p,ul。 事实上我还是知道更多的,,不过
从零开始学习git的一些命令 (初学者入门) 我觉得git的发明人真的是一个天才,不但可以在任意地方搞,而且可以回退任意的版本,也可以回到未来的版本。可以查看每一次修改的版本号码。可以查看修改的内容。首先你要搞一个文件夹吧。我们直接从从开始里面找到git bash 打开。0:$ madir xixixi这时候就有了xixixi的文件夹1:$ cd xixixi这时候进入了xixixi的文件夹2:$
如何修改git全局初始化的用户名和邮箱? (git修改user.name 和user.email) 今天刚刚入门了下git,,然后初始化的时候将用户名弄错了。。。就很气啊。然后网上找了半天都找不出一个可靠的修改全局用户名和邮箱的方法。。最后还是自己摸索出来了。。其实也很简单。首先进入git bash 0:输入$ git config --list 可以查看配置的一些东西。可以看到user.name 和user.em
JavaScript中对象是按值传递的。。。 在某群看到有人说,对象是按引用传递的。。。因为传进去修改一个东西后外面的东西也被修改了。。。这其实是错误的,,因为外面指向的对象在内存中只有一个,是全局对象。所以修改里面那个,外面那个也会被修改。要想证明是按值传递的,其实很简单。看代码。function setName(obj){ obj.name="123"; obj=new Object(); ob
组合使用构造函数模式和原型模式。。 原型这个东西,就是让实例共享它的方法和属性,但是有个缺点,就是push一个新东西的时候,另外一个实例也会跟着改变,所以用构造函数和原型模式组合使用来避免这个问题。看代码function Person(name, age, job) { this.name = name; this.age = age; this.job = job; this.fri
一些笔记。。 昨天做的一个demo :点击打开链接vertical-align: middle; 设置元素的垂直对齐方式 就是以中间对齐的。 table-cell:对象代表一个 HTML 表格单元格cursor: pointer; 鼠标移过去指针不同font-weight: 500; 文字的粗细设置一个导航的列表大概是这样的nav ul {
js的一些入门题目(freecodecamp) 做了freecodecamp上面的一些题目,要求50小时的时间,然而我三小时左右搞完了(逃。 贴一下题目和代码把。 1 翻转字符串先把字符串转化成数组,再借助数组的reverse方法翻转数组顺序,最后把数组转化成字符串。你的结果必须得是一个字符串function reverseString(str) { var str1 = []; for (
jquery学习笔记 jquery是一个很强大的库。。 看看它能干什么吧。。 $(document).ready(function() { $("#target1").css("color", "red"); $("#target1").prop("disabled", true); $("#target4").remove(); $("#target2").
java里的HashMap和map 一直不懂这两个有什么区别啊,,查了查发现map是一个接口,然后HashMap是一个类,,于是HashMap实现了功能,通过map这个接口来用。所以可以直接Map map = new HashMap();来调用,,注意到Map里面的两个东西,是什么呢?都是对象也就是object。。刚开始用一直把Integer写成int,,然后一直报错 = =。。当然也可以这样
如何在Visual Studio 2013调用同一个工程下的两个.cpp文件? 其实很简单啊,,,,有个叫extern的就可以用来干这种事。由于VS中只能有一个main函数。。所以举个例子。file c.hextern void saygoodbye() { xxx;}cpp file A#include c.hint main() { saygoodbye()}cpp file B#include c.hvoi
Java中不同的包之间的调用。。 其实和调用同一个包的类的差不多,,都要实例化一下,,然后就可以调用一个项目中其他包中的类了。(不同项目是调用不了)设你要调用的包名为test吧。原来那个包名为last,类为love你在last包love类中的头文件加上import test.*;再设你test包中的一个类名为homework只需要在你love类中实例化一下homework类就行了。比如:homework a=n
Java对mysql数据库的增删改查创表5个操作 发现非常水啊,全是一个套路,就是根据sql语句通过字符串实现这个操作。然后注意插入时主码要不一样,否则会报错。给出我的代码。我的mysql表示在test下的,然后下面名字为tablename,tablename1之类的。package mywork.com;import java.sql.*;import java.text.DecimalFormat; // DecimalFo
Codeforces Round #379 (Div. 2) A B C D A. Anton and Daniktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton likes to play chess, and so does his friend D
HDU 5976 Detachment DetachmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 207 Accepted Submission(s): 74Problem DescriptionIn a highly developed
HDU 5971 Wrestling Match Wrestling MatchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 145 Accepted Submission(s): 80Problem DescriptionNowadays, at leas
hiho 1412 : Rikka with Subsequence #1412 : Rikka with Subsequence时间限制:10000ms单点时限:1000ms内存限制:256MB描述众所周知,萌萌哒六花不擅长数学,所以勇太给了她一些数学问题做练习,其中有一道是这样的:勇太有一个长度为n的字符串s,现在他对这个字符串进行了一些操作,在操作之后第i个字符有Ai%的概率被删除。现在他想要知道在操
51nod 1202 1202 子序列个数题目来源: 福州大学 OJ基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 取消关注子序列的定义:对于一个序列a=a[1],a[2],......a[n]。则非空序列a'=a[p1],a[p2]......a[pm]为a的一个子序列,其中1例如4,14,2,3和14,1,2,
HDU 4268 Alice and BobTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4420 Accepted Submission(s): 1398Problem DescriptionAlice and Bob's
Codeforces Round #319 (Div. 2) B. Modulo Sum B. Modulo Sumtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a sequence of numbers a1, a2, ..., an,
codefoces 722C - Destroying Array C. Destroying Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array consisting of n non-negativ
HDU 4460 求任意两点最短距离的最大距离 Friend ChainsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5324 Accepted Submission(s): 1718Problem DescriptionFor a group of p
HDU 4462 状压枚举。 Scaring the BirdsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3563 Accepted Submission(s): 1110Problem DescriptionIt’s harvest
2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest J Bottles J. Bottlestime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputNick has n bottles of soda left after his birthday. Each b
HDU 2444 二分图的判断和无向图的二分匹配 The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5504 Accepted Submission(s): 2512Problem DescriptionT
HDU 1827 强连通缩点 Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3115 Accepted Submission(s): 1440Problem DescriptionTo see a World
HDU 5800 Family View Family ViewTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1500 Accepted Submission(s): 279Problem DescriptionSteam is a digital
HDU 3065 病毒侵袭持续中 ac自动机 统计文本串的单词和其出现的次数。 病毒侵袭持续中Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11762 Accepted Submission(s): 4118Problem Description小t非常感谢大家帮忙解决了他的上一个问题。
HDU 2896 病毒侵袭 病毒侵袭Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7400 Accepted Submission(s): 1945Problem Description当太阳的光辉逐渐被月亮遮蔽,世界失去了光明,大
HDU 5384 Danganronpa 多个串的ac自动机 DanganronpaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1265 Accepted Submission(s): 653Problem DescriptionDanganronpa is a
HDU 2222 ac自动机入门模板题 Keywords SearchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 56619 Accepted Submission(s): 18519Problem DescriptionIn the mod
HDU 5768 Lucky7 中国剩余定理+状压+容斥+快速乘法 Lucky7Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1550 Accepted Submission(s): 577Problem DescriptionWhen ?? was born, seven
HDU 4333 Revolving Digits 扩展kmp Revolving DigitsTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25296 Accepted Submission(s): 5530Problem DescriptionOne day Sile
HDU 5884 k叉的哈夫曼 O(n)构造 SortTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1832 Accepted Submission(s): 458Problem DescriptionRecently, Bob has just lea
CSU 1632 最长公共前缀(出现超过两次的不同子串有多少个) 1632: Repeated SubstringsTime Limit: 5 Sec Memory Limit: 128 MBSubmit: 83 Solved: 33[Submit][Status][Web Board]DescriptionString analysis often arises in applications from biology an
HDU 5726 GCD(rmq+二分) GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2930 Accepted Submission(s): 1058Problem DescriptionGive you a sequence of N(
HDU 5727 NecklaceTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2555 Accepted Submission(s): 806Problem DescriptionSJX has 2*N magic gems
java 练手= = 做杭电的一些简单题学习java。 HDU 2012//package com.code;import java.text.DecimalFormat; // DecimalFormat df = new DecimalFormat("#0.000");import java.util.Scanner;import java.math.*;import java.io.*;import java.text.*
Codeforces Round #374 (Div. 2) C. Journey C. Journeytime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Irina arrived to one of the most famous cities of
HDU 4166 Robot Navigation Robot NavigationTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1161 Accepted Submission(s): 274Problem DescriptionA robot has be
HDU 3720 Arranging Your Team Arranging Your TeamTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1529 Accepted Submission(s): 492Problem DescriptionYour countr
HDU 3729 I'm Telling the Truth I'm Telling the TruthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2129 Accepted Submission(s): 1067Problem DescriptionAfter th
HDU 3722 Card Game Card GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1735 Accepted Submission(s): 736Problem DescriptionJimmy invents an inte
HDU 4514 判断非连通图是否有环和找最长链, 湫湫系列故事——设计风景线Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4541 Accepted Submission(s): 816Problem Description 随着杭州西湖的知名度的进一
POJ 2762 判断无向图的弱连通 Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16859 Accepted: 4502DescriptionIn order to make their sons brave, Jiajia
POJ 2914 无向图的最小割,模板题。 Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9126 Accepted: 3823Case Time Limit: 5000MSDescriptionGiven an undirected graph, in whi
POJ 1734 最小环的路径 Sightseeing tripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6360 Accepted: 2447 Special JudgeDescriptionThere is a travel agency in Adelton town o
HDU 2586 最近公共祖先 LCA在线算法 How far away ?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13294 Accepted Submission(s): 4974Problem DescriptionThere are n ho
poj 3107 求树的所有重心 GodfatherTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6123 Accepted: 2165DescriptionLast years Chicago was full of gangster fights and strange murder
POJ 1655 求树的重心 Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12317 Accepted: 5217DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1..
HDU 5901 Count primes Count primesTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1046 Accepted Submission(s): 578Problem DescriptionEasy question! Ca
UVALive 7327 Digit Division DescriptionWe are given a sequence of n decimal digits. The sequence needs to be partitioned into one or morecontiguous subsequences such that each subsequence, when interpreted as a decimal num
HDU 5876 补图求最短路 Sparse GraphTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 110 Accepted Submission(s): 40Problem DescriptionIn graph theory, t
HDU 5000 Clone CloneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1438 Accepted Submission(s): 668Problem DescriptionAfter eating food from Ch
HDU 4998 Rotate RotateTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1116 Accepted Submission(s): 503Special JudgeProblem DescriptionNoting is m
HDU 5001 Walk WalkTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1049 Accepted Submission(s): 674Special JudgeProblem DescriptionI used to t
HDU 5289 AssignmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3478 Accepted Submission(s): 1605Problem DescriptionTom owns a company
L3-011. 直捣黄龙 L3-011. 直捣黄龙时间限制 150 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 陈越本题是一部战争大片 —— 你需要从己方大本营出发,一路攻城略地杀到敌方大本营。首先时间就是生命,所以你必须选择合适的路径,以最快的速度占领敌方大本营。当这样的路
HDU 5256 序列变换 序列变换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1257 Accepted Submission(s): 472Problem Description我们有一个数列A1,A2...An,你现在要求修改数
pat 5-7 Complete Binary Search Tree (30分) 5-7 Complete Binary Search Tree (30分)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
PAT 堆中的路径 (25分) 2-3 堆中的路径 (25分)将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i,打印从H[i]到根结点的路径。输入格式:每组测试第1行包含2个正整数NN和MM(\le 1000≤1000),分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的NN个要被插入一个初始为空的小顶堆的整数。最后一行给出MM
HDU 5682 zxa and leaf zxa and leafTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 341 Accepted Submission(s): 116Problem Descriptionzxa have an unroote
"巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场(重现) HDU 5707 Combine StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 17 Accepted Submission(s): 11Problem DescriptionGiven three strings
"巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场(重现) HDU 5706 GirlCatTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7 Accepted Submission(s): 6Problem DescriptionAs a cute girl, Kotori likes
"巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场(重现) HDU 5705 ClockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 8 Accepted Submission(s): 6Problem DescriptionGiven a time HH:MM:SS and one
"巴卡斯杯" 中国大学生程序设计竞赛 - 女生专场(重现) HDU 5704 Luck CompetitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 11 Accepted Submission(s): 6Problem DescriptionParticipants of th