常用技巧
u010660276
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #196 (Div. 2)(c快速幂)
A - Puzzles#include#includeusing namespace std;const int maxn=60;const int INF=1000000000;int n,m,a[maxn],sum[maxn];int main(){ cin>>n>>m; for(int i=1;i<=m;i++) cin>>a[i];原创 2014-03-11 21:35:36 · 475 阅读 · 0 评论 -
Codeforces Round #238 (Div. 2)(位运算)
A - Gravity Flip排一下序就好了#include#includeusing namespace std;int n,a[110];int main(){ cin>>n; for(int i=0;i>a[i]; sort(a,a+n); for(int i=0;i<n;i++)cout<<a[i]<<" "; cout<<e原创 2014-03-24 12:43:30 · 513 阅读 · 0 评论 -
简单位运算uva11636
#include#include#includeusing namespace std;int n;int main(){ int cas=1; while(scanf("%d",&n)!=EOF&&n>0) { int ans=0; for(int i=16;i>=0;i--) if(n&(1<<i)){原创 2014-03-24 22:55:21 · 518 阅读 · 0 评论 -
Codeforces Round #240 (Div. 2)(D:dp递推)
A - Mashmokh and Lights原创 2014-04-07 14:14:31 · 512 阅读 · 0 评论 -
数位统计+hdu3972(dbl)
题意:给你3*N+2Case 1:两个数相同 我们只要把所有数字的各个数位的二进制个数保存下来,模3即可 模剩下的数组里面非零部分必定是2,把二进制还原即可Case 2:两个数不同 两个数必定有一个位上面的二进制表示不同 开一个[i][j]31*31的数组,意思是第i位是1的所有数字第j位为1的个数 对数组里面的所有元素模3 接着,有一个很显然的想法原创 2014-05-09 18:48:30 · 549 阅读 · 0 评论 -
Codeforces Round #242 (Div. 2)
A - Squats #include#includeusing namespace std;int main(){ int n; string a; cin>>n>>a; int len=a.size(); int d=0,u=0; for(int i=0;i<len;i++)if(a[i]=='x')d++;else u++;原创 2014-04-25 23:00:37 · 499 阅读 · 0 评论 -
Codeforces Round #250 (Div. 2)(B,C,D并查集)
比赛的时候没想明白。。。原创 2014-06-03 22:48:39 · 610 阅读 · 0 评论 -
Codeforces Round #256 (Div. 2)思维训练
B. Suffix StructuresBizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team.At a competition the "Bizons" got the following problem: "You are given two distinct wor原创 2014-07-19 13:20:30 · 757 阅读 · 0 评论 -
Codeforces Round #245 (Div. 2)
A. Points and Segments (easy)题意:给定的区间内0,1的个数之差不能超过一思路:原创 2014-05-27 16:45:18 · 500 阅读 · 0 评论 -
数学spoj8063
I - Dividing StonesTime Limit:7000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice SPOJ AMR10IDescriptionThere are N stones, which can be divided int原创 2014-08-01 20:51:48 · 460 阅读 · 0 评论 -
数位统计
Problem B: ChanglongTime Limit: 10 Sec Memory Limit: 1 MBSubmit: 98 Solved: 10[Submit][Status][Web Board]DescriptionChanglong is a handsome and clever boy and he is admired by many bea原创 2014-03-23 19:29:59 · 586 阅读 · 0 评论 -
Codeforces Round #237 (Div. 2)
A - Valera and X#include#include#includeusing namespace std;const int maxn=310;int n;char a[maxn][maxn];bool solve(){ char tmp=a[1][1],x; bool first=true; for(int i=1;i<=n;i+原创 2014-03-22 21:55:31 · 441 阅读 · 0 评论 -
Codeforces Round #234 (Div. 2)
A - Inna and Choose Options#include#include#includeusing namespace std;int n;string a;string s[]={"1x12","2x6","3x4","4x3","6x2","12x1"};bool solve(int num){ int len=a.size(); bool原创 2014-03-07 14:04:15 · 615 阅读 · 0 评论 -
Codeforces Round #197 (Div. 2)(d线段树)
A - Helpful Maths水题不多说#include#include#include#include#includeusing namespace std;int main(){ int a[105],n=0; string s; cin>>s; for(int i=0;i<s.size();i++) if(s[原创 2014-03-09 09:50:09 · 551 阅读 · 0 评论 -
Codeforces Round #210 (Div. 2)(构造)
这是不是构造专题,怎么前几个都是构造题A - Levko and Table #include#include#includeusing namespace std;int main(){ int n,k; cin>>n>>k; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++)原创 2014-03-09 16:33:50 · 548 阅读 · 0 评论 -
离散化+枚举
http://acm.upc.edu.cn/problem.php?id=2525把坐标离散化到n*n的网格中,然后统计离散化后(x,y)点到(0,0)点包含多少个点。二分答案,判断是否可行。#include#include#include#include#includeusing namespace std;const int maxn=1500;const int INF原创 2014-03-16 21:01:42 · 754 阅读 · 0 评论 -
Codeforces Round #195 (Div. 2)位运算
A - Vasily the Bear and Triangle#include#include#includeusing namespace std;int main(){ int x,y,ansx,ansy; cin>>x>>y; ansx=ansy=(x>=0?x:(-x))+(y>=0?y:(-y)); if(x0?ansy:-ansy)<原创 2014-03-15 22:05:29 · 481 阅读 · 0 评论 -
Codeforces Round #194 (Div. 2)
这场总体感觉不是很难,但是题目理解上有些费劲A - Candy Bags#include#include#includeusing namespace std;int main(){ int n; cin>>n; int mid=n/2; int before=n*n/2,behind=before+1; for(int i=1;i<=原创 2014-03-17 11:26:59 · 473 阅读 · 0 评论 -
Codeforces Round #241 (Div. 2)
A - Guess a number!原创 2014-04-13 22:37:07 · 452 阅读 · 0 评论 -
Codeforces Round #243 (Div. 2)
又要掉分了。。。原创 2014-04-29 15:19:27 · 577 阅读 · 0 评论 -
数形结合、单调队列+uva1451
解题思路: 1.这题是一道数形结合的问题, 我从《浅谈数形结合思想在信息学竞赛中的应用》学习而得算法. 设Sum[i] = a1+a2+...+ai,那么平均值ave(i,j) =(sum[j]-sum[i-1])/(j-(i-1)); 容易发现问题可以转换为:求函数function(i,Sum[i])的任意两点的最大斜率.具体可以从学习原创 2014-03-29 22:08:47 · 711 阅读 · 0 评论 -
Codeforces Round #257 (Div. 2)
A. Jzzhu and Childrentime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n children in Jzzhu's school. Jzzhu is原创 2014-07-26 22:51:45 · 429 阅读 · 0 评论 -
Codeforces Round #248 (Div. 2)C
C. Ryouko's Memory Notetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRyouko is an extremely forgetful girl, she cou原创 2014-06-18 17:48:10 · 498 阅读 · 0 评论 -
Codeforces Round #249 (Div. 2)
A. Queue on Bus StopIt's that time of the year when the Russians flood their countryside summer cottages (dachas) and the bus stop has a lot of people. People rarely go to the dacha on their o原创 2014-06-18 16:36:44 · 678 阅读 · 0 评论 -
AC自动机(矩阵匹配)uva11019
Problem HMatrix MatcherInput: Standard InputOutput: StandardOutput Given an N * M matrix, your task is to find the number of occurences of an X * Y pattern. InputThe first line contai原创 2014-09-02 18:57:19 · 464 阅读 · 0 评论 -
Codeforces Round #269 (Div. 2)(hash)
B. MUH and Important ThingsIt's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there aren tasks原创 2014-10-06 18:44:59 · 580 阅读 · 0 评论 -
Bayan 2015 Contest Warm Up(C,D)
B. Strongly Connected CityImagine a city with n horizontal streets crossingm vertical streets, forming an (n - 1) × (m - 1) grid. In order to increase the traffic flow, mayor of the city h原创 2014-10-11 13:35:05 · 517 阅读 · 0 评论 -
Codeforces Round #271 (Div. 2)(dp,线段树good)(很好的一场cf)
D. FlowersWe saw the little game Marmot made for Mole's lunch. Now it's Marmot's dinner time and, as we all know, Marmot eats flowers. At every dinner he eats some red and white flowers. There原创 2014-10-10 21:00:33 · 719 阅读 · 0 评论 -
中途相与法(Codeforces Round #297 (Div. 2)E - Anya and Cubes )
E. Anya and Cubestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnya loves to fold and stick. Today she decided to原创 2015-03-27 16:03:46 · 561 阅读 · 0 评论 -
二分(hdu5200)
TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 537 Accepted Submission(s): 177Problem DescriptionToday CodeFamer is going t原创 2015-04-06 22:39:01 · 487 阅读 · 0 评论 -
codeforces 526 E(神题)
E. Transmitting Levelstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOptimizing the amount of data transmitted via原创 2015-04-13 22:07:06 · 1687 阅读 · 0 评论 -
hdu5204-Rikka with sequence
Rikka with sequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 515 Accepted Submission(s): 95Problem DescriptionAs we know, R原创 2015-04-15 21:29:45 · 901 阅读 · 0 评论 -
输入外挂模板(适用于正负数)
转自kuangbin:template inline bool scan_d(T &ret){ char c; int sgn; if(c=getchar(),c==EOF) return 0; //EOF while(c!='-'&&(c'9')) c=getchar(); sgn=(c=='-')?-1:1; ret=(c=='-')?0转载 2015-04-05 10:07:03 · 459 阅读 · 0 评论 -
数学发现规律+hdu5014
Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu原创 2014-09-14 20:37:06 · 573 阅读 · 0 评论 -
线段树+贪心+UVALive5881
题意:给定一个数列,然后m次询问,如果区间内每个数都不相同,输出OK,原创 2014-08-15 19:34:05 · 418 阅读 · 0 评论 -
扩展KMP模板
#includeusing namespace std;const int N = 101010;int next[N],extand[N];void getnext(char *T) // next[i]: 以第i位置开始的子串 与 T的公共前缀{ int n=strlen(T); next[0]=n; int j=0; while(j+1<n&&T[j原创 2014-06-16 14:10:56 · 514 阅读 · 0 评论 -
多校训练
I - The old PadawanTime Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYoda: Use the Force. Yes. Now, the stone. Feel it. Concentra原创 2014-07-28 19:46:21 · 539 阅读 · 0 评论 -
线段树Codeforces Round #136 (Div. 2)
D. Little Elephant and ArrayThe Little Elephant loves playing with arrays. He has array a, consisting of n positive integers, indexed from 1 ton. Let's denote the number with index i as原创 2014-07-30 21:28:25 · 559 阅读 · 0 评论 -
Codeforces Round #FF (Div.2 )(C,D)
C. DZY Loves SequencesDZY has a sequence a, consisting of n integers.We'll call a sequence ai, ai + 1, ..., aj(1 ≤ i ≤ j ≤ n) a subsegment of the sequencea. The value (j - i + 1) denot原创 2014-07-14 11:13:09 · 557 阅读 · 0 评论 -
2014多校第五场
刚开始出的两个题还挺快的,结果后来就掉的原创 2014-08-07 19:19:02 · 606 阅读 · 0 评论