- 博客(22)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 蓝桥杯。蚂蚁感冒
描述长100厘米的细长直杆子上有n只蚂蚁。它们的头有的朝左，有的朝右。 每只蚂蚁都只能沿着杆子向前爬，速度是1厘米/秒。 当两只蚂蚁碰面时，它们会同时掉头往相反的方向爬行。 这些蚂蚁中，有1只蚂蚁感冒了。并且在和其它蚂蚁碰面时，会把感冒传染给碰到的蚂蚁。 请你计算，当所有蚂蚁都爬离杆子时，有多少只蚂蚁患上了感冒。输入第一行输入一个整数n (1 接着的一行是n个用
2014-03-31 21:11:01
770
原创 F - Countries
Description There are n countries at planet X on which Xiao Ming was born. Some countries, which have been sharing fine bilateral relations, form a coalition and thus all of their citizens wil
2014-03-31 19:57:58
997
原创 Twenty-four
DescriptionThere are 8 cards :1 1 2 2 3 3 4 4, you need to find out how many ways are there to choose 4 cards and these 4 cards can be used to play the game twenty-four. Attention, there is no dif
2014-03-31 19:51:59
836
原创 Problem 1537 - A - Stones I
DescriptionXiaoming took the flight MH370 on March 8, 2014 to China to take the ACM contest in WHU. Unfortunately, when the airplane crossing the ocean, a beam of mystical light suddenly lit up th
2014-03-31 19:45:50
731
原创 矩形A + B
给你一个高为n ，宽为m列的网格，计算出这个网格中有多少个矩形，下图为高为2，宽为4的网格. Input第一行输入一个t, 表示有t组数据，然后每行输入n,m,分别表示网格的高和宽 ( n Output每行输出网格中有多少个矩形. Sample Input21 22 4
2014-03-20 21:42:53
770
原创 Double Maze
题目描述一个迷宫里，有两个点，你的任务是给出尽可能短的一系列的命令，让这两个点一起执行这些命令能走到一起。如果某个点按某个命令走会走出迷宫或走到障碍上，则忽略这条命令。输入输入不超过1000个样例，每个样例第一行有两个整数n,m(2≤n,m≤11)，之后n行每行m个字符，'.'表示能走的地方，'#'表示障碍，‘*'表示其中一个点。每个样例之间有一个空行。输出
2014-03-18 21:49:54
960
2
原创 Cipher Lock
题目描述守护着神秘宝藏One Piece的是一把非常神秘的密码锁，这个密码锁有n排滚轮，每个滚轮有m个格子，刻着0，1两种数字。作为一把神秘的密码锁，开锁的方式却非常的简单，只要向左或向右转动滚轮使某一列的数字全是1就可以了。（向左滚动：所有的数字向左移动一位，最左边的数字移动到最右边，如001100左滚动一次变为011000，向右滚动与向左滚动操作相同，只是方向相反），作为即将成为海贼王
2014-03-17 20:45:46
772
原创 Bob's Problem
题目描述Bob今天碰到一个问题，他想知道x3+y3 = c 是否存在正整数解？输入第一行是一个整数K(K≤20000)，表示样例的个数。 以后每行一个整数c(2≤c≤109)输出每行输出一个样例的结果，如果存在，输出“Yes”，否则输出“No”。（引号不用输出）样例输入22827样例输出YesNo题解：这个数学
2014-03-17 20:42:06
785
原创 A Love Letter
题目描述 CodeMonkey终于下定决心用情书的方式向心爱的女神表白，当他历经几天几夜写完之后才知道女神有很多不喜欢的词，所以他不得不有把这些词删掉。例如：原文是：ILOVEYOU，女神不喜欢的词是‘LV’，‘O’那么最终情书要改成IEYU。现在已知女生不喜欢的词的集合S，CodeMonkey想知道刚写的情书会改成什么样？S={“HATE”,“SHIT”,“LV”,“O”,“FUCK”
2014-03-17 20:40:29
741
原创 (code jam)Problem A. Minimum Scalar Product
ProblemYou are given two vectors v1=(x1,x2,...,xn) and v2=(y1,y2,...,yn). The scalar product of these vectors is a single number, calculated as x1y1+x2y2+...+xnyn.Suppose you are allowed to perm
2014-03-13 19:55:28
863
原创 整形范围
unsigned int 0～4294967295 int 2147483648～2147483647 unsigned long 0～4294967295long 2147483648～2147483647long long的最大值：9223372036854775807long long的最小值：-9223372036854775808unsigne
2014-03-13 19:43:40
670
原创 (code jam)Problem C. T9 Spelling
ProblemThe Latin alphabet contains 26 characters and telephones only have ten digits on the keypad. We would like to make it easier to write a message to your friend using a sequence of keypresses t
2014-03-12 21:47:12
900
原创 (code jam)Problem B. Reverse Words
ProblemGiven a list of space separated words, reverse the order of the words. Each line of text contains L letters and W words. A line will only consist of letters and space characters. There will
2014-03-12 20:54:11
736
原创 （code jam)Problem A. Store Credit
ProblemYou receive a credit C at a local store and would like to buy two items. You first walk through the store and create a list L of all available items. From this list you would like to buy tw
2014-03-12 20:09:46
939
原创 (CF)C. Team
C. Teamtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNow it's time of Olympiads. Vanya and Egor decided t
2014-03-11 20:53:12
769
原创 (CF)B. Sereja and Contests
B. Sereja and Conteststime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSereja is a coder and he likes to tak
2014-03-11 20:21:22
682
原创 (CF)A. Vanya and Cards
A. Vanya and Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya loves playing. He even has a specia
2014-03-11 20:12:34
676
原创 （CF）C. Inna and Huge Candy Matrix
C. Inna and Huge Candy Matrixtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputInna and Dima decided to surp
2014-03-06 19:36:16
1241
原创 （CF）B. Inna and New Matrix of Candies
B. Inna and New Matrix of Candiestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputInna likes sweets and a ga
2014-03-06 19:21:58
836
原创 （CF)A. Inna and Choose Options
A. Inna and Choose Optionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere always is something to choo
2014-03-06 19:18:22
960
原创 398A - Cards CF
A. Cardstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputUser ainta loves to play with cards. He has a cards
2014-03-05 20:38:48
1057
原创 算法训练 结点选择
问题描述有一棵 n 个节点的树，树上每个节点都有一个正整数权值。如果一个点被选择了，那么在树上和它相邻的点都不能被选择。求选出的点的权值和最大是多少？输入格式第一行包含一个整数 n 。接下来的一行包含 n 个正整数，第 i 个正整数代表点 i 的权值。接下来一共 n-1 行，每行描述树上的一条边。输出格式输出一个整数，代表选出
2014-03-03 21:45:11
1954
局域网远程修改windows密码
2021-09-27
C# agsXmpp连接Openfire的Demo。可登陆接收发送消息
2018-11-13
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人