제출 #92873

#제출 시각아이디문제언어결과실행 시간메모리
92873davitmargNice sequence (IZhO18_sequence)C++17
9 / 100
9 ms888 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 1000000007ll #define LL long long #define LD long double #define MP make_pair #define PB push_back using namespace std; int t,n, m; bool sw; vector<int> a; int main() { cin >> t; while (t--) { cin >> n >> m; sw = 0; a.resize(0); if (n < m) { sw = 1; swap(n, m); } if (m == 2) { if (n % 2) { for (int i = n; i >= 1; i--) if ((n + 1 - i) % 2) a.PB(i / 2+2*n); else a.PB(-(a.back() + 1)); } else { for (int i = 1; i < n; i++) a.PB(-1); } } cout << a.size() << endl; if (a.size() != 0) { for (int i = 0; i < a.size(); i++) cout << a[i] * (2 * (sw)-1) << " "; cout << endl; } } return 0; } /* */

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

sequence.cpp: In function 'int main()':
sequence.cpp:66:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < a.size(); 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...