Codeforces
文章平均质量分 71
better_space
这个作者很懒,什么都没留下…
展开
-
【codeforces】 Bear and Reverse Radewoosh
A. Bear and Reverse Radewooshtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak and Radewoosh are going原创 2016-08-22 21:22:15 · 211 阅读 · 0 评论 -
【codeforces】Bear and Three Balls
A. Bear and Three Ballstime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputLimak is a little polar bear. H原创 2016-08-22 21:26:50 · 377 阅读 · 0 评论 -
【codeforces】Dima and Guards
A. Dima and Guardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNothing has changed since the last round.原创 2016-08-22 21:29:33 · 344 阅读 · 0 评论 -
【codeforces】-660Co-prime Array
A. Co-prime Arraytime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputYou are given an array of n elements,原创 2016-08-22 21:04:43 · 243 阅读 · 0 评论 -
【codeforces】数学
A - A 使用long longTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 598ADescriptionIn this problem you are to calculat原创 2016-08-23 20:50:37 · 276 阅读 · 0 评论 -
【codeforces】数学
B - B 使用long longTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 597ADescriptionFind the number of k-divisible nu原创 2016-08-23 20:53:24 · 396 阅读 · 0 评论 -
【codeforces】New Year Transportation
New Year TransportationTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNew Year is coming in Line World! In this world, there a原创 2016-09-22 08:50:53 · 526 阅读 · 0 评论 -
【codeforces】New Year Permutation(floyd算法进阶)
New Year PermutationTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionUser ainta has a permutation p1, p2, ..., pn. As the New原创 2016-09-22 08:58:16 · 512 阅读 · 0 评论 -
【codeforces】Misha and Changing Handles(映射+并查集)
Misha and Changing HandlesTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionMisha hacked the Codeforces site. Then he decided to原创 2016-09-22 11:07:16 · 690 阅读 · 0 评论 -
【codeforces】New Year Book Reading
New Year Book ReadingTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionNew Year is coming, and Jaehyun decided to read many boo原创 2016-09-22 14:31:05 · 333 阅读 · 0 评论 -
【codeforces div2 A】Calculating Function(思维)
A. Calculating Functiontime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputFor a positive integer n let's d原创 2016-09-29 14:19:49 · 608 阅读 · 0 评论 -
【codeforces486B】OR in Matrix(思维)
B. OR in Matrixtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define logical OR as an operation on t原创 2016-09-30 13:50:04 · 290 阅读 · 0 评论 -
【codeforces237C】Primes on Interval
C. Primes on Interval time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output You’ve decided to carry out a survey in the theory of prime num原创 2016-10-17 22:50:03 · 354 阅读 · 0 评论 -
【codeforces】Non-square Equation(数学推导)
time limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputLet's consider equation:x2 + s(x)·x - n = 0, wh原创 2016-11-08 22:45:34 · 442 阅读 · 0 评论 -
【codeforces】Grasshopper And the String(div2A)
A. Grasshopper And the Stringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day, the Grasshopper was j原创 2016-11-01 13:40:32 · 694 阅读 · 0 评论 -
【codeforces】Ohana Cleans Up
B. Ohana Cleans Uptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOhana Matsumae is trying to clean a room原创 2016-08-22 21:12:05 · 237 阅读 · 0 评论 -
【CodeForces】 632B Alice, Bob, Two Teams
B. Alice, Bob, Two Teamstime limit per test 1.5 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputAlice and Bob are playing a原创 2016-08-22 20:58:30 · 229 阅读 · 0 评论 -
【codeforce】Spongebob and Joke
我代码的关键是存储下标.如果bm中的元素fn中都有且只出现一次,可得possible;如果bm中的元素fn中都有但有fn中有出现两次的,可判断ambiguity;如果bm中的元素有fn中没有的,可判断impossible。#include<stdio.h>#include<string.h>int bum[100010],fum[100010],aum[100010][2];int main(原创 2016-07-23 11:21:23 · 707 阅读 · 0 评论 -
【codeforces】New Year and Days
思路:水#include<stdio.h>#include<string.h>char c[20];int main() { int n; while(scanf("%d",&n)!=EOF) { getchar(); gets(c); if(c[3]=='m') { if(n<=29)原创 2016-07-21 23:06:21 · 206 阅读 · 0 评论 -
【codeforces】Bulbs
抱着水的心态就行了=.=#include<stdio.h>#include<algorithm>using namespace std;int a[100000];int main() { int n,m,mark=1; while(scanf("%d %d",&n,&m)!=EOF) { int t,s,k=0; for(int l=0; l原创 2016-07-21 23:10:37 · 281 阅读 · 0 评论 -
【codeforces】Divisibility
只要知道n/k为n一下能被k整除的数的总和就行了。#include<stdio.h>typedef long long ll;ll abs(ll x) { return x>0?x:-x;}int main() { ll k,a,b; while(~scanf("%I64d%I64d%I64d",&k,&a,&b)) { ll ans;原创 2016-07-23 11:49:36 · 230 阅读 · 0 评论 -
【codeforces】Vacations
本题要考虑清楚各种情况,其实也很简单一个循环解决了,重要的还是贪心的思想。尽可能多的不休息。 ***1.遇到0,休息天数加1; 2.遇到非第0(第0个元素是三可以舍掉,不影响结果)个元素是3的,如 果前面是2,就让它等1,反之等2; 3.遇到两个1或2相等,后一个等0,休息天数加1。*#include<stdio.h>int a[102];int main() { int n;原创 2016-07-24 00:04:25 · 255 阅读 · 0 评论 -
【codeforces】 Far Relative’s Problem
这不能算贪心题吧#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[380],m1[380],m2[380];int main() { int n; while(scanf("%d",&n)!=EOF) { int began,end;原创 2016-07-23 21:12:57 · 235 阅读 · 0 评论 -
【codeforces】Radar Installation
别说话,看注释。#include<stdio.h>//此题犯了一个超级二,又很可能被忽略而出现的问题 //输出-1的时候我竟然忘了Cace %d:格式了 / 大哭/哇/ #include<math.h>#include<algorithm>using namespace std;struct note { double front; doub原创 2016-07-23 20:06:12 · 367 阅读 · 0 评论 -
【codeforces】Hulk
A. Hulktime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputDr. Bruce Banner hates his enemies (like others原创 2016-08-15 22:54:43 · 317 阅读 · 0 评论 -
【codeforces】601A—— The Two Routes
A. The Two Routestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Absurdistan, there are n towns (number原创 2016-08-16 20:02:13 · 416 阅读 · 0 评论 -
【codeforces】The Text Splitting
怎么说呢,此题我的代码略乱,就是求二元一次方程#include<stdio.h>#include<string.h>char c[106];int main() { int n,p,q; while(scanf("%d %d %d",&n,&p,&q)!=EOF) { getchar(); int k=0,t=0; for(int l=0原创 2016-07-21 22:49:00 · 322 阅读 · 0 评论 -
【codeforces】Pasha and Stick
有规律的。找到就ok#include<stdio.h>int main() { int n; while(scanf("%d",&n)!=EOF) { int x; if(n%2!=0) printf("0\n"); else { if(n%4==0) p原创 2016-07-21 23:03:05 · 197 阅读 · 0 评论 -
【codeforces】706B—Interesting drink
B. Interesting drinktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy likes to rest after a hard wor原创 2016-08-17 09:05:00 · 384 阅读 · 0 评论 -
【codeforces711B】Bus to Udayland
A. Bus to Udaylandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon are tr原创 2016-09-11 22:05:58 · 698 阅读 · 0 评论 -
【codeforces711B】Chris and Magic Square
B. Chris and Magic Squaretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon原创 2016-09-11 22:23:44 · 272 阅读 · 0 评论 -
【codeforces】29C—Mail Stamps
C. Mail Stampstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Bob got a letter in an envelope. Bob原创 2016-08-17 21:47:51 · 493 阅读 · 0 评论 -
【codeforces】378BParade(简单思维+英语阅读理解-.-)
B. Paradetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVery soon there will be a parade of victory over原创 2016-11-01 22:55:12 · 614 阅读 · 0 评论