Skip to content

11200: 【原1200】PerfectSquare

题目

题目描述

author: Yan Liu 原OJ链接:https://acm.sjtu.edu.cn/OnlineJudge-old/problem/1200

Description

The homework disturbs LL now:

"Consider 20 blue segments (0, i)-(N-1, i) and (i, 0)-(i, N-1) for i = 0, 1, ..., N-1. They form a matrix of N × N unit squares. A square is a perfect square if it has four blue edges. How many pairs of perfect squares (A,B) can you find such that A and B are disjoint? (Two squares are disjoint if they do not share any interior points.)"

Can you help LL to solve this problems disturbing him long long time?

Input Format

Input has one line, contains one integer N (2<=N<=100).

Output Format

Output should have one line containing one integer R, which indicates the number of pairs of perfect squares (A,B)

Sample Input

9

Sample Output

52008

Case Limits

Time limit: 500 msec

Memory limit: 64 MB

Oops! 本题目还没有解答!

助教老师们编题的速度,已经超过了解题的速度!

OJ翻了一新,但本解答集还大多用的是2017-2019级,甚至更早的同学们贡献的答案。

如果你已经AC了,可以的话,请您参考添加页面,与大家一起分享你的题解!