————水题
mengbi_er
一个蒟蒻JLoier
展开
-
bzoj3208: 花神的秒题计划Ⅰ
类似dp的记忆化搜索,看代码就似乎很好懂。。。 (其实是我太懒了233)#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,f[1005][1005],a[1005][1005],ans;bool k[1005][1005];int mx(int原创 2017-06-15 22:18:55 · 289 阅读 · 0 评论 -
Codeforces Round #426 (Div. 2) A. The Useless Toy
日常水题。模拟什么的随便搞。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); whil原创 2017-07-31 01:04:11 · 201 阅读 · 0 评论 -
Codeforces Round #426 (Div. 2) B. The Festive Evening
维护每个字母最先最后位置。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); while原创 2017-07-31 01:08:27 · 211 阅读 · 0 评论 -
Codeforces Round #425 (Div. 2)A. Sasha and Sticks
判断n/k奇偶性。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); while(ch>原创 2017-07-25 00:54:00 · 356 阅读 · 0 评论 -
AIM Tech Round 4 (Div. 2) A. Diversity
题目大意改变最小元素个数是总种类数大于K。题解贪心选就行了。注意特判。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') c原创 2017-08-25 07:52:32 · 263 阅读 · 0 评论 -
Codeforces Round #433 (Div. 2)A. Fraction
题目大意求分子分母和为n的最大真分数。(分子分母互质)题解暴力QAQ。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') c原创 2017-09-07 14:11:56 · 193 阅读 · 0 评论 -
Codeforces Round #433 (Div. 2)B. Maxim Buys an Apartment
题目大意一个有基佬气息的人想让他左或有有邻居,知道邻居数,但不知道位置,求最少和最大能选几个位置。题解显然k=0 ans:0,0 k=n min=0; else min=1; max=max(n-k,2*k)(一个邻居有两个位置)。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using na原创 2017-09-07 14:16:17 · 211 阅读 · 0 评论 -
Codeforces Round #430 (Div. 2) A. Kirill And The Game
是否存在,l<=a<=r,a*k==b,x<=b<=y. 暴力模拟,不要企图o(1)算。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'|原创 2017-08-30 14:54:19 · 192 阅读 · 0 评论 -
Codeforces Round #430 (Div. 2) B. Gleb And Pizza
题目大意有多少圆在外面圆内里面圆外。题解求一下圆心到原点距离,然后加r减r判断即可。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int read(){ char ch=getchar();int f=0;原创 2017-08-30 14:57:34 · 234 阅读 · 2 评论 -
bzoj1208: [HNOI2004]宠物收养所
应某人要求把这题放出来QAQ。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,m,tree[80005][2],root,t1,t2,size,ans,fa[80005],s[80005],x1,x2;int mod=1000000;int r原创 2017-09-11 20:36:44 · 72 阅读 · 0 评论 -
bzoj1635: [Usaco2007 Jan]Tallest Cow 最高的牛
智商下降,水奶牛题…原创 2017-10-09 09:29:48 · 379 阅读 · 0 评论 -
bzoj1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚
将时间视为一个点,相邻两点连长度0的边,将每个牛连u到v+1的边,spfa即可。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<queue>using namespace std;queue<int> q;int read(){ char ch=getchar();i原创 2017-10-09 10:27:51 · 496 阅读 · 1 评论 -
bzoj1643: [Usaco2007 Oct]Bessie's Secret Pasture 贝茜的秘密草坪
随便dp。(我是不会告诉你只是为了500题纪念的)。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9')ch=getchar(原创 2017-09-21 15:00:24 · 522 阅读 · 2 评论 -
bzoj2252: [2010Beijing wc]矩阵距离
将1加入队列,然后随便搜…#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<queue>using namespace std;queue<int> qx;queue<int> qy;int read(){ char ch=getchar();int f=0;原创 2017-10-23 11:02:54 · 433 阅读 · 0 评论 -
bzoj1008: [HNOI2008]越狱
首先考虑由n-1转移到n,然后就会发现这是一道大水题,答案是m^n-(m-1)^(n-1)*m。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'原创 2017-10-14 09:20:48 · 229 阅读 · 0 评论 -
Codeforces Round #451 (Div. 2) A. Rounding
题目大意将数四舍五入…题解逗比题…#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); w原创 2017-12-16 22:32:38 · 181 阅读 · 0 评论 -
Codeforces Round #451 (Div. 2) B. Proper Nutrition
题目大意求ax+by=c的一组非负整数解题解最开始没看数据范围就无脑exgcd发现有负数,然后才看到数据范围发现可以o(n)做…#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0原创 2017-12-16 22:34:42 · 198 阅读 · 0 评论 -
bzoj2748: [HAOI2012]音量调节
dp,因为数据范围小,可以不优化。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; while(ch<'0'||ch>'9') ch=getchar(); w原创 2017-07-08 21:07:33 · 182 阅读 · 0 评论 -
bzoj1218: [HNOI2003]激光炸弹
前缀和sb题,这也是省选题???#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[5005][5005],n,maxx,r;int main(){ scanf("%d%d",&n,&r); int x,y,z; for(i原创 2017-07-08 20:30:39 · 240 阅读 · 0 评论 -
bzoj4397: [Usaco2015 dec]Breed Counting
水题。分类维护前缀和。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int n,m,a[100002],b[100002][4];int main(){ scanf("%d%d",&n,&m); for(int i=1;i<=n;i++)原创 2017-07-03 21:44:05 · 235 阅读 · 0 评论 -
Codeforces Round #422 (Div. 2) A. I'm bored with life
题目大意给出两个数,计算阶乘的gcd。题解阶乘gcd其实就是较小数的阶乘。 复杂度o(min(a,b)).#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0; whil原创 2017-07-03 21:54:33 · 194 阅读 · 0 评论 -
Codeforces Round #422 (Div. 2) B. Crossword solving
题目大意给出较短串s和较长串t,s可以对应在任何位置,最少有多少位置不匹配。题解暴力。。。。 (注意把边界去掉) #include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f=0;原创 2017-07-03 21:59:06 · 215 阅读 · 0 评论 -
bzoj1441: Min
a1*x1+a2*x2+…+an*xn=s,s的最小值为gcd(a1,a2,…,an).#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int main(){ int n; cin>>n; int an原创 2017-06-13 21:40:30 · 299 阅读 · 0 评论 -
Codeforces Round #420 (Div. 2) A. Okabe and Future Gadget Laboratory
题目大意给出一个n*n矩阵,判断对于每个不等于1的数是否存在其所在行和所在列数相加等于这个数。example3 1 1 2 2 3 1 6 4 1 output:Yes 2=1+1, 2=1+1,3=2+1, 6=2+4.4=3+1.题解暴力枚举即可。#include<iostream>#include<cstdio>#include<cstring>#include<algor原创 2017-06-26 12:52:59 · 295 阅读 · 0 评论 -
bzoj2295: 【POJ Challenge】我爱你啊
bzoj竟然有这么水的题,当然要把它秒掉。includeincludeincludeincludeusing namespace std; char c,t[]=”luvletter”; int main() { int n; cin>>n; while(c==getchar()) { if(c==’\n’) brea原创 2017-06-12 13:23:58 · 445 阅读 · 0 评论 -
bzoj1689: [Usaco2005 Open] Muddy roads 泥泞的路
把水坑按初始位置排序·,然后简单模拟,具体方式看代码。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct water{ int from; int to;}a[100005];int cmp(water x,water y){原创 2017-06-12 20:50:24 · 377 阅读 · 0 评论 -
bzoj3403: [Usaco2009 Open]Cow Line 直线上的牛
这也是一道模拟题。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[300003];int head=150000,tail=149999,now=0;int main(){ int n,x;char s,t; cin>>n;原创 2017-06-12 20:51:57 · 358 阅读 · 0 评论 -
bzoj3850: ZCC Loves Codefires
贪心,按Ei/Ki从小到大排序#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct ti{ double tim; double lose; double value;}a[1000005];int cmp(ti x,ti原创 2017-06-13 21:30:49 · 281 阅读 · 0 评论 -
bzoj1754: [Usaco2005 qua]Bull Math
高精度乘法模板。。。#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<cstring>using namespace std;int main(void){ string m,n; cin>>m>>n; int p,q; p=m.size();原创 2017-06-18 16:54:05 · 295 阅读 · 0 评论 -
bzoj1968: [Ahoi2005]COMMON 约数研究
计算每个数对答案的贡献。#include<iostream>using namespace std;int main(){ int n; cin>>n; int ans=0; for(int i=1;i<=n;i++) { ans+=n/i; } cout<<ans;}原创 2017-06-26 14:42:58 · 211 阅读 · 0 评论 -
bzoj4029: [HEOI2015]定价
尽量让末尾多0。判断能不能是5. 附黄学长代码(其实是我写挂不想改QAQ)。#include<set>#include<map>#include<ctime>#include<queue>#include<cmath>#include<cstdio>#include<vector>#include<cstring>#include<cstdlib>#include<iostrea转载 2017-06-26 14:47:57 · 357 阅读 · 0 评论 -
bzoj3408: [Usaco2009 Oct]Heat Wave 热浪
裸最短路。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<queue>#include<vector>using namespace std;int n,m,tot,head[2505],s,t,dis[2505];struct cmp{ bool operator原创 2017-07-05 19:18:54 · 352 阅读 · 0 评论 -
bzoj1599: [Usaco2008 Oct]笨重的石子
枚举,入门题。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int f[105],maxx,ans;int main(){ int a,b,c; scanf("%d%d%d",&a,&b,&c); int n=a+b+c;原创 2017-07-05 19:22:55 · 256 阅读 · 0 评论 -
Codeforces Round #421 (Div. 2) A. Mister B and Book Reading
题目大意一本c页的书,第一天看v0页,以后每天前一天多看a页,但最多一天看v1页,每天向前回看l页,多少天能看完。题解想起了小学奥数题。。。 模拟即可。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getch原创 2017-06-28 01:35:18 · 230 阅读 · 0 评论 -
bzoj1677:[Usaco2005 Jan]Sumsets 求和
简单的dp。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int f[1000005],mod=1000000000;int main(){ int n,i,j; scanf("%d",&n); f[1]=1; for(i原创 2017-07-06 18:55:54 · 271 阅读 · 0 评论 -
bzoj2431: [HAOI2009]逆序对数列
一个题的弱化版,数据范围100000也是可做的。。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int f[2][100005],mod=10000;int main(){ int n,k; cin>>n>>k; for(int原创 2017-07-06 18:58:34 · 246 阅读 · 0 评论 -
Codeforces Round #451 (Div. 2) C. Phone Numbers
题目大意问有多少不同的人以及每个人有多少种不同号码,一个串是另一个后缀则算相同号码。题解先将相同的人的电话合并,然后暴力去重就行了。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int read(){ char ch=getchar();int f原创 2017-12-16 22:38:27 · 245 阅读 · 0 评论