待到山花烂漫时

对于任何正整数x，其约数的个数记作g(x)，例如g(1)=1、g(6)=4。如果某个正整数x满足：对于任意的小于x的正整数 i，都有g(x)>g(i) ，则称x为反素数。例如，整数1，2，4，6等都是反素数。现在给定一个数N，请求出不超过N的最大的反素数。输入格式一个正整数N。输出格式一个整数，表示不超过N的最大反素数。数据范围1≤N≤2∗109输入样例：1000输出样例：840题意：如题思路：依照题意，不难得出x是【1，x】中约数个数最大的那个，而且其中没有个数相等的

A：数列下标题意：找出每个位置右边第一个比自身大的位置思路：单调栈模板题。然而这个题目数据水，竟然暴力都能过AC代码：#include<iostream>#include<string>#include<algorithm>#include<cstdio>#include<cstring>#include<cmath>#include<map>#include <queue>#includ

Description最近,wzhp身边有许多好朋友得到真爱。看着好朋友与妹子成双成对，Wzhp也嫉妒起来了，他也想找个女朋友，所以他在他们班上举办了一次联谊晚会，希望能找到女票。已知有好多个女生参加这次联谊晚会，把这些女生从1到N-1编号，其中N为wzhp的编号，经过一个晚上的happy聚会，wzhp看上了好多美女，他把这些女生的编号都记下来了。X神很好奇的想知道wzhp看上多少位女生，于是他暗地里去了解，但他惊奇的发现，不被看上的女生的编号和wzhp的编号都有大于1的公约数。但由于女生实在

Petya loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn’t contain digits other than 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.Lucky number is super lucky if it’s dec

The owner of a casino for New Russians has a very refined sense of beauty. For example, after a game there remain two piles with the same number of cards on the table, and the owner likes the cards to be arranged into two piles according to the color: one

Several bus routes were in the city of Fishburg. None of the routes shared the same section of road, though common stops and intersections were possible. Fishburg old residents stated that it was possible to move from any stop to any other stop (probably m

Mary has just graduated from one well-known University and is now attending celebration party. Students like to dream of a beautiful life, so they used champagne glasses to construct a small pyramid. The height of the pyramid is n. The top level consists o

You are given a non-negative integer n, its decimal representation consists of at most 100 digits and doesn’t contain leading zeroes.Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove any digit at al

DescriptionDaily Cool Run is a popular game, and Xdp enjoys playing the game recently.While playing the game, you may get normal coins or flying coins by running and jumping.Now, he meets a problem that what is the maximum score he can obtain.To simpli

DescriptionAlice is preparing for her next trip during the summer vocation. She is now planing for the route of aerial photography (taking photos with drones).She will launch the drone on a certain place, for convenience, we consider it point (0, 0), and

题目描述译自 CEOI2015 Day2 T1「Ice Hockey World Championship」今年的世界冰球锦标赛在捷克举行。Bobek 已经抵达布拉格，他不是任何团队的粉丝，也没有时间观念。他只是单纯的想去看几场比赛。如果他有足够的钱，他会去看所有的比赛。不幸的是，他的财产十分有限，他决定把所有财产都用来买门票。给出 Bobek 的预算和每场比赛的票价，试求：如果总票价不超过预算，他有多少种观赛方案。如果存在以其中一种方案观看某场比赛而另一种方案不观看，则认为这两种方案不同。输入格式

翰翰和达达饲养了N只小猫，这天，小猫们要去爬山。经历了千辛万苦，小猫们终于爬上了山顶，但是疲倦的它们再也不想徒步走下山了（呜咕>_<）。翰翰和达达只好花钱让它们坐索道下山。索道上的缆车最大承重量为W，而N只小猫的重量分别是C1、C2……CN。当然，每辆缆车上的小猫的重量之和不能超过W。每租用一辆缆车，翰翰和达达就要付1美元，所以他们想知道，最少需要付多少美元才能把这N只小猫都运送下山？输入格式第1行：包含两个用空格隔开的整数，N和W。第2…N+1行：每行一个整数，其中第i+1行的

“Drat!” cursed Charles. “This stupid carry bar is not working in my Engine! I just tried to calculate the square of anumber, but it’s wrong; all of the carries are lost.”“Hmm,” mused Ada, “arithmetic without carries! I wonder if I can figure out what you

Description定义一个二维数组：int maze[5][5] = {0, 1, 0, 0, 0,0, 1, 0, 1, 0,0, 0, 0, 0, 0,0, 1, 1, 1, 0,0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。Input一个5 × 5的二维数组，表示一个迷宫。数据保证有唯一解。Output左上角到右下角的最短路径，格式如样例所示。Sam

DescriptionFarmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15) of square tiles, each of which is colored

Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 , k <= n当为-1 -1时表示输入结束。随后的n行描述了棋盘的形状：每行有n个字符，其中 # 表示棋

Problem DescriptionThe counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current...

Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with...

DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone’ (also known as ‘Rock, Paper, Scissors’, ‘Ro, Sham, Bo’, and a host of other names) in o...

Problem DescriptionFor a decimal number x with n digits (AnAn-1An-2 … A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + … + A2 * 2 + A1 * 1. Now you are given two numbers A and B, pleas...

DescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.The ...

Problem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are...

倒回来看下新生赛里面的几个算法题题意如图一道DFS的水题，数据量小直接暴力完事了。深搜思路：1.设置vis表示当前位置有没有走过。2.设置方向数组对应四个方向。3.设置cur变量表示当前是奇数步还是偶数步。我用0代表当前要走偶数步，1代表当前要走奇数步。4.对于深搜，每个位置试探之前要记录vis，搜完又要改回来，进行下一个方向的试探。4.当步长为偶数的时候要记录两步以内的那两个位...

给定一个字符串，求解该串中某一个子序列最多出现的次数。这里采用暴力的方法，有些数据量小的题可以试试，大一点的就肯定超时了。思路：因为是子序列不一定连续只要下标递增就行了，那么对于每个位置，都有把当前字符压进栈（字符串尾部更新）或者不选的操作，那么这里就有回溯了。另外每次搜索都将当前字符串存进哈希表，并且value+1，到最后遍历一遍哈希看哪个string的value最大即可。#include...

基本思路：1.创建一个vis数组，大小等同于grid数组，用来标记走过的路径。2.搜索解题的原理：每次搜索都把以当前元素为中心，把能够扩展到的元素进行标记，比如以(x，y)为中心进行搜索，发现(x+1,y)的元素时陆地，那么再以它为中心进行搜索，同时标记。以此类推。3.那么每次搜索都能将一块区域内能联通的元素全部标记，即是count+1(可以看成一片岛屿)，而每次搜索都是以为陆地，且没标记...

题目描述因为 151 既是一个质数又是一个回文数（从左到右和从右到左是看一样的），所以 151 是回文质数。写一个程序来找出范围 [a,b] (5≤a<b≤100,000,000)a,b( 一亿)间的所有回文质数。输入格式第 1 行: 二个整数 a 和 b .输出格式输出一个回文质数的列表，一行一个。输入输出样例输入 #1复制5 500输出 #1复制5711101...

题目如下Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or is a wall. You can go from one cell to another only if both cells are empty and have a common si...