码迷,mamicode.com
首页 >  
搜索关键字:careful    ( 128个结果
HDU 1028 Ignatius and the Princess III(生成函数)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24796 Accepted Submission(s): 17138 Problem Descr ...
分类:其他好文   时间:2018-06-08 14:32:42    阅读次数:148
【转】window.onerror跨域问题
What the heck is "Script error"? Ben Vinegar/ May 17, 2016 If you’ve done any work with the JavaScript onerror event before, you’ve probably come acro ...
分类:Windows程序   时间:2018-05-11 13:04:37    阅读次数:291
SPOJ:The Next Palindrome(思维)
A positive integer is called a palindrome if its representation in the decimal system is the same when read from left to right and from right to left. ...
分类:其他好文   时间:2018-04-19 19:13:50    阅读次数:179
python--学习--用户名和密码验证
#!/usr/bin/python3user=‘whoooo‘password="1234567"name=input("请输入用户名:")namepasswd=input("请输入密码:")count1=1count2=1whilename!=user:print("careful,youcanonlyinpu
分类:编程语言   时间:2018-03-27 12:21:44    阅读次数:190
CS231n笔记 Lecture 8, Deep Learning Software
CPU and GPU If you aren’t careful, training can bottleneck on reading data and transferring to GPU! Solutions: - Read all data into RAM - Use SSD inst ...
分类:其他好文   时间:2018-03-03 19:24:29    阅读次数:178
January 19th, 2018 Week 3rd Friday
As iron sharpens iron, so a friend sharpens a friend. 铁磨铁,可以磨砺出刀刃,朋友相交,亦应如此。 When making friends with others, please be a little more careful. Hold yo ...
分类:其他好文   时间:2018-02-25 20:44:30    阅读次数:225
HDU 1527 取石子游戏(威佐夫博弈)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8509 Accepted Submission(s): 4833 Problem Descrip ...
分类:其他好文   时间:2018-02-25 11:15:25    阅读次数:207
线段树1
线段树的基本操作 1、特点:与普通的树不同,线段树存取的是某一个区间,它在各个节点保存一条线段。 2、节点储存方式:(结构体) 方式一:数组储存 方式二:链表储存(自己了解) 3、建树 思路: if(叶节点) 存值,返回; else 递归,查找左右孩子; 最后一定要记得回溯,维护区间; 4、查找线段 ...
分类:其他好文   时间:2018-01-06 18:00:32    阅读次数:207
我的emacs设置
(custom-set-faces ;; custom-set-faces was added by Custom. ;; If you edit it by hand, you could mess it up, so be careful. ;; Your init file should co ...
分类:系统相关   时间:2018-01-04 00:27:08    阅读次数:288
Palindrome Pairs
Naive Solution: Time: O(n^2*k) with n the total number of words in the "words" array and k the average length of each word: check each combination see ...
分类:其他好文   时间:2017-11-13 13:46:14    阅读次数:197
128条   上一页 1 ... 3 4 5 6 7 ... 13 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!