UVA 10090 - Marbles 题目链接 题意：有两种盒子，一种代价c1，能装n1个珠子，一种代价c2，能装n2个珠子，问如何正好装n个珠子，并且使得代价最少。 思路：利用扩展欧几里得算法求出n1∗x+n2∗y=n的一个解(x′,y′) 就可以知道x,y的通解分别为 x=x′∗n/gcd(n1,n2)+n2/gcd(n1,n2)∗t y=y′∗n/gac(n1,n2)−n1/gc

原题： The player starts with a prize of $1, and is asked a sequence of n ques- tions. For each question, he may • quit and keep his prize. • answer the question. If wrong, he quits with nothing.If