QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#534319#5. 在线 O(1) 逆元surgutti0 890ms394528kbC++14238b2024-08-27 02:06:322024-08-27 02:06:32

Judging History

This is a historical verdict posted at 2024-08-27 02:06:32.

  • [2024-11-05 22:03:15]
  • 管理员手动重测本题所有提交记录
  • Verdict: 0
  • Time: 0ms
  • Memory: 0kb
  • [2024-08-27 02:06:32]
  • Judged
  • Verdict: 0
  • Time: 890ms
  • Memory: 394528kb
  • [2024-08-27 02:06:32]
  • Submitted

answer

#include "inv.h"

const int N = 100000000 + 1;

int inverse[N];

void init(int p) {
	inverse[1] = 1;
	for (int i = 2; i < N; i++)
		inverse[i] = (p - p / i * inverse[p % i] % p) % p;
}

int inv(int x) {
	return inverse[x];
}

Details


Pretests


Final Tests

Test #1:

score: 0
Runtime Error

Test #2:

score: 0
Wrong Answer
time: 890ms
memory: 394292kb

Test #3:

score: 0
Wrong Answer
time: 874ms
memory: 394528kb