随笔分类 -  算法入门

摘要:Ubiquitous ReligionsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 34122 Accepted: 16477DescriptionThere are so many different religions in... 阅读全文
posted @ 2017-04-14 01:46 范晋豪 阅读(238) 评论(0) 推荐(0)
摘要:Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32052 Accepted: 10876DescriptionA tree is a well-known data structure that is e... 阅读全文
posted @ 2017-04-14 01:15 范晋豪 阅读(152) 评论(0) 推荐(0)
摘要:NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 16628 Accepted: 6597 Special JudgeDescriptionAndrew is working as system administrato... 阅读全文
posted @ 2017-04-13 22:17 范晋豪 阅读(140) 评论(0) 推荐(0)
摘要:箭无虚发Time Limit: 1000 MSMemory Limit: 65536 KBTotal Submissions: 128Accepted: 21Description JH苦练10年,终于成为了一个神箭手,在下山之前,大师兄YZ不放心,想考验他,只给他一定时间t,同时给他n... 阅读全文
posted @ 2016-09-25 15:33 范晋豪 阅读(360) 评论(0) 推荐(0)
摘要:阶乘因式分解(一)时间限制:3000 ms | 内存限制:65535 KB难度:2描述给定两个数m,n,其中m是一个素数。将n(0using namespace std;int f(int n, int m){ return n > t; while (t--) { int n, m; ci... 阅读全文
posted @ 2015-11-28 15:09 范晋豪 阅读(129) 评论(0) 推荐(0)
摘要:习题2-10 排列(permutation)用1,2,3,…,9组成3个三位数 abc, def, 和ghi,每个数字恰好使用一次,要求 abc:def:ghi = 1:2:3。输出所有解。提示:不必太动脑筋。解题思路:首先abc最小值只能为123,最大值329,才符合题意。此题重点判断1—9中每... 阅读全文
posted @ 2015-08-30 10:33 范晋豪 阅读(364) 评论(0) 推荐(0)