Usher_Ou的博客

[UVA11059]Maximum Product[暴力] 题意：给出一个序列，问这个序列中最大连续累乘的子序列中，最大的值为多少，如果都为负数，则输出0. 代码：#include #include #include using namespace std; const int maxn = 100; long long num[maxn]; vectorv; bool cmp(lo

Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the first number divided by the second is equal to an integer N,