#include <iostream>
#include <cmath>
using namespace std;
int sum_all(int n)
{
int items;
items = abs(2*n-n)+1;
return (n+2*n)*items/2;
}
int main()
{
int m;
cin >> m;
int tmp[500];
for(int i = 0; i < m; i++)
cin >> tmp[i];
for(int i = 0; i < m; i++)
cout << sum_all(tmp[i]) << endl;
return 0;
}
#include<iostream> using namespace std; int main(){ int m,n; cin>>m; while(m>0){ cin>>n; int total=0; if(n>0){ for(int i=n;i<=2*n;i++) total+=i; } else{ for(int i=2*n;i<=n;i++) total+=i; } cout<<total<<endl; m--; } }
#include <cstdio> #include <iostream> using namespace std; int Sum(int b){ return (b+2*b)*(b+1)/2; } int main() { int a, b; cin >> a; for (int i = 0; i < a; i++) { cin >> b; if (b>=0) { printf("%d\n",Sum(b)); } else { printf("%d\n",-Sum(-b)); } } return 0; }
#include <cstdio> int main(){ int m,n; scanf("%d",&m); while(scanf("%d",&n) != EOF){ if(n>0){ int sum = 0 , i = n; while(i <= 2*n){ sum += i; i++; } printf("%d\n",sum); }else{ //n<0 int sum = 0, i = n; while(i >= 2*n){ sum += i; i--; } printf("%d\n",sum); } } return 0; }
#include<iostream> #include<algorithm> using namespace std; int main(){ int n; cin >> n; while(n--){ int m; cin >> m; int sum = 3 * m * (abs(m) + 1) / 2; cout << sum << endl; } }
#include<iostream> #include<vector> using namespace std; int sum(int n) { int y = 0; if(n >= 0) for(int i = n;i <= 2 * n;i++) y += i; else for(int i = 2 * n;i <= n;i++) y += i; return y; } int main(void) { int m; while(cin >> m) { vector<int> arr; while(m--) { int x; cin >> x; arr.push_back(x); } for(vector<int>::iterator it = arr.begin();it != arr.end();it++) cout << sum(*it) << endl; } return 0; }
#include<stdio.h> #include<stdlib.h> int _Nto2N(int n){ int sum=0; for(int i=n;i<=2*n;i++) sum+=i; return sum; } int _2NtoN(int n){ int sum=0; for(int i=2*n;i<=n;i++) sum+=i; return sum; } int main(){ int n; while(scanf("%d",&n)!=EOF){ int *num=(int *)malloc(sizeof(int)*n); //num存储要操作的整数 for(int i=0;i<n;i++){ int temp; scanf("%d",&temp); num[i]=temp; } for(int j=0;j<n;j++){ if(num[j]>=0){ printf("%d",_Nto2N(num[j])); printf("\n"); } else { printf("%d",_2NtoN(num[j])); printf("\n"); } } } }
#include<stdio.h> int sum(int x) { int sum=0,i; if(x==0) sum=0; if(x>0) for(i=x;i<=2*x;i++) sum=sum+i; if(x<0) for(i=2*x;i<=x;i++) sum=sum+i; return sum; } int main() { int m,N[1000],i; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d",&N[i]); for(i=0;i<m;i++) printf("%d\n",sum(N[i])); return 0; }
#include <stdio.h> #include <stdlib.h> int main() { int m; while(~scanf("%d", &m)) { int i, n, from, to, sum; for(i = 0; i < m; i++) { sum = 0; scanf("%d", &n); if(n < 0) { from = 2 * n; to = n ; } else { from = n ; to = 2 * n; } for(int j = from; j <= to; j++) sum += j; printf("%d\n", sum); } } return 0; }
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); for (int k = 0; k < n; k++) { int i = scanner.nextInt(); int sum = 0; if (i>=0) for (int j = i; j <=2*i ; j++) sum+= j; else for (int j = 2*i; j <=i ; j++) sum+= j; System.out.println(sum); } } }