poj
一枚软的硬币
一个想学习算法的工程。
展开
-
poj1159 java 最长公共子序列
Palindrome Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 64103 Accepted: 22347 Description A palindrome is a symmetrical string, that is, a string read ide原创 2017-08-18 13:42:43 · 352 阅读 · 0 评论 -
poj1651 java 动态规划矩阵连乘
Multiplication Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10599 Accepted: 6607 Description The multiplication puzzle is played with a row of card原创 2017-08-18 10:33:33 · 419 阅读 · 0 评论 -
poj - 1631 最长上升子序列 Java
Bridging signals Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14714 Accepted: 7969 Description 'Oh no, they've done it again', cries the chief designer原创 2017-08-17 23:22:57 · 253 阅读 · 0 评论 -
poj - 2533 最长上升子序列 Java
Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 54798 Accepted: 24552 Description A numeric sequence of ai is ordered if a1 a2原创 2017-08-17 23:18:09 · 366 阅读 · 0 评论 -
Java poj1338寻找丑数
Ugly NumbersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25826 Accepted: 11285DescriptionUgly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8,...原创 2018-03-16 10:32:58 · 331 阅读 · 0 评论 -
拓展欧几里得应用
个人小理解 求a≡bmol(l) ax + ly = b ax + ly = gcd(a,l) 这时就可以用拓展欧几里得求 ex_gcd(a,l); 求出一组解(x0,y0); 通解: X = x0 + t*(l/gcd(a,l)); Y = y0 - t*(a/gcd(a,l)); 原方程解: X = x0*b/gcd(a,l); Y = y0*b/gcd(a,l); ...原创 2018-04-02 20:03:28 · 264 阅读 · 0 评论