lois_123的专栏

1.string中得方法a.  objstr.split()：将字符串转换成数组。eg：var str= “number”，反转字符串：将字符串转换成数组，对该数组使用reverse（），反转数组，再用join（）将数组转换成字符串str=str.split("").reverse().join('');得到str="remun";str是字符串str=str.split(

haha input{ width: 50px; } div{ margin-bottom: 30px; } td{ text-align: center; } tr{ background-color: #fff; } tr:hover{ background-color: #f2f2f2; }

控制器中代码 记得在路由表中添加路由：public function postCategoryList() { $result = DB::connection('news')->table('categories')->select('id','pid','name')-> where('is_delete',0)->whereIn('pid',[12,18,28])->get()

控制器中的代码public function postAddAqi() { $stid = Request::input("stid");//获取数据，不要忘记，引号中的是在.blade.php中定义的变量 $aqi = Request::input("aqi"); $time = Request::input("time"); for($i = 0; $i < cou

1.在sublime Text3中新建 一个项目 ，需要下载laravel 框架 配置IIS 开始->右击计算机->管理->服务和应用程序->双击internet信息服务->Default Web中添加虚拟目录->别名自己填（我填 haha） 物理路径添加项目文件夹下的public文件app->Http->Controllers:该路径下的Controllers文件夹中新建NameContro

3824 *4369=（38*10^2+24）*（43*10^2+69）=（38*43）*10^2+（38*69+43*24）*10+24*69这样将相乘的数分成小的数相乘#include#include#includeusing namespace std;#define SIGN(A) ((A > 0) ? 1 : -1)int pow(int x,int n

卡特兰数：      h(0)=1,h(1)＝1,catalan数满足递归式：h(n)= h(0)*h(n-1) + h(1)*h(n-2) +  + h(n-1)h(0) (其中n>=2)      该递推关系的解为：h(n)=C(2n,n)/(n + 1) (n=1,2,3,)      递归式：  h(n)=(h(n-1)*(4*n-2)/(n+1));前几项：1, 1,

RotateTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 960    Accepted Submission(s): 448Special JudgeProblem DescriptionNoting

题目链接奇数阶魔方Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3103    Accepted Submission(s): 1634Problem Description一个 n 阶方阵

题目链接：链接Team FormationTime Limit: 3 Seconds      Memory Limit: 131072 KB For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from

Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7315 Accepted: 3042DescriptionBeads of red, blue or green colors are connected togeth

A/BTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3286    Accepted Submission(s): 2492Problem Description要求(A/B)%9973，但由于A很大，我们

hdu 2669 题目链接RomanticTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3898    Accepted Submission(s): 1614Problem Description

Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 0 Accepted: 0DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set o

小兔的棋盘Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7786    Accepted Submission(s): 4145Problem Description小兔的叔叔从外面旅游回来给她带来了一个礼

稳定排序Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4231    Accepted Submission(s): 1655Problem Description大家都知道，快速排序是不稳定的排序方法。

How many prime numbersTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0Problem Description  Give yo

月之数Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7861    Accepted Submission(s): 4641Problem Description当寒月还在读大一的时候，他在一本武林秘籍中（

poj 2389：code：#include #include #include#includeusing namespace std;int s[100];void multiply(const char *a,const char *b){ int i,j,ca,cb; //int *s; ca=strlen(a); cb=strlen(b

盐水的故事Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15156    Accepted Submission(s): 3694Problem Description挂盐水的时候，如果滴起来有规律，先是滴