UVA 11401
来源:互联网 发布:飞思卡尔单片机与pic 编辑:程序博客网 时间:2024/06/06 11:45
UVA 11401 数学题
给1到n,n个不同的数,问能组成多少三角形
打表找规律得
#include<cstdio>typedef long long ll;const int maxn = 1000100;ll a[maxn + 10];int main(){ a[3] = 0; for(int i = 4; i <= maxn; i++) a[i] = a[i-1] + (i - 2) / 2; ll n; while(scanf("%lld", &n) == 1 && n >= 3) printf("%lld\n", a[n]); return 0;}
0 0
- UVa 11401
- uva 11401
- UVa 11401
- UVA 11401
- UVA 11401 Triangle Counting
- Uva 11401 - Triangle Counting
- UVA 11401 Triangle Counting
- UVA 11401 - Triangle Counting
- UVA 11401 - Triangle Counting
- uva 11401 - Triangle Counting
- UVA - 11401 Triangle Counting
- uva 11401 数学
- UVA 11401 Triangle Counting
- UVa 11401 - Triangle Countin
- UVA - 11401 Triangle Counting
- uva 11401 Triangle Counting
- UVa 11401 Triangle Counting
- uva 11401 Triangle Counting
- CentOS6.5系统安装及LAMP环境安装(yum方式)配置详解(四)
- Jackson 框架,轻易转换JSON
- Codeforces 710 C. Magic Odd Square(构造)——Educational Codeforces Round 16
- c# 连接sqlserver
- HTML基础知识整理
- UVA 11401
- spring学习总结(二)
- Spring MVC @SessionAttributes注解
- CNTK学习笔记 -- Computation Network part 1 -- Forward and Backward Algorithm
- EasyUI学习第四篇:Layout布局
- window 下 nginx php 环境搭建
- linux下svn的安装与配置
- 用js(jQuery)获取table中对应的td中的值!
- js 中eval()函数