QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#511989#9167. Coprime Arrayucup-team052#AC ✓0ms3680kbC++23953b2024-08-10 13:11:072024-08-10 13:11:07

Judging History

你现在查看的是测评时间为 2024-08-10 13:11:07 的历史记录

  • [2024-10-14 07:51:48]
  • 管理员手动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:1ms
  • 内存:3712kb
  • [2024-08-11 17:38:28]
  • hack成功,自动添加数据
  • (/hack/775)
  • [2024-08-10 13:11:07]
  • 评测
  • 测评结果:100
  • 用时:0ms
  • 内存:3680kb
  • [2024-08-10 13:11:07]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;

int s, x;

int main() {
	cin >> s >> x;
	if (__gcd(s, x) == 1) {
		cout << 1 << '\n';
		cout << s << '\n';
		return 0;
	}
	if (x % 2 == 0 && s % 2 == 1) {
		for (int i = 1; ; i += 2) {
			if (__gcd(i, x) == 1 && __gcd(i * 2 + s, x) == 1 && i * 2 + s <= INF) {
				cout << 3 << '\n';
				cout << -i << ' ' << -i << ' ' << i * 2 + s << '\n';
				return 0;
			}
			if (__gcd(i, x) == 1 && __gcd(abs(s - i * 2), x) == 1) {
				cout << 3 << '\n';
				cout << i << ' ' << i << ' ' << s - i * 2 << '\n';
				return 0;
			}
		}
	}
	for (int i = 1; ; i += 2) {
		if (__gcd(i, x) == 1 && __gcd(i + s, x) == 1 && i + s <= INF) {
			cout << 2 << '\n';
			cout << -i << ' ' << i + s << '\n';
			return 0;
		}
		if (__gcd(i, x) == 1 && __gcd(abs(s - i), x) == 1) {
			cout << 2 << '\n';
			cout << i << ' ' << s - i << '\n';
			return 0;
		}
	}
	return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3680kb

input:

9 6

output:

3
-1 -1 11

result:

ok Correct

Test #2:

score: 0
Accepted
time: 0ms
memory: 3596kb

input:

14 34

output:

2
-1 15

result:

ok Correct

Test #3:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

1000000000 223092870

output:

2
29 999999971

result:

ok Correct

Test #4:

score: 0
Accepted
time: 0ms
memory: 3524kb

input:

2 1000000000

output:

2
-1 3

result:

ok Correct

Test #5:

score: 0
Accepted
time: 0ms
memory: 3612kb

input:

649557664 933437700

output:

2
-7 649557671

result:

ok Correct

Test #6:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

33396678 777360870

output:

2
-1 33396679

result:

ok Correct

Test #7:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

48205845 903124530

output:

3
-1 -1 48205847

result:

ok Correct

Test #8:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

251037078 505905400

output:

2
-1 251037079

result:

ok Correct

Test #9:

score: 0
Accepted
time: 0ms
memory: 3560kb

input:

30022920 172746860

output:

2
-1 30022921

result:

ok Correct

Test #10:

score: 0
Accepted
time: 0ms
memory: 3596kb

input:

63639298 808058790

output:

2
-1 63639299

result:

ok Correct

Test #11:

score: 0
Accepted
time: 0ms
memory: 3556kb

input:

76579017 362768406

output:

3
1 1 76579015

result:

ok Correct

Test #12:

score: 0
Accepted
time: 0ms
memory: 3556kb

input:

40423669 121437778

output:

3
-1 -1 40423671

result:

ok Correct

Test #13:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

449277309 720915195

output:

2
1 449277308

result:

ok Correct

Test #14:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

81665969 919836918

output:

3
-1 -1 81665971

result:

ok Correct

Test #15:

score: 0
Accepted
time: 0ms
memory: 3616kb

input:

470578680 280387800

output:

2
-1 470578681

result:

ok Correct

Test #16:

score: 0
Accepted
time: 0ms
memory: 3556kb

input:

58450340 803305503

output:

2
1 58450339

result:

ok Correct

Test #17:

score: 0
Accepted
time: 0ms
memory: 3528kb

input:

125896113 323676210

output:

3
-7 -7 125896127

result:

ok Correct

Test #18:

score: 0
Accepted
time: 0ms
memory: 3680kb

input:

381905348 434752500

output:

2
1 381905347

result:

ok Correct

Test #19:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

78916498 653897673

output:

1
78916498

result:

ok Correct

Test #20:

score: 0
Accepted
time: 0ms
memory: 3624kb

input:

35787885 270845190

output:

3
1 1 35787883

result:

ok Correct

Extra Test:

score: 0
Extra Test Passed