- 博客(6)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 HDU1213 How Many Tables(基础并查集)
HDU1213 How Many Tables(基础并查集)链接：题目Time Limit: 1000ms Memory Limit: 32768KB Description Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how m
2016-05-26 10:55:43
418
原创 HDU1003 Max Sum(最大连续子序和、贪心、DP)
HDU1003 Max Sum(最大连续子序和、DP)链接：http://acm.hdu.edu.cn/showproblem.php?pid=1003题目Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Description Given a sequence a[1],a[
2016-05-24 20:10:52
462
原创 LOJ1282 Leading and Trailing(数论)
LOJ1282 Leading and Trailing(数论)链接：http://www.lightoj.com/volume_showproblem.php?problem=1282题目Time Limit: 2000ms Memory Limit: 32768KB Description You are given two integers: n and k, your task i
2016-05-24 00:07:12
408
原创 NEFU115 斐波那契的整除(数论水题)
NEFU115 斐波那契的整除(数论水题)链接：http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=115题目Time Limit:1000ms Memory Limit:65536K Description 已知斐波那契数列有如下递归定义，f(1)=1,f(2)=1, 且n>=3,f(n)=f(n-1)+f(n-2)
2016-05-23 23:22:35
1129
原创 PKU1003 Hangover（水题）
PKU1003 Hangover（水题）题目Time Limit: 1000ms Memory Limit: 10000KB How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length.
2016-05-22 11:46:24
413
原创 cin、cin.get()、cin.getline()、getline()、gets()等函数的用法
cin、cin.get()、cin.getline()、getline()、gets()等函数的用法1、cin>>用法1：最基本，也是最常用的用法，输入一个数字：#include <iostream> using namespace std; main () { int a,b; cin>>a>>b; cout<<a+b<<endl; }输入：2[回车]3[回车] 输出：5注意:
2016-05-21 22:56:50
296
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人