QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#700609#8340. 3 SumfryanWA 129ms4028kbC++201.1kb2024-11-02 13:13:012024-11-02 13:13:03

Judging History

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

  • [2024-11-02 13:13:03]
  • 评测
  • 测评结果:WA
  • 用时:129ms
  • 内存:4028kb
  • [2024-11-02 13:13:01]
  • 提交

answer

#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define int long long

int mod = 998244353;
constexpr int mxn = 505;
constexpr int mxk = 2e4+5;

int p10[mxk];

int n,k,fh[mxn];

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	cin>>n>>k;
	
	p10[0] = 1;
	for (int i=1; i<mxk; i++) {
		p10[i] = p10[i-1]*10%mod;
	}
	
	for (int i=0; i<n; i++) {
		string s; cin>>s;
		reverse(all(s));
		for (int j=0; j<sz(s); j++) {
			fh[i] += (s[j]-'0')*p10[j%k];
			fh[i] %= mod;
		}
	}
		
	int cnt = 0;
	int k0 = 0;
	int k1 = p10[k]-1;
	int k2 = 2*k1%mod;
	int k3 = 3*k1%mod;
	
	
	int mod2 = mod;
	if (k <= 9) {
		mod2 = p10[k]-1;
	}
	
	for (int i=0; i<n; i++) {
		for (int j=i; j<n; j++) {
			for (int k=j; k<n; k++) {
				if ((fh[i]+fh[j]+fh[k])%mod2==k1) {
					cnt++;
				}
				if ((fh[i]+fh[j]+fh[k])%mod2==k2) {
					cnt++;
				}
				if ((fh[i]+fh[j]+fh[k])%mod2==k0) {
					cnt++;
				}
				if ((fh[i]+fh[j]+fh[k])%mod2==k1) {
					cnt++;
				}
			}
		}
	}
	cout<<cnt;
	
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3792kb

input:

4 1
0
1
10
17

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 64ms
memory: 4028kb

input:

500 859
7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...

output:

0

result:

ok 1 number(s): "0"

Test #3:

score: 0
Accepted
time: 129ms
memory: 3892kb

input:

500 17336
11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...

output:

0

result:

ok 1 number(s): "0"

Test #4:

score: 0
Accepted
time: 129ms
memory: 3836kb

input:

500 1
751324443898124078584847834484321089092662321556147445230263526014359393841194947303407593948729802551881289193716611867931891257925091769456350249725997883453296895094445731130479434019358742162771547784250401546380268386074363779242500860317042151185119666027858022664683818314351285215150806...

output:

2327631

result:

ok 1 number(s): "2327631"

Test #5:

score: 0
Accepted
time: 128ms
memory: 3784kb

input:

500 2
408542968136435277974575411503179002415404345446801430469044749372949272333801248935236224652806667129749035002588943020176263162139056819871274824302889304493205266143688886696157147111754418731401856424401766968832165255416237731963027205324149660112574729610391396555581935236134531799950318...

output:

212002

result:

ok 1 number(s): "212002"

Test #6:

score: -100
Wrong Answer
time: 125ms
memory: 3896kb

input:

500 11500
75411775796562109942642493394321873284995260953010112281856775261847503626737348402159485133662757032091519863427156582689971229143089317472838196453888261138079171290535429921921548971897026706656838415620603757605079012541561774699628665865662183868374645956694140356716037674688084770628...

output:

12195

result:

wrong answer 1st numbers differ - expected: '7675', found: '12195'