数学
乐哥不焦虑
这个作者很懒,什么都没留下…
展开
-
uva 571 jugs
#include int main(){ int na, nb, nDes, ca, cb; while (scanf("%d %d %d", &ca, &cb, &nDes) != EOF) { na = 0, nb = 0; while (nb != nDes) {原创 2012-07-12 23:57:14 · 483 阅读 · 0 评论 -
uva 106 Street Numbers
#include int main(){ int x1 = 3, y1 = 2; int x = x1, y = y1; for (int i = 0; i < 10; i++) { int t = x1 * x + 2 * y * y1; y = x1 * y + y1 *原创 2012-07-14 11:12:38 · 381 阅读 · 0 评论 -
UVA 10079 Pizza Cutting
第n刀最多与 n - 1条直线相交,从而增加 n 块 Pizza.#include typedef long long lld; //归纳 int main(){ int n; while (scanf("%d", &n) == 1 && (n>=0)){ printf("%lld\n", 1LL + lld(n) * lld(n+1)原创 2012-11-04 22:22:25 · 1975 阅读 · 0 评论 -
uva 10940 Throwing cards away II
我打印出了1 - 100 n = 1, ans = 1n = 2 ans = 2n = 3 ans = 2n = 4 ans = 4n = 5 ans = 2n = 6 ans = 4n = 7 ans = 6n = 8 ans = 8n = 9 ans = 2n = 10 ans = 4n = 11 ans = 6n = 12 ans = 8原创 2012-11-07 19:02:23 · 1720 阅读 · 0 评论 -
uva 10277 Boastin' Red Socks
#include #include #include #include using namespace std;typedef long long lld;lld gcd(lld a, lld b){ return b == 0? a:gcd(b, a%b);} int main(){ lld p, q; while (scanf("%lld %原创 2012-11-10 16:42:37 · 1950 阅读 · 0 评论 -
UVA 11027 Palindromic Permutation
#include #include #include #include #include using namespace std;int n; char str[50];char ans[50]; string half; int num[30]; int len;int mid; int cantor[16]; void init(int n){ ca原创 2012-11-10 16:08:08 · 1854 阅读 · 0 评论 -
uva 11181 Probability|Given
递归边界没处理好,切记,。#include #include #include #include using namespace std;typedef long long lld;lld gcd(lld a, lld b){ return b == 0? a:gcd(b, a%b);} int main(){ lld p, q; w原创 2012-11-10 16:48:53 · 2026 阅读 · 0 评论