F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
 Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Tangram

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 2584    Accepted Submission(s): 1086


Problem Description
一块七巧板有 7 块，现在 wls 想再在七巧板上加 $n$ 条直线将七巧板切分并且使得切出来的块最多，请问最多能有多少块？
 

Input
输入有多组（不超过 100, 000组）。
每组一行一个正整数 $n$。
0 ≤ $n$ ≤ 1, 000, 000, 000
 

Output
每组输出一行一个数代表答案。
 

Sample Input
1
 

Sample Output
13
 

Source
2019中国大学生程序设计竞赛-女生专场（重现赛）-感谢南京晓庄学院
 

Statistic | Submit | Discuss | Note
Home | Top Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-22 16:37:13, Gzip enabled 		Administration