제출 #1132670

#제출 시각아이디문제언어결과실행 시간메모리
1132670AgageldiNice sequence (IZhO18_sequence)C++17
0 / 100
0 ms328 KiB
/* ID: agageld1 LANG: C++17 TASK: */ #include <bits/stdc++.h> using namespace std; #define ll long long #define N 400005 #define ff first #define ss second #define pb push_back #define sz(s) (int)s.size() #define rep(c, a, b) for(c = a; c <= b; c++) //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ll n, t, T, a[N], m; int main () { ios::sync_with_stdio(0);cin.tie(0); cin >> T; while(T--) { cin >> n >> m; if(n == 1 && m == 1) { cout << "0\n"; continue; } if(n % m == 0 || m % n == 0) { t = 1; if(m % n == 0) t = -1; for(int i = 1; i <= max(n,m) - 1; i++) { cout << t << ' '; } cout << '\n'; } } }
#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...