Codeforces1064A——Make a triangle!
给三条边，判断须要多少次操做才能使得构成三角形，每一次操做为将每条边加1web 对边排序一下，而后由于两边和（短边）大于第三边，因此判断一下就能够了svg 代码：spa #include <cstdio>
#include <algorithm>
using namespace std;
int a[3];
int main(void){
scanf("%d%d%d",&a[0],&a[1
相关文章
- 1. POJ 2986 A Triangle and a Circle
- 2. Codeforces A. Ichihime and Triangle
- 3. Life of a triangle - NVIDIA's logical pipeline
- 4. A Simple make file tutorial
- 5. Make a simple custom EventEmitter
- 6. make a Chinese study route
- 7. CF962C Make a Square(BFS)
- 8. 论文阅读笔记：A Fast Triangle-Triangle Intersection Test
- 9. Triangle
- 10. Make a DAC with a microcontroller's PWM timer
- 更多相关文章...
- • C# 多态性 - C#教程
- • Git 查看提交历史 - Git 教程
- • RxJava操作符（一）Creating Observables
- • Kotlin学习（二）基本类型
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. POJ 2986 A Triangle and a Circle
- 2. Codeforces A. Ichihime and Triangle
- 3. Life of a triangle - NVIDIA's logical pipeline
- 4. A Simple make file tutorial
- 5. Make a simple custom EventEmitter
- 6. make a Chinese study route
- 7. CF962C Make a Square(BFS)
- 8. 论文阅读笔记：A Fast Triangle-Triangle Intersection Test
- 9. Triangle
- 10. Make a DAC with a microcontroller's PWM timer