![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模拟
mengbi_er
一个蒟蒻JLoier
展开
-
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 · 436 阅读 · 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 · 191 阅读 · 0 评论 -
bzoj4839: [Neerc2016]Abbreviation
细节写死我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')ch=getchar(); while原创 2017-10-09 16:06:34 · 296 阅读 · 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 · 226 阅读 · 2 评论 -
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 · 186 阅读 · 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 · 259 阅读 · 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 · 191 阅读 · 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 · 223 阅读 · 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 · 341 阅读 · 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 · 352 阅读 · 0 评论 -
bzoj4846: [neerc2016]Hard Refactoring
这题是2017北大营的一道题,其实简单模拟即可,但是细节比较多,还是挺可做的#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int a[70005];bool sig=0;char ch;long long read(){ ch=getchar(原创 2017-06-12 13:46:16 · 427 阅读 · 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 · 239 阅读 · 0 评论