제출 #1211709

#제출 시각아이디문제언어결과실행 시간메모리
1211709catch_me_if_you_canGift (IZhO18_nicegift)C++20
0 / 100
142 ms14660 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define in array<int, 2> #define pb push_back #define pob pop_back #define fast() ios_base::sync_with_stdio(false); cin.tie(NULL) const int MX = 2e5+5; const int INF = 1e17; signed main() { fast(); int n, k; cin >> n >> k; vector<vector<int>> op; int A; for(int i = 1; i <= n; i++) cin >> A; if((n*A)%k != 0) { cout << "-1\n"; return 0; } int g = __gcd(n, k); int kp = k/g; int m = A/kp; //we want final values as m*kp for(int i = 1; i <= (n/g); i++) { //1 + g*i to k + g*i cout << m << " "; for(int t = 1; t <= k; t++) cout << ((t+g*i)%n + 1) << " "; cout << "\n"; } return 0; }
#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...