摘要:
GCD & LCM Inverse 题目:http://poj.org/problem?id=2429 题意: 给你两个数的gcd和lcm,[1, 2^63)。求a,b。使得a+b最小。 思路: lcm = a * b / gcd 将lcm/gcd之后进行大数分解。形成a^x1 * b^x2 * c 阅读全文
posted @ 2017-05-29 11:23
ljbguanli
阅读(150)
评论(0)
推荐(0)
摘要:
Overflow Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of 阅读全文
posted @ 2017-05-29 10:30
ljbguanli
阅读(182)
评论(0)
推荐(0)
摘要:
想要实现例如以下分页效果: 分页实现逻辑: 关键代码例如以下: page.jsp <%@ page language="java" contentType="text/html; charset=UTF-8" pageEncoding= "UTF-8"%> <%@taglib uri= "http: 阅读全文
posted @ 2017-05-29 09:42
ljbguanli
阅读(176)
评论(0)
推荐(0)
摘要:
1306. Sequence Median Time limit: 1.0 second Memory limit: 1 MB Language limit: C, C++, Pascal Given a sequence of N nonnegative integers. Let's defin 阅读全文
posted @ 2017-05-29 08:46
ljbguanli
阅读(125)
评论(0)
推荐(0)