摘要:
生成1~n的排列 我们尝试用递归的思想解决:先输出所有以1开头的排列(这一步是递归调用),然后 输出以2开头的排列(又是递归调用),接着是以3开头的排列……最后才是以n开头的排 列。 以1开头的排列的特点是:第一位是1,后面是2~9的排列。根据字典序的定义,这些2 ~9的排列也必须按照字典序排列。换 阅读全文
摘要:
题目链接:https://vjudge.net/problem/UVA-10976 It is easy to see that for every fraction in the form 1k(k > 0), we can always find two positive integers x 阅读全文
摘要:
题目链接:https://vjudge.net/problem/UVA-725 Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 throug 阅读全文