QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#725111#9167. Coprime ArraygzyWA 0ms3644kbC++14770b2024-11-08 16:18:382024-11-08 16:18:39

Judging History

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

  • [2024-11-08 16:18:39]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3644kb
  • [2024-11-08 16:18:38]
  • 提交

answer

#include<bits/stdc++.h>
#define pb push_back
#define pi pair<int,int>
#define F first
#define S second
#define mp make_pair
#define vector basic_string
#define gcd __gcd
using namespace std;
using ll = long long;
using db = double;
const int N = 2e5 + 7;
int i, j, k, n, m;
ll s;

vector<int> d;

int main() {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
//	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	scanf("%d%d", &n, &m);
	while(1) {
		if(__gcd(m, n + k) == 1) break;
		++k;
	}
	if(__gcd(k, m) == 1) {
		cout << "2\n" << -k << " " << n + k << "\n";
	} else {
		cout << "3\n";
		for(i = 2; i <= k; i++) {
			if(gcd(i, k) == 1) break;
		} 
		cout << n+k-m << " " << m+i << " " << -k-i;
	}
	return 0;
}



Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3644kb

input:

9 6

output:

3
5 9 -5

result:

wrong answer Element at position 2 is not coprime to x