![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
UVa—之旅
文章平均质量分 77
Dream_going
这个作者很懒,什么都没留下…
展开
-
UVa_100 3n+1
// The 3n+1 problem (3n+1 问题)// PC/UVa IDs: 110101/100, Popularity: A, Success rate: low Level: 1// Verdict: Accepted// Submission Date: 2011-05-22// UVa Run Time: 0.032s//此问题是转载// 版权所转载 2015-05-27 20:25:07 · 465 阅读 · 0 评论 -
UVa_1594Ducci_Sequence
#include #include #include #include using namespace std;const int n_min = 3;const int n_max = 15;int main(){ bool isZero(int *a, int n); int Sequene[n_max]; int T_case = 0;原创 2015-05-27 21:04:04 · 419 阅读 · 0 评论 -
UVa_136Ugly_Number
#include #include #include #include using namespace std;typedef long long LL;const int coeff[3] = { 2, 3, 5 };int main(){ set dict; priority_queue Q; int result = 0; Q.push原创 2015-05-27 22:10:02 · 384 阅读 · 0 评论 -
计算几何—Toy 叉积判断点与线段的相对位置
A - TOYSCrawling in process... Crawling failed Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Calculate t原创 2015-06-16 16:02:10 · 583 阅读 · 0 评论 -
UVA 10827 Maximum sum on a torus
题目大意求最大子矩阵的和的变形。 最大子矩阵的求解由最大子序列和变形而来。//// Created by 王若璇 on 16/2/5.//#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <vector>using namespace std;const int原创 2016-03-01 12:44:39 · 319 阅读 · 0 评论 -
UVA 787 Maximum Sub-sequence Product
Bob needs money, and since he knows you are here, he decided to gamble intelligently. The game is rather simple: each player gets a sequence of integers. The players must determine, by using their mega原创 2016-03-04 00:31:43 · 587 阅读 · 0 评论