yyer's blog

摘要： 7-28 猴子选大王 (20分) https://pintia.cn/problem-sets/14/problems/808 题意：n个猴子围成圈，从1到3循环报数，为3就退出直到只剩最后一个猴子，输出该猴子初序； 思路：模拟题，数组存储，对数组1~3循环编号，同时k从1递增，逢4变1，数组编号逢 阅读全文

摘要： 7-13 日K蜡烛图 (15 分) https://pintia.cn/problem-sets/14/problems/793 AC代码： 1 #include <cstdio> 2 #include <cmath> 3 #include <algorithm> 4 using namespace 阅读全文

摘要： 1.搜索链表 http://oj.jxust.edu.cn/contest/problem?id=1644&pid=1 Problem Description 从键盘上输入n个学生的信息:学号,姓名, 数学, 英语, 语文的成绩，用这些信息构建一个动态链表。再从键盘上输入一个学号, 用顺序查找的方法 阅读全文

摘要： https://acm.ecnu.edu.cn/contest/231/?tdsourcetag=s_pctim_aiomsg A. 纸条（模拟） https://www.jisuanke.com/contest/5527?view=challenges B So easy（模拟） http://o 阅读全文

摘要： Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequen... 阅读全文

摘要： Problem Description M斐波那契数列F[n]是一种整数数列，它的定义如下：F[0] = aF[1] = bF[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n，你能求出F[n]的值吗？ Input 输入包含多组测试数据；每组数据占一行，包含3个整数a, b, n（ 0 #include #include #include #include... 阅读全文

摘要： Problem Description Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative integer... 阅读全文

摘要： time limit per test 2.0 s memory limit per test 64 MB input standard input output standard output Omar has a deck of cards. Every card has a unique integer number written on it. He says that his cards... 阅读全文

摘要： I. Playing with strings time limit per test 2.0 s memory limit per test 64 MB input standard input output standard output Taboush is a 10 year-old school boy. On his birthday, his parents got him a ne... 阅读全文

摘要： Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 79794 Accepted Submission(s): 20257 Problem Description lily的好朋友xiaoou333最近很空，他想了一件没有什么意义的事情，... 阅读全文