#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
signed main()
{
	int T;
	cin >> T;
	int ans = 0, a, n = 0;
	while(T--)
	{
		ans = 0;
		cin >> n;
		for(int i = 1; i <= n; i++)
		{
			cin >> a;
			ans += a;
		}
		cout << ans << endl;
	}
	return 0;
}

和最后一题一样

#include <iostream>
using namespace std;
int main()
{
	short n,m,sum,a;
	cin >> n;
	while (cin >> m)
	{
		for (int j = 1;j <= m;j++)
		{
			cin >> a;
			sum += a;
		}
		cout << sum << endl;
		sum = 0;
		n--;
		if (n == 0)
			return 0;
	}
}

#include using namespace std; int main() { int n; int a; int b; int sum = 0; cin >> n; for(int i = 1; i <= n; i++) { cin >> a; for(int j = 1; j <= a; j++) { cin >> b; sum += b; } cout << sum << endl; sum = 0; } return 0; }

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N=1e7+10;
const int INF=0x3f3f3f3f;
int main()
{
	int n,a,b,sum=0;
	cin>>b;
	for(int i=1;i<=b;i++)
	{
		while(cin>>n)
	{
		for(int i=1;i<=n;i++)
		{
			cin>>a;
			sum+=a;
		}
		cout<<sum<<"\n";
		sum=0;
	}
	}
	return 0;
	/*while(cin>>n)
	{
		for(int i=1;i<=n;i++)
		{
			cin>>a;
			sum+=a;
		}
		cout<<sum<<"\n";
		sum=0;
	}*/ 
}

海题

#include <math.h> #include <stdio.h> #include using namespace std; int main() { int a,b; while(cin >> a >> b) { if(a == 0 && b == 0) break; cout << a + b << endl; } }

#include <math.h> #include <stdio.h> #include using namespace std; int main() { int a,b; while(cin >> a >> b) { if(a == 0 && b == 0) break; cout << a + b << endl; } }

#include

using namespace std;

int main() {

int n,a,b,sum=0;

cin>>n;

for(int i=1;i<=n;i++){

cin>>a;

for(int j=1;j<=a;j++){

cin>>b;

sum+=b;	

}

cout<<sum<<endl;

sum=0;

}

}