제출 #92154

#제출 시각아이디문제언어결과실행 시간메모리
92154davitmargGift (IZhO18_nicegift)C++17
0 / 100
926 ms22472 KiB
/* DEATH-MATCH Davit-Marg */ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <iterator> #include <ctype.h> #include <stdlib.h> #include <cassert> #include <fstream> #define mod 998244353ll #define LL long long #define LD long double #define MP make_pair #define PB push_back using namespace std; LL n,k,a[1000006],d,v; int main() { cin >> n >> k; for (LL i = 0; i < n; i++) scanf("%lld",a+i); d = n % k + 1; if (a[0] % d != 0) { cout << -1 << endl; return 0; } cout << d * n / k; for (LL i = 0; i < d*n; i++) { v %= k; if (v == 0) cout<<endl << a[0] / d << " "; cout<<(i%n)+1<<" "; v++; } cout << endl; return 0; } /* 4 2 5 5 5 5 14 7 10 10 10 10 10 10 10 10 10 10 10 10 10 10 */

컴파일 시 표준 에러 (stderr) 메시지

nicegift.cpp: In function 'int main()':
nicegift.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",a+i);
   ~~~~~^~~~~~~~~~~~
#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...