uva 10790(数学)
2014-07-16 17:25
190 查看
题解:找规律。
#include <iostream> #include <cstdio> using namespace std; int main() { long long int a, b, t = 1; long long int ans; while (scanf("%lld%lld", &a, &b) && (a || b)) { ans = (b * (b - 1) / 2) * (a * (a - 1) / 2); printf("Case %lld: %lld\n", t++, ans); } return 0; }
相关文章推荐
- UVA 10790 How Many Points of Intersection? 简单数学题
- uva 10790 How Many Points of Intersection?(数学)
- UVA 10790 (暑假-数学(3)-A - How Many Points of Intersection?)
- UVA 10790 - How Many Points of Intersection(数学)
- uva 11889 Benefit(数学)
- UVa 10382 Watering Grass (区间覆盖贪心问题+数学)
- UVA 11609 (组合数学)
- UVa 11384 Help is needed for Dexter (数学)
- uva 10061(数学)
- uva 10790 How Many Points of Intersection?
- UVa 10892 - LCM Cardinality (因式分解 组合数学)
- UVa 11076 - Add Again (排列之和 组合数学)
- uva11044(数学)
- uva 11461 数学
- UVA 12901 Refraction 数学
- uva 10790 How Many Points of Intersection?
- UVA 11401 - Triangle Counting (数学题)
- uva 467 - Synching Signals(暴力+数学)
- UVA11609 - Teams(组合数学+快速幂)
- 数学专项permutation:UVa 306