QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#512159 | #9167. Coprime Array | ucup-team956# | TL | 0ms | 0kb | C++20 | 1.6kb | 2024-08-10 13:42:10 | 2024-08-10 13:42:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define time chrono::system_clock::now().time_since_epoch().count()
mt19937_64 rnd(time);
#define maxn 1000005
#define int long long
int read() {int x;cin>>x;return x;}
void solve() {
int n = read(), s = read();
if(__gcd(n, s) == 1) {
cout << 1 << "\n" << n << "\n";
return;
}
for(int i = -1e7; i <= 1e7; i++) {
if(__gcd(i, s) == 1 && __gcd(n - i, s) == 1) {
cout << 2 << "\n";
cout << i << " " << n - i << "\n";
return;
}
}
while(1);
for(int i = -1e3; i <= 1e3; i++) {
for(int j = -1e3; j <= 1e3; j++) {
if(__gcd(i, s) == 1 && __gcd(j, s) == 1 && __gcd(n - i - j, s) == 1) {
cout << 3 << "\n";
cout << i << " " << j << " " << n - i - j << "\n";
return;
}
}
}
for(int i = -1e2; i <= 1e2; i++) {
for(int j = -1e2; j <= 1e2; j++) {
for(int k = -1e2; k <= 1e2; k++) {
if(__gcd(i, s) == 1 && __gcd(j, s) == 1 && __gcd(k, s) == 1 && __gcd(n - i - j - k, s) == 1) {
cout << 4 << "\n";
cout << i << " " << j << " " << k << " " << n - i - j - k << "\n";
return;
}
}
}
}
}
signed main() {
#ifdef ONLINE_JUDGE
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
#else
//freopen("a.in", "r", stdin);
#endif
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
input:
9 6