KylinCommander

p465

一、题目描述tack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the top position) ...

一、指针实现这题拿到手想都不想直接采用了指针实现的二叉树进行递归求解。但实际上却忽略了完全二叉树可以采用静态数组来实现的特点，代码量大大加大。在第二部分附上简便做法。#include<cstdio>#include<vector>#include<algorithm>#include<queue>#include<cmath>...

一、题目描述The K−P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K−P factorization of N for any p...

一，数据类型范围 int 占4B 补码表示的范围为 [-2^31,2^31-1] (约为-2*10^9~2*10^9这个量级) 大于int 范围考虑使用unsigne int 或 long long //输入输出格式为%lld 常见10^10这个范围的两个数相加减就可能超过int这个范围。二，scanf printf输入输出 1. printf 输出字符串的问题 prin...