8 UVA 10790 How Many Points of Intersection?
来源:互联网 发布:java继承 编辑:程序博客网 时间:2024/06/06 01:23
第一排第i个点和第二排第j个点相连,在这条线段上会产生(a-i)*(j-1)个交点,
以此类推,推公式即可。
#include<cstdio>#define ll long longll a,b;int cas=1;int main(){ while(~scanf("%d%d",&a,&b)&&(a||b)) printf("Case %d: %lld\n",cas++,a*(a-1)/2*b*(b-1)/2); return 0;}
0 0
- UVa 10790 How Many Points of Intersection?
- uva 10790 How Many Points of Intersection?
- uva 10790 - How Many Points of Intersection?
- uva-10790-How Many Points of Intersection?
- UVa 10790 - How Many Points of Intersection?
- Uva 10790 - How Many Points of Intersection?
- UVa 10790 - How Many Points of Intersection?
- UVA 10790 How Many Points of Intersection?
- uva 10790 - How Many Points of Intersection
- uva 10790 How Many Points of Intersection?
- UVa 10790 How Many Points of Intersection?
- uva - 10790 - How Many Points of Intersection?
- UVa 10790 - How Many Points of Intersection?
- UVa 10790 - How Many Points of Intersection?
- Uva 10790 How Many Points of Intersection?
- UVA - 10790 How Many Points of Intersection?
- UVA - 10790 How Many Points of Intersection?
- uva 10790 How Many Points of Intersection?
- How to make a ipcamera
- 深入理解java异常处理机制
- 决策树学习的特征选择
- android sdk离线安装
- Hibernate与 MyBatis的比较
- 8 UVA 10790 How Many Points of Intersection?
- 4.29总结
- 使用instancetype替代id的好处
- DNS(域名系统)
- java 拦截器、过滤器、监听器
- 如何快糙好猛地在Windows下编译CAFFE并使用其matlab和python接口
- leetcode(c++) Isomorphic Strings
- Java异常分类
- leetcode--Isomorphic Strings