ZOJ3935
来源:互联网 发布:河南雪城软件 编辑:程序博客网 时间:2024/05/17 09:05
Description
In mathematics, a polygonal number is a number represented as dots or pebbles arranged in the shape of a regular polygon. The dots are thought of as alphas (units). These are one type of 2-dimensional figurate numbers. The following picture shows how triangular numbers, square numbers, pentagonal numbers and hexagonal numbers represented as dots arranged in the shape of corresponding regular polygon.
2016 is not only a leap year but also a triangular and hexagonal year. If you are patient enough, you can count the number of the dots in the left triangle or in the right hexagon in the following picture. The number of dots in each shape is 2016.
Therefore, 2016 is a triangular-hexagonal-leap year. The previous triangular-hexagonal-leap year is 1540 and the next is 2556. So living to see 2016 is very rare experience.
You task is to list the triangular-hexagonal-leap years from 2016 to 990528. 990528 is also a triangular-hexagonal-leap year.
Input
This problem has no input.
Output
Please print each triangular-hexagonal-leap year in increasing order.
For example, if you are asked to list the triangular-hexagonal-leap years from 780 to 2556, the output should be:
7801128154020162556
Sample Output
20162556... <-- some lines are skipped990528
AC 的代码
#include<iostream>#include<stdio.h>using namespace std;int main(){ int i,j; int flag; for(i=2016; i<=990528; i++) { if(i%400==0||(i%4==0&&i%100!=0)) { for(j=32; j<=995; j++) { if(j*(2*j-1)==i) { for(int k=j; k>=32; k++) { if(k*(k+1)/2==i) { printf("%d\n",i); break; } } } } } } return 0;}
- ZOJ3935
- 【ZOJ3935 The 16th Zhejiang University Programming ContestI】【暴力 水题】2016 找寻triangular-hexagonal-leap y
- pycharm 导入contrail-fabric-utils出现很多unresolved reference
- hibernate注解
- 主题选择器分析----5.1
- UIUItextfield输入类似银行卡号需要每四位加一个空格的实现
- Sublime Text3显示空格
- ZOJ3935
- 三轴陀螺仪与加速度计如何辅助 iPhone 定位的
- Android启动画面翻转
- JAVA基础重点难点笔记
- JDBC写数据到文件中再Copy到postgresql中
- 1009. Product of Polynomials (25)
- 随笔
- C++中的四种强制类型的转换
- LeetCode *** 173. Binary Search Tree Iterator