// The sum of 1+(1-2)+(1-2+3)+(1-2+3-n)... where even integers are -k and odd integers are +k.
#include <stdio.h>
int ancho(int n)
{
int sum=0;
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=i; ++j)
{
sum += (2*(j%2)-1)*j;
}
}
return sum;
}
int main(void)
{
int n = 5;
printf("Solution is %d\n", ancho
(n
)); }
// Solution is 0 for n = 5,
// because: 1 + (1-2) + (1-2+3) + (1-2+3-4) + (1-2+3-4+5) =
// 1-1+2-2+3 =
Ly8gVGhlIHN1bSBvZiAxKygxLTIpKygxLTIrMykrKDEtMiszLW4pLi4uIHdoZXJlIGV2ZW4gaW50ZWdlcnMgYXJlIC1rIGFuZCBvZGQgaW50ZWdlcnMgYXJlICtrLgojaW5jbHVkZSA8c3RkaW8uaD4KCmludCBhbmNobyhpbnQgbikKewoJaW50IHN1bT0wOwoJZm9yKGludCBpPTE7IGk8PW47ICsraSkKCXsKCQlmb3IoaW50IGo9MTsgajw9aTsgKytqKQoJCXsKCQkJc3VtICs9ICgyKihqJTIpLTEpKmo7CgkJfQoJfQoJcmV0dXJuIHN1bTsKfQoKaW50IG1haW4odm9pZCkKewoJaW50IG4gPSA1OwoJCglwcmludGYoIlNvbHV0aW9uIGlzICVkXG4iLCBhbmNobyhuKSk7Cn0KCi8vIFNvbHV0aW9uIGlzIDAgZm9yIG4gPSA1LCAKLy8gYmVjYXVzZTogMSArICgxLTIpICsgKDEtMiszKSArICgxLTIrMy00KSArICgxLTIrMy00KzUpID0gCi8vIDEtMSsyLTIrMyA9IA==