# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1133957 | KasymK | Nice sequence (IZhO18_sequence) | C++17 | 280 ms | 41396 KiB |
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 4e5+5;
int v[N], tin, k, n, m;
void dfs(int x){
if(x+n<=k and !v[x+n])
dfs(x+n);
if(x>=m and !v[x-m])
dfs(x-m);
v[x]=++tin;
return;
}
void solve(){
scanf("%d%d", &n, &m);
tin=0;
for(int i = 0; i <= n+m; ++i)
v[i]=0;
k=n+m-__gcd(n, m)-1;
for(int i = 0; i <= k; ++i)
if(!v[i])
dfs(i);
printf("%d\n", k);
if(k==0)
return;
for(int i = 1; i <= k; ++i)
printf("%d ", v[i]-v[i-1]);
puts("");
}
int main(){
int tt;
scanf("%d", &tt);
while(tt--)
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |