2014 年 3月 1 日随笔档案 - goodniao_1

codeforce Round On Sum of Fractions + stl 的应用

摘要： D. On Sum of FractionsLet's assume thatv(n)is the largest prime number, that does not exceedn;u(n)is the smallest prime number strictly greater thann.Find.InputThe first line contains integert(1 ≤ t ≤ 500)— the number of testscases.Each of the followingtlines of the input contains integern(2 ≤ n 阅读全文

posted @ 2014-03-01 22:29 goodniao_1 阅读(144) 评论(0) 推荐(0)

codeforce Round #232 Div2 map + 质因子 +组合

摘要： C. On Number of Decompositions into MultipliersYou are given an integermas a product of integersa1, a2, ...an. Your task is to find the number of distinct decompositions of numberminto the product ofnordered positive integers.Decomposition intonproducts, given in the input, must also be considered i 阅读全文

posted @ 2014-03-01 17:22 goodniao_1 阅读(192) 评论(0) 推荐(1)

九度OJ 1548 map的用法

摘要：题目来源：http://ac.jobdu.com/problem.php?pid=1548题目描述：给定平面上的n个点，任意做一条直线，求至多能有几个点恰好落在直线上。输入：包含多组测试数据，每组测试数据由一个整数n(0 2 #include 3 #include 4 #include 5 #include 6 #include 7 #define N 105 8 using namespace std; 9 double Point[N][2];10 int n;11 //定义分数结构体12 struct Node13 {14 double zi;15 double mu;1... 阅读全文

posted @ 2014-03-01 15:23 goodniao_1 阅读(238) 评论(1) 推荐(0)

2014年3月1日