C :

#include<stdio.h>
#include<stdlib.h>
int cul(int num)
{
	int count=0;
	for(int i=num;i<=2*num;i++)
	{
		count+=i;
	}
	return count;
}
int main()
{
	int m,n;
	int num;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&m);
		if(m>=0)
			num=cul(m);
		else if(m<0)
		{
			printf("-");
			num=cul(-m);
		}
		printf("%d\n",num);
	}
	//system("pause");
	return 0;
}

C++ :

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

int main()
{
    //freopen("test.in", "r", stdin);
    //freopen("test.out", "w", stdout);
    int N, t;
    cin >> t;
    while (t--) {
        cin>>N;
        cout<<((N+2*N)*(abs(N)+1))/2<<endl;
    }
    return 0;
}

Pascal :

var  n,m,i,s,j:longint;
   begin
   readln(n);
   for j:=1 to n do
    begin
     readln(m);
     s:=0;
     if m>0 then for i:=m to 2*m do   s:=s+i;
     if m<0 then for i:=2*m to m do s:=s+i;
     writeln(s);
    end;
  end.

Java :

import java.util.Scanner;

public class Main {
   public static void main(String[] args) {
	  Scanner s = new Scanner(System.in) ;
	  
	  int N = s.nextInt() ;
	  
	  for (int i = 0; i < N; i++) {
		int n =s.nextInt() ;
		int sum = 0 ;
		if(n>=0){
		for (int j = n; j <= 2*n; j++) {
			sum = sum + j;
		}
	  }else {
		  for (int j = 2*n; j <= n; j++) {
				sum = sum + j;
			}
	  }
		System.out.println(sum) ;
	  }
  }
}