题意与做法略过,今晚事情多,懒得写详细了,代码不难,直接可以看懂
AC代码:
#include<stdio.h>
int n;
int max;
int mark = 0;
int judge1() {
mark = 0;
for(int i = 0; ; i++) {
if(i * i * i == n) {
mark = 1;
return i;
}
else if(i * i * i > n)
return i;
}
}
int judge2() {
mark = 0;
for(int i = 0; ; i++) {
if(i * (i+1) * (i+2) / 6 == n) {
mark = 1;
return i;
}
else if(i * (i+1) * (i+2) / 6 > n)
return i;
}
}
void judge(int p, int q) {
mark = 0;
max = 0;
for(int i = 0; i < p; i++) {
for(int j = 0; j < q; j++) {
int t = i * i * i + j * (j+1) * (j+2) / 6;
if(t == n) {
mark = 1;
return ;
}
else if(t < n) {
if(max <= t)
max = t;
}
}
}
}
int main() {
while(scanf("%d", &n), n != 0) {
int t1, t2;
t1 = judge1();
if(mark) {
printf("%d\n", n);
continue;
}
t2 = judge2();
if(mark) {
printf("%d\n", n);
continue;
}
judge(t1, t2);
if(mark) {
printf("%d\n", n);
continue;
}
printf("%d\n", max);
}
return 0;
}