ACM！荣耀之路！

题意：一个迷宫，人一开始处在出口位置，要求遍历一次迷宫之后，回到初始位置，现在给出行走的方案，要出画出迷宫人一开始面向右边F：往前走一步R：右转并往前走一步L：左转并往前走一步B：后转并往前走一步思路：直接模拟即可#include #include #include #include #include #include #includ

题意：给出N个开口向下的抛物线的a,b,c，要求输出顶点最高的抛物线是哪一条思路：直接抛物线公式算得#include #include #include #include #include #include #include #include #include #include #include #include using namespac

题意：有N个学生，有M题目然后对应N行分别有一个二进制和一个整数二进制代表该同学给出的每道题的答案，整数代表该同学的答案与标准答案相符的个数要求判断标准答案有几个，如果标准答案只有一种，则输出标准答案思路：很容易想到状态压缩，但是很明显1变成1也就是说，对于一个串，我们分半处理首先处理前一半，讨论前一半与标准答案相符的状况，然后再讨论后半串，看与标准答案相符

题意：对于我们已知的斐波那契数列，现在给出一个n，要我们求出一个新的斐波那契数列起始项，使得n能在新的斐波那契数列中，要求起始项y最小思路：我们知道a3 = a1+a2a4 = a1+2*a2a5 = 2*a1+3*a2a6 = 3*a1+5*a2可以得到an = fib[n-2]*a[1]+fib[n-1]*a[2]然后我们只需要枚举就可以

题意：有n个程序员，每个程序员有三个能力值，当一个程序员三个能力值都小于另外一个程序员的时候，那么就可以淘汰那个程序员，问经过淘汰之后，还剩下几个程序员。思路：我们首先按照x排序，那么我们就只需要考虑y,z的情况了，这个时候可以用线段树，我们以y作为区间，以z作为值，每次查询只需要看1~y-1区间内是否已经存在小于z的值，如果存在，那么这个人就要淘汰#include

题意：给出一系列的点，要求寻找最多4个点，使得组成一个面积最大的多边形思路：很显然只有两种情况，要么是三角形，要么是四边形首先不难想到的是，先要把最外面的点都找出来，其实就是找凸包但是并没有做过凸包，那么怎么办？我们知道，ab与ac向量相乘得到ab*ac>=0的情况下，可以知道所有符合这个条件的，都固定在顺时针，那么我们可以通过这个，来求得所有外层的点得到这些点

题意：给出n,m，代表微波炉有n个按钮，要求达到总时间为m然后给出n个数，代表n个按钮能增加的时间，问最少几步，能够使得按出的总时间大于等于要求的时间，并且相差最小输出最小的步数与相差的最小值要求，当总时间小于0时，时间为0，大于3600时，时间为3600思路：直接暴力BFS，用VIS记录步数#include #include #include #

Problem descriptionSamuel W. E. R. Craft is an artist with a growing reputation. Unfortunately, the paintings he sells do not provide him enough money for his daily expenses plus the new suppl

Problem descriptionPorto’s book club is buzzing with excitement for the annual book exchange event! Every year, members bring their favorite book and try to find another book they like that is

Problem descriptionInputThe first line has one integer: N, the number of different distances the Golf Bot can shoot. Each of the following N lines has one integer, ki, the di

Problem descriptionWe want to have a great SWERC at Porto this year and we approached this challenge in several ways. We even framed it as a word addition problem, similar to the classic SEND+

Problem description  A convex polygon with n edges can be divided into several triangles by some non-intersect diagonals. We denote d(n) is the number of the different ways to divide the convex

Problem Descriptionsoda has a set S with n integers {1,2,…,n}. A set is called key set if the sum of integers in the set is an even number. He wants to know how many nonempty subsets of S are

Problem DescriptionThere are n soda sitting around a round table. soda are numbered from 1 to n and i-th soda is adjacent to (i+1)-th soda, 1-st soda is adjacent to n-th soda.Each so

Problem DescriptionAlice and Bob are playing a game on an undirected graph with n (n is even) nodes and m edges. Every node i has its own weight Wv, and every edge e has its own weight We.They

Problem DescriptionTimer took the Probability and Mathematical Statistics course in the 2012, But his bad attendance angered Professor Tian who is in charge of the course. Therefore, Professor Tia

Problem Description“Swipe Bo” is a puzzle game that requires foresight and skill. The main character of this game is a square blue tofu called Bo. We can swipe up / down / left / right to move B

Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men stand in line. Now we select an

Problem DescriptionAlice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board with one in each grid and every coin ma

Problem DescriptionAs we all know, Fat Brother likes MeiZi every much, he always find some topic to talk with her. But as Fat Brother is so low profile that no one knows he is a rich-two-generatio