提交记录 #75382

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#75382	#5149. Best Carry Player	chris_pher	TL	0ms	3360kb	C++23	526b	2023-02-05 03:46:48	2023-02-05 03:46:49

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-02-05 03:46:49]
评测

测评结果：TL
用时：0ms
内存：3360kb

查看

[2023-02-05 03:46:48]
提交

answer

#include <bits/stdc++.h> 
typedef long long ll;
using namespace std;
const int N = 100010;

int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int T;
	cin >> T;
	while(T--) {
		int n;
		ll ans = 0,sum = 0;
		cin >> n;
		for(int i = 0;i < n;i++) {
			ll x;
			cin >> x;
			string s = to_string(x);
			for(auto i : s) {
				ans += i - '0';
			}
			sum += x;
		}
		string s = to_string(sum);
		for(auto i : s) {
			ans -= i -'0';
		}
		cout << ans / 9 << endl;
	}
	return 0;
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3360kb

input:

output:

5
0

result:

ok 2 number(s): "5 0"

Test #2:

score: -100

Time Limit Exceeded

input:

output:

QOJ.ac

QOJ

Judging History

answer

詳細信息

Test #1:

input:

output:

result:

Test #2:

input:

output:

result: