- 博客(18)
- 收藏
- 关注
RSS订阅转载 poj 2549 Sumsets (枚举+二分)
SumsetsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10026 Accepted: 2743DescriptionGiven S, a set of integers, find the largest d such that a + b + c
2016-03-31 21:06:44
423
转载 codeforces 630I Parking Lot
#include#include#include#include#include/*正如题目：对排列组合应用，有n个相同的车停在一起时，此时又2*n-2个停车位！ 左 中 右时 4*3*4 3*4*3 4*3*4
2016-03-23 18:23:36
448
原创 hdu 5636 Shortest Path
#include#include#include#include#include/* Shortest PathTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submissio
2016-03-22 20:31:33
300
原创 BZOJ 2456 mode (求众数)
2456: modeTime Limit: 1 Sec Memory Limit: 1 MBSubmit: 2754 Solved: 1165[Submit][Status][Discuss]Description给你一个n个数的数列，其中某个数出现了超过n div 2次即众数，请你找出那个数。Input第1行一个正整数n。第2行n个正整数用空格隔开
2016-03-17 20:23:20
911
原创 hdu 5615 Jam's math problem
Jam's math problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 881 Accepted Submission(s): 423Problem DescriptionJam has a
2016-03-16 19:50:19
337
原创 BZOJ 2190 仪仗队
2190: [SDOI2008]仪仗队Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 2225 Solved: 1403[Submit][Status][Discuss]Description 作为体育委员，C君负责这次运动会仪仗队的训练。仪仗队是由学生组成的N * N的方阵，为了保证队伍在行进中整齐划一，C君会跟在仪仗队
2016-03-15 21:43:56
408
原创 codeforces 630F Selection of Personnel
F. Selection of Personneltime limit per test0.5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputOne company of IT City decided t
2016-03-11 20:26:29
466
原创 codeforces 630G Challenge Pennants
G. Challenge Pennantstime limit per test0.5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputBecause of budget cuts one IT compan
2016-03-11 20:19:07
535
原创 codeforces 630K Indivisibility
K. Indivisibilitytime limit per test0.5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputIT City company developing computer game
2016-03-11 15:26:57
328
原创 codeforces 630E A rectangle
E. A rectangletime limit per test0.5 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputDeveloping tools for creation of locations
2016-03-10 19:04:43
346
原创 位操作的快速幂
#include#include#include#include// 计算x^22 22 = 10110 = 16+4+2// 十进制 二进制 十进制 // 按照原本的思路是a=a*a,之后是b=b/2; 也就是（16+4+2）/2// 结果是（8+2+1）相当于把10110向右移1为，变成1011 ，
2016-03-08 20:30:04
259
原创 codeforces 598D - Igor In the Museum
D. Igor In the Museumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIgor is in the museum and he wants to
2016-03-08 13:58:29
477
原创 NBUT 1665 木块拼接
[1655] 木块拼接时间限制: 1000 ms 内存限制: 65535 K问题描述好奇的skyv95想要做一个正方形的木块，现在有三种颜色的矩形木块，颜色分别为"A","B","C"。他现在很想把三个木块拼接成一个大正方形，现在求助于你们，问分别给你们三种颜色矩形的两个边长，判断是否能组成一个正方形。输入依次输入颜色为A的矩形的两边长度，颜色为B的矩形的两边长
2016-03-07 16:50:38
423
原创 hdu 5630 Rikka with Chess
Rikka with ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 511 Accepted Submission(s): 426Problem DescriptionYuta gives
2016-03-07 12:19:17
272
转载 hdu 5233 Gunner II （容器）
Gunner IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1739 Accepted Submission(s): 635Problem DescriptionLong long ago, th
2016-03-05 22:15:23
341
原创 poj 1930 Dead Fraction 混循环小数化分数 数论
Dead FractionTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2417 Accepted: 782DescriptionMike is frantically scrambling to finish his thesis at the las
2016-03-04 19:39:57
458
原创 hdu 2035 人见人爱A^B
#include#include#includeusing namespace std;//题目的重点是%1000 //还有个思路是进行周期判断 int main(){ int a,b; int r; while( scanf("%d%d",&a,&b)!=EOF ) { if(a==0&&b==0) break;
2016-03-01 16:26:25
207
原创 hdu 1061 Rightmost Digit 快速幂取模
#include#include#includeusing namespace std;//题目的重点是在个位层面上操作 //还有个思路是进行周期判断 int main(){ int a,b; int r; int t; scanf("%d",&t); while( t-- ) { scanf("%d",&a); b=a; a=a%10;
2016-03-01 16:21:02
305
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人