QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#361791 | #8340. 3 Sum | comeintocalm# | WA | 55ms | 4008kb | C++17 | 494b | 2024-03-23 13:15:52 | 2024-03-23 13:15:52 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e3 + 5;
int n, m;
char s[MAXN * 1000];
int a[MAXN];
int main() {
int i,j,k;
scanf ("%d%d", &n, &m);
for (i = 1; i <= n; ++i) {
scanf ("%s", s);
k = strlen (s);
for (j = 0; j < k; ++j) a[i] += s[j] - '0';
}
int sum = 9 * m, ans = 0;
for (i = 1; i <= n; ++i)
for (j = i; j <= n; ++j)
for (k = j; k <= n; ++k)
if ((a[i] + a[j] + a[k]) % sum == 0) ++ans;
printf ("%d", ans);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3908kb
input:
4 1 0 1 10 17
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 34ms
memory: 3928kb
input:
500 859 7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: 0
Accepted
time: 50ms
memory: 3948kb
input:
500 17336 11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...
output:
0
result:
ok 1 number(s): "0"
Test #4:
score: 0
Accepted
time: 47ms
memory: 3960kb
input:
500 1 751324443898124078584847834484321089092662321556147445230263526014359393841194947303407593948729802551881289193716611867931891257925091769456350249725997883453296895094445731130479434019358742162771547784250401546380268386074363779242500860317042151185119666027858022664683818314351285215150806...
output:
2327631
result:
ok 1 number(s): "2327631"
Test #5:
score: -100
Wrong Answer
time: 55ms
memory: 4008kb
input:
500 2 408542968136435277974575411503179002415404345446801430469044749372949272333801248935236224652806667129749035002588943020176263162139056819871274824302889304493205266143688886696157147111754418731401856424401766968832165255416237731963027205324149660112574729610391396555581935236134531799950318...
output:
1163532
result:
wrong answer 1st numbers differ - expected: '212002', found: '1163532'