//if是啥?能吃嗎?((欠揍貌

#include<iostream>
using namespace std;

int main()
{
int a,b,i,sum1=0,sum2=0;
cin>>a>>b;
for(i=a;i<=b;i++){
sum1=sum1+i*(i%2==0);
}
for(i=b;i<=a;i++){
sum2=sum2+i*(i%2==0);
}
cout<<(sum1*(a<=b)+sum2*(a>=b))-sum1*(a==b);
return 0;
}

你的還是太複雜

#include <iostream>

using namespace std;

int main()

{

int i,j;

long long int ans,s,a,l;

cin>>i;

for(int i0=0;i0<i;i0++)

{

cin>>j;

ans=0;

for(int j0=0;j0<j;j0++)

{

cin>>s>>a>>l;

ans+=s*l;

}

cout<<ans<<endl;

}

return 0;

}

030..

#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mse(x,y) memset(x,y,sizeof(x))
#define IOS do{ios::sync_with_stdio(0);cin.tie();}while(0)

typedef long long ll;
typedef pair<int,int> pii;

const int maxn = 1005;
const int INF = 0x3f3f3f3f;
const int mod = 10000007;
const double eps = 1e-9;

int __ = 1 , kase = 0;

/************default************/

int a , b;

void init(){}

void read(){
	scanf("%d%d" , &a , &b);
}

void solve(){
	int ans = 0;
	for(int i = min(a , b); i <= max(a , b); i++){
		ans += (!(i & 1)) * i;
	}
	printf("%d\n" , ans);
}

int main(){
	// scanf("%d" , &__);
	while(__--){
		init();
		read();
		solve();
	}
	return 0;
}