- 博客(11)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 HDU 5375 Gray code
Gray codeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 904 Accepted Submission(s): 510Problem DescriptionThe reflected bi
2015-09-12 17:00:46
354
原创 ICPC 6789 Superstitious Socks
题目意思是，这个人有很多袜子。socks（袜子的复数）但是他每只袜子长度都不一样。他每天穿一对长度差最小的袜子，穿完之后第二天就换，也就是说，每一对匹配出来的袜子他只会穿一天。求第K天他穿的袜子长度。解法：直接暴力是不对的。先对两只袜子的长度差进行二分。然后再查找长度差的值。关键在，计算这个长度差范围之内的袜子匹配种数。应为对袜子排序过。所以可以看出，中间一大段都是重复的计
2015-09-08 21:11:57
576
原创 ICPC 6834 Shopping
题意：有一个人去市场上买东西，他要穿越整个市场。市场是一条直线，线上有N家店。一般这个人不会去买东西，但是会有一个限制条件，比如C1，D1;意思是，想要路过D1店，必须返回C1店买东西，然后再回来。。所以最短的路线就是，直接穿越整个市场的路程加上重复的区间 。#include#includeusing namespace std;typedef struct pp{ int first
2015-09-06 12:45:07
481
原创 ICPC 6828 Help cupid（Regionals 2014 >> Latin America）
Cupid’s job is getting harder, so he is adopting new technologies to help him with his difficult task of matching people into happy couples. He appointed the best programmers in his staff to a new projec
2015-09-03 16:39:23
457
原创 ICPC 6921 Refraction
一个水槽如图InputFirst line of the input file contains an integer T (0 < T < 100001) which denotes the number of test cases. Each of the next T lines contains the input for one test case. Each line conta
2015-09-03 13:11:53
481
原创 ICPC 6823 Counting substhreengs
题意：求出满足要求的子串个数，要求是：子串都是数字，并且能被3整除。做法：动态规划的思想。弄一个数组记录当前选定值之前的情况，num[0]记录余数为0的个数。假设选定当前值作为数字的最后一个位数，如果当前值mod3等于1，那么前面num[2]的数加上当前值都能变成余数0，所以num[0]=num[2].以此类推......不用long long 会wa。#include#includ
2015-09-03 12:51:53
610
原创 CF 372C Watching Fireworks is Fun
C. Watching Fireworks is Funtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA festival will be held in a t
2015-09-02 17:50:30
1096
原创 ICPC 6918 And Or
#include#includeusing namespace std;#define ll long longlong long A,B;ll solve(ll x){ ll cnt = 0; ll y = 1; while(x>=y) { // cout<<"/////"<<endl; y = y<<1; ++cnt; } return cnt;}int
2015-09-02 15:06:44
446
原创 ICPC 6924 Load Balancing
The infamous University of Kala Jadu (UKJ) have been operating underground for the last fourteen centuries training very select few students the dangerous art of black magic. However, with the recent
2015-09-02 14:58:42
439
原创 ICPC 6929 Sums
思路 ：如果一个数n是2的阶乘，那么是无解的。然后，如果N是奇数，那么肯定能由中间的两个数相加得到。如果N是偶数，就要分成两种情况，一种是 取 n-1 n n+1等等，n的左右两边可以取I个值，可以发现n-2和n+2相加和n-1加n+1相加相等。。另一种情况就是中间情况是 n-1 n n+1,n-1和n的值等于n-2和n+1的值。。贴上JYJJ阿姨的代码#include #inclu
2015-09-01 14:47:00
386
原创 ICPC 7014 Ideal Scoreboard
Professor Boffin is a regional contest director of ACM ICPC. He loves watching and analyzing the scoreboard during the contest. He believes that the scoreboard is ideal when all these criteria hold toge
2015-09-01 08:37:28
607
git bash 2.19.1 Windows64安装包
2018-10-11
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人