Данный отчёт сгенерирован 10.02.2023 18:21:31 UTC.
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
Задача: Знакозмінна сума
10.02.2023 18:21:31
Описание: Задано ціле число n. Знайти знакозмінну суму 1 - 2 + 3 - 4 + 5 - 6 + ... - n.
Для цього оголосіть функцію xsum(n).
10.02.2023 18:21:31
Решений: 170
10.02.2023 18:21:31
Знакозмінна сума
10.02.2023 18:21:31
function xsum(n) {
let i=1;
let sum=0;
while (i<=n){
if(sum<=0)
sum+=i;
else
sum-=i;
i++;
}
return(sum);
}
function xsum(n){
let s = 0;
if(n>1){
if(n % 2 == 0)
s = (-1)*(n/2);
else
s = (-1)*((n-1)/2) + n;
}
else
s = 1;
return s;
}
function xsum(n) {
let i = 1
let sum = 0
while (i <= n) {
if (i % 2 == 0) {
sum -= i
} else {
sum += i
}
i += 1
}
return sum
}
function xsum(n) {
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
function xsum (n) {
let i = 0;
let xsum = 0;
while (i <= n) {
if (i % 2) {
xsum += i;
}
else {
xsum -= i;
}
i++;
}
return (xsum)
}
function xsum(n) {
if (n%2!=0) {
return (n+1)/2;
} else {
return -n/2;
}
}
function xsum(n) {
let sum = 0;
for(let i = 1; i <= n; i++)
{
sum += i % 2 == 1? i : i * -1;
}
return sum;
}
function xsum(n)
{
let i =2;
let sum =1;
while(i<=n)
{
if(i%2==0)
sum -=i;
else
sum +=i;
i++;
}
return sum;
}
function xsum(n)
{
if (n % 2 != 0)
{
return (n + 1) / 2;
}
else
{
return -n / 2;
}
}
function xsum(n) {
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
function xsum(n) {
let sum = 1
if (n > 1)
for (let i = 2; i <= n; i++) {
if (i % 2 == 0)
sum -= i
else
sum += i
}
return sum
}
function xsum(n){
let sum = 0;
for(let i = 0; i <= n; i++){
if(i % 2 == 0){
sum -= i;
}
else{
sum += i;
}
}
return sum;
}
function xsum(n)
{
let sum = 0;
for (let i = 1; i <= n; i++)
{
if (i % 2 != 0)
sum += i;
else
sum -= i;
}
return sum;
}
function xsum(n)
{
let count = 2;
let sum = 1;
while (count <= n)
{
if (count % 2 != 0)
sum += count;
else
sum -= count;
count++;
}
return sum;
}
function xsum ( n ) {
let i = 0;
let xsum = 0;
while (i <= n ) {
if ( i % 2 ) {
xsum += i;
}
else {
xsum -= i;
}
i++;
}
return ( xsum )
}
function xsum(n){
let sum =0;
for(let i =0;i <= n;i++){
if(i % 2 == 0){
sum+=i*(-1)
}
else
sum+=i;
}
return sum;
}
function xsum(n){
if (n%2==0){
return n*(-1)/2
}
else {
return ((n-1)/2)*(-1) + n
}
}
function xsum(n) {
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
function xsum(n) {
let sum = 0;
let cur = 1;
while (cur <= n) {
if (cur % 2 == 0) {
sum -= cur;
} else {
sum += cur;
}
cur++
}
return sum;
}
function xsum (n) {
if (n%2 !== 0) {
return (n+1)/2;
}
else {
return -n/2;
}
}
function xsum(n)
{
let res = 0;
for(let i = 0; i <= n; i++)
res = i % 2 == 0? res - i : res + i;
return res;
}
function xsum(n){
let result = 0;
for(let i = 1; i <= n; i++)
if(i%2 != 0)
result += i
else
result -= i
return result;
}
function xsum(n)
{
let i=1;
let xsum=0;
let c;
let d;
while (i<=n)
{
c=Math.pow((-1),(i+1));
d=c*i;
i+=1;
xsum+=d;
}
return xsum
}
function xsum(n){
let b=0
for(i=1;i<=n;i++){
if(i%2!=0){
b=b+i
}
else{
b=b-i
}
}
return b;
}
function xsum(n) {
let result = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 === 0) {
result -= i;
} else {
result += i;
}
}
return result;
}
function xsum(n) {
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
function xsum(n) {
if (n%2!=0) {
return (n+1)/2;
} else {
return -n/2;
}
}
function xsum(n) {
let i = 0;
let sum = 0;
while (i <= n) {
if (i % 2) {
sum += i;
} else{
sum -= i;
}
i++;
}
return sum
}
function xsum(n){
let s = 0;
for(let i = 1; i <= n; i++) {
if (i % 2 != 0)
s+=i;
else
s-=i;
}
return s;
}
function xsum(n){
let sum = 0;
for(let i = 1; i <= n; i++){
if(i % 2 == 0){
sum += (i * (-1));
} else {
sum += i;
}
}
return sum;
}
10-4
function xsum(n) {
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
function xsum(n)
{
let sum = 0;
let i = 1;
while(i <= n)
{
if(i % 2 == 0)
sum -= i;
if(i % 2 == 1)
sum += i;
i++;
}
return sum;
}
function xsum(n){
let xsum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0){
xsum -= i;
}
else{
xsum += i
}
}
return xsum;
}
function xsum(n)
{
let k=0;
for (let i=1; i<=n;i++){
if (i%2==0)
k-=i;
else
k+=i;
}
return k;
}
function xsum(n) {
let sum=0
while(n) {
if (n%2==0) {sum-=n}
else {sum+=n}
n--
}
return sum
}
function xsum(n)
{
let sum = 0;
for(i=1; i<=n;i++){
if(i%2==0)
sum-=i;
else
sum+=i;
}
return sum;
}
function xsum(n){
let sum = 0
let i = 1
do {
if(i%2 != 0){
sum += i
}
if(i%2 == 0){
sum -= i
}
i++
} while(i <= n);
return sum
}
function xsum(n) {
let sum = 0;
for (let i = 0; i <= n; i++) {
sum += Math.pow(-1, i-1) * i;
}
return sum;
}
function xsum(n) {
if (n%2 !== 0) {
return (n+1) /2;
} else {
return -n/2
}
}
function xsum(n){
let sum;
if(n%2==0) sum=-1*(n/2);
else sum=-1*((n-1)/2)+n;
return sum;
}
function xsum(n){
if(n % 2 !== 0){
return (n + 1) / 2;
}else{
return -n / 2
}
}
function xsum(n){
let factor=1
let sum=0
for(let i=1; i<=n; i++){
sum+=i*factor
factor*=-1
}
return sum
}
function xsum(n) {
let sum = 0;
for ( let i = 1; i <= n ; i++){
if ( i % 2 !== 0){
sum += i;
}
if ( i % 2 == 0){
sum -= i;
}
}
return sum;
}
function xsum(n) {
let p = 1, i = 1, sum = 0;
while (i <= n) {
sum += p * i;
p *= -1;
i++;
}
return sum;
}
function xsum(n) {
let num = 1;
let res = 0;
for (let i = 0; i <= n; i++) {
num *= -1;
res += i*num;
}
return res
}
function xsum(n)
{
let i=1
let s=0
while(i<=n)
{
s=s+i*((-1)**(i+1))
i=i+1
}
return(s)
}
function xsum(n) {
let sum = 0;
for (let i = 1; i <= n; i++) {
sum += (i % 2 === 0) ? -i : i;
}
return sum;
}
let result = xsum(10);
console.log(result);
function xsum(n) {
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
function xsum(n){
let sum=0;
for (let i=1; i<=n; i++){
sum+=Math.pow(-1, i-1)*i;
}
return sum;
}
function xsum(n){
let sum = 0;
let dif = 0;
for(let i = 1; i <= n; i += 2)
sum += i;
for(let j = 2; j <= n; j += 2)
dif -= j;
return sum + dif
}
function xsum(n)
{
let sum = 0;
for(let i = 1; i <= n; i++)
{
if(i % 2 == 0)
{
sum += (i * (-1));
}
else
{
sum += i;
}
}
return sum;
}
function xsum(n)
{
let sum = 0;
for(let i = 1; i <= n; i++)
{
if(i % 2 == 0)
{
sum += (i * (-1));
}
else
{
sum += i;
}
}
return sum;
}
function xsum(n){
let index = 1;
let xsum = 0;
let degrees = 0;
while(index <= n){
degrees = index % 2;
xsum = xsum + (index * ((-1)**(degrees + 1)));
index++;
}
return xsum;
}
function xsum(n){
let sum = 0;
for(let i = 1; i<=n; i+=2){
sum+=i-i-1;
}
if(n%2){
sum+=n+1;
}
return sum;
}
function xsum(n) {
let i = 1
let sum = 0
while (i <= n) {
sum += i
i++
while (i <= n) {
sum -= i
i++
break
}
}
return sum
}
function xsum(n) {
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) sum -= i;
else sum += i;
}
return sum;
}
function xsum(n){
var sum =0;
for(var x =1 ;x<=n; x++){
if (x%2==0){
sum=sum-x;
}
else{
sum=sum+x;
}
}
return sum;
}
function xsum(n) {
if (n % 2 != 0) {
return ((n + 1) / 2)
}
else
return (-n / 2)
}
console.log (xsum(5))
function xsum(n)
{
let counter = n;
let sum = 2;
while(counter>0)
{
if (counter%2 == 0)
{
sum -= counter;
}
else
{
sum += counter;
}
counter--
}
sum -=2;
return sum;
}
function xsum(n)
{
let sum = 0;
let i = 1;
let x = -2;
while (i <= n)
{
sum += i;
i += 2;
}
while (x >= -n)
{
sum += x;
x -= 2;
}
return sum;
}
function xsum(n)
{
let k = -1;
let sum = 0;
for (let i = 1; i <= n; i++)
{
k*=-1;
sum += i * k;
}
return(sum);
}
function xsum(n) {
if (n%2!=0) {
return (n+1)/2;
} else {
return -n/2;
}
}
function xsum(n) {
let sum = 0;
for(let i = 1; i <= n; i++) {
if(i % 2 == 0) {
sum += (i * (-1));
}
else {
sum += i;
}
}
return sum;
}
function xsum(n){
let i = 0;
let xsum=0;
while (i <=n){
if (i%2){
xsum += i
}else{
xsum -= i
}
i++
}
return xsum
}
function xsum(n)
{
let a
let c
if ( n % 2 == 0 ){
return - n / 2
}
else{
return Math.floor( n / 2 ) + 1
}
}
function xsum(n) {
let sum = 0;
let p = 1;
for(i = 1; i <= n; i++) {
sum += p * i;
p *= -1;
}
return sum;
}
function xsum(n) {
let i = 2;
let sum = 1;
let t = -1;
while (i <= n) {
sum += i * t
t *= -1
i++
}
return sum;
}
function xsum(n) {
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
function xsum(n)
{
let res = 0;
for(let i = 0; i <= n; i++)
if(i % 2 == 0)
res -= i
else
res += i;
return res;
}
function xsum(n)
{
if (n%2==0)
return n*(-1)/2
else
return ((n-1)/2)*(-1) + n
}
function xsum(n) {
let clni = 0;
for (let i = 1; i<=n; i++) {
if (i%2==0) {
clni+=-i;
} else clni+=i;
}
return clni;
}
function xsum(n) {
let sum = 0;
for(let i = 1; i<=n; i++){
if(i%2 === 0){
sum -= i;
}
else{
sum += i;
}
}
return sum
}
function xsum(n){
let b=0
for(i=1;i<=n;i++){
if(i%2!=0){
b=b+i
}
else{
b=b-i
}
}
return b;
}
function xsum(n){
let sum = 0
while (n != 0)
if (n % 2 == 0){
sum -= n
n -= 1}
else if (n % 2 == 1){
sum += n
n -= 1}
return (sum)
}
function xsum(n)
{
let i = 0;
let sum = 0;
while (i <= n){
if (i % 2 != 0)
sum += i;
else
sum -= i;
i++;
}
return sum;
}
function xsum(n)
{
let sum = 0
for(let i = 1; i <= n; i++)
{
if ( i % 2 == 0)
{
sum += (i * (-1));
}
else
{
sum += i;
}
}
return sum;
}
function xsum(n){
let res = 0
for(i=1; i<=n; i++){
if(i%2==0)
res -= i
else res += i
}
return res;
}
function xsum(n){
if(n%2==0){
return n/2*(-1)
}
else return (n-1)/2*(-1)+n
}
function xsum(n){
let sum = 0;
for (let i = 0; i <= n; i++) {
if(i % 2 == 0) {
sum -= i
} else {
sum += i
}
}
return sum
}
function xsum(n){
let i = 0;
let xsum=0;
while (i <=n){
if (i%2){
xsum += i
}else{
xsum -= i
}
i++
}
return xsum
}
function xsum(n){
let answ = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0){
answ -=i;
}
else {
answ += i;
}
}
return answ;
}
function xsum(n){
let xsum = 0
for (let i=1; i<=n; i++){
xsum += (((-1)**(i+1)) * i)
}
return xsum
}
function xsum(n)
{
let i = 1;
let g = 2;
while(g <= n)
{
i = i - g;
g++;
if (g <= n)
{
i = i + g;
g++;
}
}
return i;
}
function xsum(n) {
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
function xsum(n) {
let sum = 0;
for(let i = 1; i <= n; i += 2) {
sum += i;
}
for(let i = 2; i <= n; i += 2) {
sum -= i;
}
return sum;
}
function xsum(n) {
let result = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 == 0) {
result -= i
}
else if (i % 2 !== 0) {
result += i
}
}
return result
}
function xsum(n){
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 !=0){
sum += i;
}else {
sum -= i;
}
}
return sum;
}
function xsum(n) {
let sum = 0
for (let i = 1; i <= n; i++) {
if (i % 2 === 0) sum -= i
else sum += i
}
return sum
}
function xsum(n){
let i = 1;
let sum = 0;
let degree = 0;
while(i <= n){
degree = i % 2;
sum = sum + (i * ((-1)**(degree + 1)));
i++;
}
return sum;
}
function xsum(n){
let sum = 0
let i = 0
let m = n
if (n % 2 == 0){
while(i < m / 2){
sum += (n - 1) - n
n -= 2
i++
}
}
if (n % 2 != 0){
while(i < m / 2){
sum -= n - (n + 1)
n -= 2
i++
}
}
return sum
}
function xsum(n){
if (n%2 !==0){
return (n+1)/2;
}
else {
return (-n/2);
}
}
function xsum(n)
{
let res=0;
let znak=1;
for(i=1;i<=n;i++)
{
res+=i*znak;
znak*=-1;
}
return res;
}
function xsum(n) {
let sum = (Math.pow(-1,n-1) * (2 * n + 1) + 1)/4
return sum;
}
console.log(xsum(2))
function xsum(n) {
let sum = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 == 1) {
sum += i;
}
else {
sum -= i;
}
}
return sum;
}
function xsum(n){
let answ = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0){
answ -= i;
}
else{
answ += i;
}
}
return answ;
}
function xsum(n){
let sum = 0;
for(let i =1;i<=n;i++){
if(i%2==0){sum-=i;}
else{sum+=i;}
}
return sum;
}
console.log(xsum(2));
function xsum (n)
{
let i=0;
let sum=0;
while (i<=n)
{
if (i%2==0)
{
sum-=i;
}
else {
sum+=i;
}
i++;
}
return sum;
}
function xsum(n)
{
let sum1 = 0;
for(let i = 1; i <= n; i += 2)
{
sum1 += i;
}
let sum2 = 0;
for(let j = 0; j >= -n; j -= 2)
{
sum2 += j;
}
let sum = sum1 + sum2;
return sum;
}
function xsum(n)
{
let sum = 0
for(let i=1 ; i<=n ; i++)
{
if (i % 2 == 0)
{
sum += (i * (-1))
}
else
{
sum += i
}
}
return sum
}
function xsum(n){
let i=1;
let s=0;
while (i<=n){
s+=(-1)**(i+1)*i;
i++;
}
return s;
}
function xsum(n){
let sum=0;
for(let i=0;i<=n;i++){
if(i%2==0){
sum+=i*(-1)
}
else{
sum+=i
}
}
return sum;
}
function xsum(n){
if(n % 2 == 0){
return -(n / 2);
}else{
return n - ((n - 1) / 2);
}
}
let sum ;
function xsum(n){
let i = 0 ;
let sum = 0;
while (i <= n)
{
if (i % 2 == 1)
{
sum += i;
i = i + 1 ;
}
else
{
sum += i * -1 ;
i = i + 1;
}
}
return sum
}
function xsum(n)
{
let sum = 0;
for (let i=1; i<=n; i++)
{
if (i%2!=0)
{
sum+=i;
}
else
{
sum-=i;
}
}
return sum;
}
function xsum(n) {
let a = 0;
let b = 1;
for(let i = 1; i<=n; i++) {
a += i*b;
b *= -1;
}
return a;
}
function xsum(n) {
let sum = 1, i = 2;
while (i <= n){
sum += i * Math.pow((-1), i - 1);
i++;
}
return sum;
}
function xsum(n){
let xsum = 0;
for(let i = 1; i <= n; i++){
if (i % 2 == 0){
xsum -= i;
}else{
xsum += i;
}
}
return xsum;
}
function xsum(n){
let plus = true
let sum = 0
for(let i = 1; i <= n; i++){
if(plus){
sum += i
plus = false
}
else{
sum-= i
plus = true
}
}
return sum
}
function xsum(n){
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) {
sum -= i;
} else {
sum += i;
}
}
return sum;
}
function xsum(n){
let sum = 0;
let j = 1
for(let i = 1;i<=n;i++,j*=(-1)){
sum += i*j;
}
return sum;
}
function xsum(n) {
let k = 1;
for (let i = 1; i k+=((-1)**i)*(i+1)
}
return k
}
function xsum(n) {
let sum = 0;
for(let i = 1; i <= n; i++){
if( i % 2 == 0){
sum += (i * (-1));
}
else{
sum += i;
}
}
return sum;
}
function xsum(n){
let y = 0
for (let i = 0; i <= n; i++){
if (i % 2 === 0){
y-=i
}
else {
y+=i
}
}
return y
}
function xsum(n)
{
if(n%2 == 0)
return -n/2
else
return Math.ceil(n/2)
}
function xsum(n) {
if(n % 2 == 0)
return -n/2;
return (n + 1)/2;
}
function xsum(n)
{
let a = 0
for(let i = 1; i <= n; i++)
{
if (i%2==0)
{
a -= i
}
if (i%2!=0)
{
a += i
}
}
return a
}
console.log(xsum(1)); // 1
function xsum(n){
let sum = 0;
let i = 1;
while (i <= n){
if (i%2 == 1){
sum += i;
} else{
sum-= i;
}
i += 1;
}
return sum;
}
function xsum(n)
{
let sum = 0;
for(let i = 1; i <= n; i ++)
if(i % 2 == 0)
{
sum -= i;
}
else
{
sum += i;
}
return sum;
}
function xsum(n){
let i = 0;let sum = 0;let t = 1
while (i <= n){
t *= -1
sum += (i * t)
i += 1
}
return (sum)
}
function xsum(n){
let sum = 1;
let a = 2;
for (let i = 2; i <= n; i++){
if (i % 2 == 0){
sum -= a;
}
else{
sum += a;
}
a++;
}
return sum;
}
function xsum(n)
{
let res = 0;
for (let i = 1; i <= n; i++) res += i * (-1)**(i+1);
return res;
}
function xsum(n){
let sum = 0
for(i = 1; i <= n; i = i + 2){
sum = sum + i
if (i+1<=n) sum = sum - (i + 1)
}
return sum
}
function xsum(n) {
let sum = 0;
while (n!=0) {
if (n%2==0){
sum-=n;
n-=1;
}
else if (n%2==1) {
sum+=n;
n-=1;
}
}
return (sum);
}
function xsum(n){
let res = 0;
for(let i = 1;i<= n;i++){
if(i % 2 == 0){
res -= i;
}else{
res +=i;
}
}
return res;
}
function xsum(n){
let sum = 0
for(let i = 1; i<= n; i++){
if(i%2 == 0){
sum += (i*(-1));
}
else
{
sum += i;
}
}
return sum
}
function xsum(n) {
let sum = 0;
let a = 1;
while(a <= n) {
if (a % 2 != 0)
sum += a;
else
sum -= a;
a += 1;
}
return sum;
}
function xsum(n){
let k = 1
let m = 1
for( let i = 1; i < n; i++){
if (i % 2 !== 0){
k = k - (i + m)
}else if (i % 2 == 0){
k = k + (i + m)
}
}return(k)
}
function xsum(n) {
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
function xsum(n) {
if (n%2 !==0){
return (n+1)/2;
}else{
return -n / 2
}
}
function xsum(n){
let sum = 0;
for(let i=1; i<=n; i++){
if (i % 2 == 0)
{
sum -= i;
}
else
{
sum += i;
}
}
return sum;
}
function xsum(n)
{
let b = 0
for (let a = 1; a <= n; a++)
{
if (a % 2 != 0)
{
b += a
}
else
{
b -= a
}
}
return b
}
function xsum(n) {
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) sum -= i;
else sum += i;
}
return sum;
}
function xsum(n){
let sum = 0;
for(let i=1; i<=n ; i++)
{
if (i % 2 == 0) {
sum -= (i)
} else {
sum += (i)
}
}
return sum
}
function xsum(n){
let i=0, a=1, b=1
while (a <= n) {
i += a*b;
++a;
b *= (-1);
}
return i;
}
function xsum(n) {
let sum = 0
while (n!=0) {
if (n % 2 == 0) {
sum -= n
n -= 1
}
else if (n % 2 == 1) {
sum +=n
n -= 1
}
}
return sum
}
function xsum(n){
let result = 1
let counter = 1
for (let i = 2; i<=n; i++){
if (counter % 2 == 0){
result += i
}
else{
result -= i
}
counter++
}
return result
}
function xsum(n)
{
if ( n %2 == 0 )
{
return n * ( -1 ) / 2;
}
else
{
return (( n - 1) / 2 ) * (-1) + n;
}
}
function xsum(n){
let sum = 0;
for(let i = 1; i <= n; i ++){
if (i%2 === 0){
sum -= i;
}
else {
sum += i;
}
}
return sum;
}
function xsum(n){
let res = 0;
for(let i=1;i<=n;i++){
if(i%2==0){
res -= i;
}
else{
res +=i;
}
}
return(res);
}
function xsum(n) {
if (n % 2 == 0) return (- n / 2)
else return (n + 1) / 2
}
function xsum(n) {
let sum = 0;
let i = 0;
while (i < n) {
i += 1;
sum += i % 2 ? i : -i
}
return sum;
}
function xsum(n) {
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
function xsum(n){
let sum = 0;
for(let i = 1; i<=n; i++){
if((i % 2) == 0){
sum -= i;
}
if((i % 2) == 1 ){
sum += i;
}
}
n = sum;
return n;
}
function xsum(n){
if (n % 2 !== 0){
return (n + 1)/2;
}
else{
return -n / 2;
}
}
function xsum(n){
let a = 1
let sum = 0
for(let i = 0;i < n; i++){
sum += a * ((-1) ** i)
a++
}
return sum
}
function xsum(n)
{
let sum = 0;
let op = 1;
for(let i = 1; i <= n; i++)
{
sum += i * op;
op = -op;
}
return sum;
}
function xsum(n)
{
let sum = 0;
for (let i = 1; i <= n; i++)
{
if (i % 2 == 0)
sum += (i * (-1));
else
sum += i;
}
return sum;
}
const xsum = n => new Array(n + 1).fill(0).reduce((a, _, i) => i % 2 ? a + i : a - i)
function xsum(n)
{
var sum = 0;
for(var i = 1; i <= n; i++)
sum += Math.pow(-1, i-1) * i;
return sum;
}
function xsum(n){
let sum = 0;
for(let i = 1; i <= n; i++) {
sum += i % 2 ? +i : -i;
}
return sum;
}
function xsum(n)
{
let sum=0;
for (let i=1;i<=n;i++)
{
if (i%2==0)
sum = sum - i;
else sum=sum+i;
}
return sum;
}
function xsum(n){
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) sum -= i;
else sum += i;
}
return sum;
}
function xsum(n){
let sum = 0;
for(let i = 1; i <= n; i++)
sum += i % 2 ? i : -i;
return sum;
}
function xsum (n){
let sum = 0;
for( let i = 1; i <= n; i++){
if (i % 2 == 0){
sum +=(i *(-1));
}
else{
sum +=i;
}
}
return sum;
}
function xsum(n) {
if (n%2 !==0){
return (n+1)/2;
}else{
return -n / 2
}
}
function xsum(n) {
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
function xsum(n){
let sum = 0;
for(let i = 1; i <= n; i++){
sum += i*((-1)**(1+i))
}
return sum;
}
function xsum(n)
{
r = 0;
for(let i = 1; i <= n; i++)
{
r += i * ((i%2 == 1) ? 1: -1);
}
return r;
}
function xsum(n) {
let sum = 0;
for(let i = 1; i <= n; i++) {
if (i % 2 == 0)
sum -= i;
else
sum += i;
}
return sum;
}
function xsum(n) {
return n % 2 == 1 ? (n - 1) / 2 + 1: n / 2 * -1;
}
function xsum ( n ) {
let i = 0;
let xsum = 0;
while (i <= n ) {
if ( i % 2 ) {
xsum += i;
}
else {
xsum -= i;
}
i++;
}
return ( xsum )
}
function xsum(n) {
let sum = 0;
for(let i = 0; i <= n; i++)
if (i % 2 == 0) sum -= i;
else sum += i;
return sum;
}
function xsum(n)
{
let sum = 0;
let addictional = 1
for(let i = 1;i<=n;i++)
{
if (i % 2 == 0)
{
addictional = -1;
}
else
{
addictional = 1;
}
sum += (i * addictional);
}
return sum;
}
function xsum(n){
let i = 0;
let xsum = 0;
while (i<=n)
{
if (i%2){
xsum = xsum + i;
}
else {
xsum = xsum - i;
}
i++
}
return xsum
}
function xsum(n) {
let result = 0;
for (let i = 1; i <= n; i += 2) result += i;
for (let i = 2; i <= n; i += 2) result -= i;
return result;
}
function xsum(n){
let res = 0, m;
for (let i = 1; i <= n + 1; i++) {
m = 1
if (i % 2) m = -1;
res += (i - 1) * m;
}
return res
}
function xsum(n) {
let sum = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 == 0)
sum -= i;
else
sum += i
}
return sum;
}
function xsum(n) {
if (n%2 !==0){
return (n+1)/2;
}else{
return -n / 2
}
}
function xsum (n)
{
let i = 0;
let result = 0;
for (i = 0; i <= n; i++)
{
if ( i % 2 )
{
result += i;
}
else
{
result -= i;
}
}
return (result)
}
function xsum(n)
{
let i=1;
let xsum=0;
let c;
let d;
while (i<=n)
{
c=Math.pow((-1),(i+1));
d=c*i;
i+=1;
xsum+=d;
}
return xsum
}
let i=1;
let sum=0;
while (i<=n){
if(sum<=0)
sum+=i;
else
sum-=i;
i++;
}
return(sum);
}
let s = 0;
if(n>1){
if(n % 2 == 0)
s = (-1)*(n/2);
else
s = (-1)*((n-1)/2) + n;
}
else
s = 1;
return s;
}
let i = 1
let sum = 0
while (i <= n) {
if (i % 2 == 0) {
sum -= i
} else {
sum += i
}
i += 1
}
return sum
}
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
let i = 0;
let xsum = 0;
while (i <= n) {
if (i % 2) {
xsum += i;
}
else {
xsum -= i;
}
i++;
}
return (xsum)
}
if (n%2!=0) {
return (n+1)/2;
} else {
return -n/2;
}
}
let sum = 0;
for(let i = 1; i <= n; i++)
{
sum += i % 2 == 1? i : i * -1;
}
return sum;
}
{
let i =2;
let sum =1;
while(i<=n)
{
if(i%2==0)
sum -=i;
else
sum +=i;
i++;
}
return sum;
}
{
if (n % 2 != 0)
{
return (n + 1) / 2;
}
else
{
return -n / 2;
}
}
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
let sum = 1
if (n > 1)
for (let i = 2; i <= n; i++) {
if (i % 2 == 0)
sum -= i
else
sum += i
}
return sum
}
let sum = 0;
for(let i = 0; i <= n; i++){
if(i % 2 == 0){
sum -= i;
}
else{
sum += i;
}
}
return sum;
}
{
let sum = 0;
for (let i = 1; i <= n; i++)
{
if (i % 2 != 0)
sum += i;
else
sum -= i;
}
return sum;
}
{
let count = 2;
let sum = 1;
while (count <= n)
{
if (count % 2 != 0)
sum += count;
else
sum -= count;
count++;
}
return sum;
}
let i = 0;
let xsum = 0;
while (i <= n ) {
if ( i % 2 ) {
xsum += i;
}
else {
xsum -= i;
}
i++;
}
return ( xsum )
}
let sum =0;
for(let i =0;i <= n;i++){
if(i % 2 == 0){
sum+=i*(-1)
}
else
sum+=i;
}
return sum;
}
if (n%2==0){
return n*(-1)/2
}
else {
return ((n-1)/2)*(-1) + n
}
}
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
let sum = 0;
let cur = 1;
while (cur <= n) {
if (cur % 2 == 0) {
sum -= cur;
} else {
sum += cur;
}
cur++
}
return sum;
}
if (n%2 !== 0) {
return (n+1)/2;
}
else {
return -n/2;
}
}
{
let res = 0;
for(let i = 0; i <= n; i++)
res = i % 2 == 0? res - i : res + i;
return res;
}
let result = 0;
for(let i = 1; i <= n; i++)
if(i%2 != 0)
result += i
else
result -= i
return result;
}
{
let i=1;
let xsum=0;
let c;
let d;
while (i<=n)
{
c=Math.pow((-1),(i+1));
d=c*i;
i+=1;
xsum+=d;
}
return xsum
}
let b=0
for(i=1;i<=n;i++){
if(i%2!=0){
b=b+i
}
else{
b=b-i
}
}
return b;
}
let result = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 === 0) {
result -= i;
} else {
result += i;
}
}
return result;
}
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
if (n%2!=0) {
return (n+1)/2;
} else {
return -n/2;
}
}
let i = 0;
let sum = 0;
while (i <= n) {
if (i % 2) {
sum += i;
} else{
sum -= i;
}
i++;
}
return sum
}
let s = 0;
for(let i = 1; i <= n; i++) {
if (i % 2 != 0)
s+=i;
else
s-=i;
}
return s;
}
let sum = 0;
for(let i = 1; i <= n; i++){
if(i % 2 == 0){
sum += (i * (-1));
} else {
sum += i;
}
}
return sum;
}
function xsum(n) {
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
{
let sum = 0;
let i = 1;
while(i <= n)
{
if(i % 2 == 0)
sum -= i;
if(i % 2 == 1)
sum += i;
i++;
}
return sum;
}
let xsum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0){
xsum -= i;
}
else{
xsum += i
}
}
return xsum;
}
{
let k=0;
for (let i=1; i<=n;i++){
if (i%2==0)
k-=i;
else
k+=i;
}
return k;
}
let sum=0
while(n) {
if (n%2==0) {sum-=n}
else {sum+=n}
n--
}
return sum
}
{
let sum = 0;
for(i=1; i<=n;i++){
if(i%2==0)
sum-=i;
else
sum+=i;
}
return sum;
}
let sum = 0
let i = 1
do {
if(i%2 != 0){
sum += i
}
if(i%2 == 0){
sum -= i
}
i++
} while(i <= n);
return sum
}
let sum = 0;
for (let i = 0; i <= n; i++) {
sum += Math.pow(-1, i-1) * i;
}
return sum;
}
if (n%2 !== 0) {
return (n+1) /2;
} else {
return -n/2
}
}
let sum;
if(n%2==0) sum=-1*(n/2);
else sum=-1*((n-1)/2)+n;
return sum;
}
if(n % 2 !== 0){
return (n + 1) / 2;
}else{
return -n / 2
}
}
let factor=1
let sum=0
for(let i=1; i<=n; i++){
sum+=i*factor
factor*=-1
}
return sum
}
let sum = 0;
for ( let i = 1; i <= n ; i++){
if ( i % 2 !== 0){
sum += i;
}
if ( i % 2 == 0){
sum -= i;
}
}
return sum;
}
let p = 1, i = 1, sum = 0;
while (i <= n) {
sum += p * i;
p *= -1;
i++;
}
return sum;
}
let num = 1;
let res = 0;
for (let i = 0; i <= n; i++) {
num *= -1;
res += i*num;
}
return res
}
{
let i=1
let s=0
while(i<=n)
{
s=s+i*((-1)**(i+1))
i=i+1
}
return(s)
}
let sum = 0;
for (let i = 1; i <= n; i++) {
sum += (i % 2 === 0) ? -i : i;
}
return sum;
}
let result = xsum(10);
console.log(result);
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
let sum=0;
for (let i=1; i<=n; i++){
sum+=Math.pow(-1, i-1)*i;
}
return sum;
}
let sum = 0;
let dif = 0;
for(let i = 1; i <= n; i += 2)
sum += i;
for(let j = 2; j <= n; j += 2)
dif -= j;
return sum + dif
}
{
let sum = 0;
for(let i = 1; i <= n; i++)
{
if(i % 2 == 0)
{
sum += (i * (-1));
}
else
{
sum += i;
}
}
return sum;
}
{
let sum = 0;
for(let i = 1; i <= n; i++)
{
if(i % 2 == 0)
{
sum += (i * (-1));
}
else
{
sum += i;
}
}
return sum;
}
let index = 1;
let xsum = 0;
let degrees = 0;
while(index <= n){
degrees = index % 2;
xsum = xsum + (index * ((-1)**(degrees + 1)));
index++;
}
return xsum;
}
let sum = 0;
for(let i = 1; i<=n; i+=2){
sum+=i-i-1;
}
if(n%2){
sum+=n+1;
}
return sum;
}
let i = 1
let sum = 0
while (i <= n) {
sum += i
i++
while (i <= n) {
sum -= i
i++
break
}
}
return sum
}
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) sum -= i;
else sum += i;
}
return sum;
}
var sum =0;
for(var x =1 ;x<=n; x++){
if (x%2==0){
sum=sum-x;
}
else{
sum=sum+x;
}
}
return sum;
}
if (n % 2 != 0) {
return ((n + 1) / 2)
}
else
return (-n / 2)
}
console.log (xsum(5))
{
let counter = n;
let sum = 2;
while(counter>0)
{
if (counter%2 == 0)
{
sum -= counter;
}
else
{
sum += counter;
}
counter--
}
sum -=2;
return sum;
}
{
let sum = 0;
let i = 1;
let x = -2;
while (i <= n)
{
sum += i;
i += 2;
}
while (x >= -n)
{
sum += x;
x -= 2;
}
return sum;
}
{
let k = -1;
let sum = 0;
for (let i = 1; i <= n; i++)
{
k*=-1;
sum += i * k;
}
return(sum);
}
if (n%2!=0) {
return (n+1)/2;
} else {
return -n/2;
}
}
let sum = 0;
for(let i = 1; i <= n; i++) {
if(i % 2 == 0) {
sum += (i * (-1));
}
else {
sum += i;
}
}
return sum;
}
let i = 0;
let xsum=0;
while (i <=n){
if (i%2){
xsum += i
}else{
xsum -= i
}
i++
}
return xsum
}
{
let a
let c
if ( n % 2 == 0 ){
return - n / 2
}
else{
return Math.floor( n / 2 ) + 1
}
}
let sum = 0;
let p = 1;
for(i = 1; i <= n; i++) {
sum += p * i;
p *= -1;
}
return sum;
}
let i = 2;
let sum = 1;
let t = -1;
while (i <= n) {
sum += i * t
t *= -1
i++
}
return sum;
}
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
{
let res = 0;
for(let i = 0; i <= n; i++)
if(i % 2 == 0)
res -= i
else
res += i;
return res;
}
{
if (n%2==0)
return n*(-1)/2
else
return ((n-1)/2)*(-1) + n
}
let clni = 0;
for (let i = 1; i<=n; i++) {
if (i%2==0) {
clni+=-i;
} else clni+=i;
}
return clni;
}
let sum = 0;
for(let i = 1; i<=n; i++){
if(i%2 === 0){
sum -= i;
}
else{
sum += i;
}
}
return sum
}
let b=0
for(i=1;i<=n;i++){
if(i%2!=0){
b=b+i
}
else{
b=b-i
}
}
return b;
}
let sum = 0
while (n != 0)
if (n % 2 == 0){
sum -= n
n -= 1}
else if (n % 2 == 1){
sum += n
n -= 1}
return (sum)
}
{
let i = 0;
let sum = 0;
while (i <= n){
if (i % 2 != 0)
sum += i;
else
sum -= i;
i++;
}
return sum;
}
{
let sum = 0
for(let i = 1; i <= n; i++)
{
if ( i % 2 == 0)
{
sum += (i * (-1));
}
else
{
sum += i;
}
}
return sum;
}
let res = 0
for(i=1; i<=n; i++){
if(i%2==0)
res -= i
else res += i
}
return res;
}
if(n%2==0){
return n/2*(-1)
}
else return (n-1)/2*(-1)+n
}
let sum = 0;
for (let i = 0; i <= n; i++) {
if(i % 2 == 0) {
sum -= i
} else {
sum += i
}
}
return sum
}
let i = 0;
let xsum=0;
while (i <=n){
if (i%2){
xsum += i
}else{
xsum -= i
}
i++
}
return xsum
}
let answ = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0){
answ -=i;
}
else {
answ += i;
}
}
return answ;
}
let xsum = 0
for (let i=1; i<=n; i++){
xsum += (((-1)**(i+1)) * i)
}
return xsum
}
{
let i = 1;
let g = 2;
while(g <= n)
{
i = i - g;
g++;
if (g <= n)
{
i = i + g;
g++;
}
}
return i;
}
if (n % 2 !== 0) {
return (n + 1) / 2;
} else {
return -n / 2;
}
}
let sum = 0;
for(let i = 1; i <= n; i += 2) {
sum += i;
}
for(let i = 2; i <= n; i += 2) {
sum -= i;
}
return sum;
}
let result = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 == 0) {
result -= i
}
else if (i % 2 !== 0) {
result += i
}
}
return result
}
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 !=0){
sum += i;
}else {
sum -= i;
}
}
return sum;
}
let sum = 0
for (let i = 1; i <= n; i++) {
if (i % 2 === 0) sum -= i
else sum += i
}
return sum
}
let i = 1;
let sum = 0;
let degree = 0;
while(i <= n){
degree = i % 2;
sum = sum + (i * ((-1)**(degree + 1)));
i++;
}
return sum;
}
let sum = 0
let i = 0
let m = n
if (n % 2 == 0){
while(i < m / 2){
sum += (n - 1) - n
n -= 2
i++
}
}
if (n % 2 != 0){
while(i < m / 2){
sum -= n - (n + 1)
n -= 2
i++
}
}
return sum
}
if (n%2 !==0){
return (n+1)/2;
}
else {
return (-n/2);
}
}
{
let res=0;
let znak=1;
for(i=1;i<=n;i++)
{
res+=i*znak;
znak*=-1;
}
return res;
}
let sum = (Math.pow(-1,n-1) * (2 * n + 1) + 1)/4
return sum;
}
console.log(xsum(2))
let sum = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 == 1) {
sum += i;
}
else {
sum -= i;
}
}
return sum;
}
let answ = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0){
answ -= i;
}
else{
answ += i;
}
}
return answ;
}
let sum = 0;
for(let i =1;i<=n;i++){
if(i%2==0){sum-=i;}
else{sum+=i;}
}
return sum;
}
console.log(xsum(2));
{
let i=0;
let sum=0;
while (i<=n)
{
if (i%2==0)
{
sum-=i;
}
else {
sum+=i;
}
i++;
}
return sum;
}
{
let sum1 = 0;
for(let i = 1; i <= n; i += 2)
{
sum1 += i;
}
let sum2 = 0;
for(let j = 0; j >= -n; j -= 2)
{
sum2 += j;
}
let sum = sum1 + sum2;
return sum;
}
{
let sum = 0
for(let i=1 ; i<=n ; i++)
{
if (i % 2 == 0)
{
sum += (i * (-1))
}
else
{
sum += i
}
}
return sum
}
let i=1;
let s=0;
while (i<=n){
s+=(-1)**(i+1)*i;
i++;
}
return s;
}
let sum=0;
for(let i=0;i<=n;i++){
if(i%2==0){
sum+=i*(-1)
}
else{
sum+=i
}
}
return sum;
}
if(n % 2 == 0){
return -(n / 2);
}else{
return n - ((n - 1) / 2);
}
}
function xsum(n){
let i = 0 ;
let sum = 0;
while (i <= n)
{
if (i % 2 == 1)
{
sum += i;
i = i + 1 ;
}
else
{
sum += i * -1 ;
i = i + 1;
}
}
return sum
}
{
let sum = 0;
for (let i=1; i<=n; i++)
{
if (i%2!=0)
{
sum+=i;
}
else
{
sum-=i;
}
}
return sum;
}
let a = 0;
let b = 1;
for(let i = 1; i<=n; i++) {
a += i*b;
b *= -1;
}
return a;
}
let sum = 1, i = 2;
while (i <= n){
sum += i * Math.pow((-1), i - 1);
i++;
}
return sum;
}
let xsum = 0;
for(let i = 1; i <= n; i++){
if (i % 2 == 0){
xsum -= i;
}else{
xsum += i;
}
}
return xsum;
}
let plus = true
let sum = 0
for(let i = 1; i <= n; i++){
if(plus){
sum += i
plus = false
}
else{
sum-= i
plus = true
}
}
return sum
}
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) {
sum -= i;
} else {
sum += i;
}
}
return sum;
}
let sum = 0;
let j = 1
for(let i = 1;i<=n;i++,j*=(-1)){
sum += i*j;
}
return sum;
}
let k = 1;
for (let i = 1; i
}
return k
}
let sum = 0;
for(let i = 1; i <= n; i++){
if( i % 2 == 0){
sum += (i * (-1));
}
else{
sum += i;
}
}
return sum;
}
let y = 0
for (let i = 0; i <= n; i++){
if (i % 2 === 0){
y-=i
}
else {
y+=i
}
}
return y
}
{
if(n%2 == 0)
return -n/2
else
return Math.ceil(n/2)
}
if(n % 2 == 0)
return -n/2;
return (n + 1)/2;
}
{
let a = 0
for(let i = 1; i <= n; i++)
{
if (i%2==0)
{
a -= i
}
if (i%2!=0)
{
a += i
}
}
return a
}
function xsum(n){
let sum = 0;
let i = 1;
while (i <= n){
if (i%2 == 1){
sum += i;
} else{
sum-= i;
}
i += 1;
}
return sum;
}
{
let sum = 0;
for(let i = 1; i <= n; i ++)
if(i % 2 == 0)
{
sum -= i;
}
else
{
sum += i;
}
return sum;
}
let i = 0;let sum = 0;let t = 1
while (i <= n){
t *= -1
sum += (i * t)
i += 1
}
return (sum)
}
let sum = 1;
let a = 2;
for (let i = 2; i <= n; i++){
if (i % 2 == 0){
sum -= a;
}
else{
sum += a;
}
a++;
}
return sum;
}
{
let res = 0;
for (let i = 1; i <= n; i++) res += i * (-1)**(i+1);
return res;
}
let sum = 0
for(i = 1; i <= n; i = i + 2){
sum = sum + i
if (i+1<=n) sum = sum - (i + 1)
}
return sum
}
let sum = 0;
while (n!=0) {
if (n%2==0){
sum-=n;
n-=1;
}
else if (n%2==1) {
sum+=n;
n-=1;
}
}
return (sum);
}
let res = 0;
for(let i = 1;i<= n;i++){
if(i % 2 == 0){
res -= i;
}else{
res +=i;
}
}
return res;
}
let sum = 0
for(let i = 1; i<= n; i++){
if(i%2 == 0){
sum += (i*(-1));
}
else
{
sum += i;
}
}
return sum
}
let sum = 0;
let a = 1;
while(a <= n) {
if (a % 2 != 0)
sum += a;
else
sum -= a;
a += 1;
}
return sum;
}
let k = 1
let m = 1
for( let i = 1; i < n; i++){
if (i % 2 !== 0){
k = k - (i + m)
}else if (i % 2 == 0){
k = k + (i + m)
}
}return(k)
}
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
if (n%2 !==0){
return (n+1)/2;
}else{
return -n / 2
}
}
let sum = 0;
for(let i=1; i<=n; i++){
if (i % 2 == 0)
{
sum -= i;
}
else
{
sum += i;
}
}
return sum;
}
{
let b = 0
for (let a = 1; a <= n; a++)
{
if (a % 2 != 0)
{
b += a
}
else
{
b -= a
}
}
return b
}
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) sum -= i;
else sum += i;
}
return sum;
}
let sum = 0;
for(let i=1; i<=n ; i++)
{
if (i % 2 == 0) {
sum -= (i)
} else {
sum += (i)
}
}
return sum
}
let i=0, a=1, b=1
while (a <= n) {
i += a*b;
++a;
b *= (-1);
}
return i;
}
let sum = 0
while (n!=0) {
if (n % 2 == 0) {
sum -= n
n -= 1
}
else if (n % 2 == 1) {
sum +=n
n -= 1
}
}
return sum
}
let result = 1
let counter = 1
for (let i = 2; i<=n; i++){
if (counter % 2 == 0){
result += i
}
else{
result -= i
}
counter++
}
return result
}
{
if ( n %2 == 0 )
{
return n * ( -1 ) / 2;
}
else
{
return (( n - 1) / 2 ) * (-1) + n;
}
}
let sum = 0;
for(let i = 1; i <= n; i ++){
if (i%2 === 0){
sum -= i;
}
else {
sum += i;
}
}
return sum;
}
let res = 0;
for(let i=1;i<=n;i++){
if(i%2==0){
res -= i;
}
else{
res +=i;
}
}
return(res);
}
if (n % 2 == 0) return (- n / 2)
else return (n + 1) / 2
}
let sum = 0;
let i = 0;
while (i < n) {
i += 1;
sum += i % 2 ? i : -i
}
return sum;
}
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
let sum = 0;
for(let i = 1; i<=n; i++){
if((i % 2) == 0){
sum -= i;
}
if((i % 2) == 1 ){
sum += i;
}
}
n = sum;
return n;
}
if (n % 2 !== 0){
return (n + 1)/2;
}
else{
return -n / 2;
}
}
let a = 1
let sum = 0
for(let i = 0;i < n; i++){
sum += a * ((-1) ** i)
a++
}
return sum
}
{
let sum = 0;
let op = 1;
for(let i = 1; i <= n; i++)
{
sum += i * op;
op = -op;
}
return sum;
}
{
let sum = 0;
for (let i = 1; i <= n; i++)
{
if (i % 2 == 0)
sum += (i * (-1));
else
sum += i;
}
return sum;
}
{
var sum = 0;
for(var i = 1; i <= n; i++)
sum += Math.pow(-1, i-1) * i;
return sum;
}
let sum = 0;
for(let i = 1; i <= n; i++) {
sum += i % 2 ? +i : -i;
}
return sum;
}
{
let sum=0;
for (let i=1;i<=n;i++)
{
if (i%2==0)
sum = sum - i;
else sum=sum+i;
}
return sum;
}
let sum = 0;
for (let i = 1; i <= n; i++){
if (i % 2 == 0) sum -= i;
else sum += i;
}
return sum;
}
let sum = 0;
for(let i = 1; i <= n; i++)
sum += i % 2 ? i : -i;
return sum;
}
let sum = 0;
for( let i = 1; i <= n; i++){
if (i % 2 == 0){
sum +=(i *(-1));
}
else{
sum +=i;
}
}
return sum;
}
if (n%2 !==0){
return (n+1)/2;
}else{
return -n / 2
}
}
let sum = 0;
let i = 0;
while(i < n) {
i += 1
sum += i % 2 ? i : -i
}
return sum
}
let sum = 0;
for(let i = 1; i <= n; i++){
sum += i*((-1)**(1+i))
}
return sum;
}
{
r = 0;
for(let i = 1; i <= n; i++)
{
r += i * ((i%2 == 1) ? 1: -1);
}
return r;
}
let sum = 0;
for(let i = 1; i <= n; i++) {
if (i % 2 == 0)
sum -= i;
else
sum += i;
}
return sum;
}
return n % 2 == 1 ? (n - 1) / 2 + 1: n / 2 * -1;
}
let i = 0;
let xsum = 0;
while (i <= n ) {
if ( i % 2 ) {
xsum += i;
}
else {
xsum -= i;
}
i++;
}
return ( xsum )
}
let sum = 0;
for(let i = 0; i <= n; i++)
if (i % 2 == 0) sum -= i;
else sum += i;
return sum;
}
{
let sum = 0;
let addictional = 1
for(let i = 1;i<=n;i++)
{
if (i % 2 == 0)
{
addictional = -1;
}
else
{
addictional = 1;
}
sum += (i * addictional);
}
return sum;
}
let i = 0;
let xsum = 0;
while (i<=n)
{
if (i%2){
xsum = xsum + i;
}
else {
xsum = xsum - i;
}
i++
}
return xsum
}
let result = 0;
for (let i = 1; i <= n; i += 2) result += i;
for (let i = 2; i <= n; i += 2) result -= i;
return result;
}
let res = 0, m;
for (let i = 1; i <= n + 1; i++) {
m = 1
if (i % 2) m = -1;
res += (i - 1) * m;
}
return res
}
let sum = 0;
for (let i = 1; i <= n; i++) {
if (i % 2 == 0)
sum -= i;
else
sum += i
}
return sum;
}
if (n%2 !==0){
return (n+1)/2;
}else{
return -n / 2
}
}
{
let i = 0;
let result = 0;
for (i = 0; i <= n; i++)
{
if ( i % 2 )
{
result += i;
}
else
{
result -= i;
}
}
return (result)
}
{
let i=1;
let xsum=0;
let c;
let d;
while (i<=n)
{
c=Math.pow((-1),(i+1));
d=c*i;
i+=1;
xsum+=d;
}
return xsum
}