제출 #1089955

#제출 시각아이디문제언어결과실행 시간메모리
108995512345678Nice sequence (IZhO18_sequence)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; const int nx=2e5+5; int n, m, f, _t, res[nx]; void solve() { cin>>n>>m; f=n<m; if (n==m) return cout<<0<<'\n', void(); if (n>m) swap(n, m); for (int i=1; i<m; i++) res[i]=1; if (f) for (int i=1; i<m; i++) res[i]=-1; cout<<m-1<<'\n'; for (int i=1; i<m; i++) cout<<res[i]<<' '; cout<<'\n'; } int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>_t; while (_t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...