Lv.1
谙忆
更多个人资料
46
成长值
1
关注
5
粉丝
+ 关注
私信
个人介绍
这个人很懒,什么都没有留下
感兴趣或擅长的领域
微服务架构、编程语言
个人勋章
TA还没获得勋章~
成长雷达
20
6
0
0
20
个人资料
个人介绍
这个人很懒,什么都没有留下
感兴趣或擅长的领域
微服务架构、编程语言
达成规则
以上满足
项可达成此勋章
博客
关注
粉丝
论坛
全部时间
全部时间
最近三天
最近一周
最近一月
全部
暂无专栏分类
HDOJ 1005 Number Sequence
Problem Description A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7. Given A, B, and n, you are to calculate the value of f(n)....
谙忆
2021-05-28 08:52:17
968
0
0
2021-05-28 08:52:17
968
0
0
HDOJ1003Max Sum
Problem Description Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + ...
数据结构
谙忆
2021-05-28 08:52:16
1257
0
0
2021-05-28 08:52:16
999+
0
0
HDOJ2063过山车 匈牙利算法
Problem Description RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner...
谙忆
2021-05-28 08:52:12
1428
0
0
2021-05-28 08:52:12
999+
0
0
蛇形填数
样例输入: 4 样例输出: 10 11 12 1 9 16 13 2 8 15 14 3 7 6 5 41234567 #include <stdio.h> #include <stdlib.h> #include <string.h> int main() { int a[50][50]; int i,j,x,y,cot,n; scanf...
谙忆
2021-05-28 08:52:07
906
0
0
2021-05-28 08:52:07
906
0
0
HDOJ1019Least Common Multiple
Problem Description The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM...
谙忆
2021-05-28 08:52:06
886
0
0
2021-05-28 08:52:06
886
0
0
n个灯,k个人的开灯问题
/**有n个灯,编号为1-n。第一个人把所以灯打开,第二个人按下 所有编号为2的倍数的开关,第三个人按下3的倍数的开关,依次类推, 一共有k个人,问最后有哪些灯开着? 样例输入: 7 3 样例输出: 1 5 6 7 **/ #include <stdio.h> #include <stdlib.h> #include <string.h> int mai...
谙忆
2021-05-28 08:52:05
896
0
0
2021-05-28 08:52:05
896
0
0
HDOJ1002题A + B Problem II,2个大数相加
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. Input The first line of the input contains an integer ...
谙忆
2021-05-28 08:52:05
1071
0
0
2021-05-28 08:52:05
999+
0
0
HDOJ1018Big Number
Problem Description In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this pr...
谙忆
2021-05-28 08:52:04
971
0
0
2021-05-28 08:52:04
971
0
0
环状序列
长度为n的环状串有n种表示法,分别为从某个位置开始顺时针得到。 求字典序最小的,也就是最小表示 #include <stdio.h> #include <string.h> #define maxn 105 int less(char *s,int p,int q) { int i,n; n=strlen(s); for(i=0;i<n;i++) { if(s[(p...
谙忆
2021-05-28 08:52:03
904
0
0
2021-05-28 08:52:03
904
0
0
HDOJ 1000 A + B Problem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 513689 Accepted Submission(s): 162876 Problem Description Calculate A + B. Input...
谙忆
2021-05-28 08:52:03
1172
0
0
2021-05-28 08:52:03
999+
0
0
总条数:756
10
10
20
50
100
1
2
3
4
5
6
...
76
上滑加载中
https://www.baidu.com/s?ie=utf-8&f=3&rsv_bp=0&rsv_idx=1&tn=baidu&wd=sed%20%E6%9B%BF%E6%8D%A2%E5%AD%97%E7%AC%A6%E4%B8%B2&rsv_pq=c7db61a600035dc5&rsv_t=5e19yEsbV9N5fIvdlGRU
+ 关注
私信