19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T47c,#include #include int main() { int n; std::cin >> n; if (n == 1) { std::cout << 'A'; return 0; } std::vector seq(n); for (int i = 0; i < n; ++i) { std::cin >> seq[i]; } if (n == 2) { if (seq[0] == seq[1]) { std::cout << seq[0]; } else { std::cout << 'A'; } return 0; } int ans = 0x80000000; bool find_answer = false; for (int a = -100; a <= 100; ++a) { bool is_answer = true; int b = seq[1] - (seq[0] * a); for (int i = 2; i < n; ++i) { if (seq[i] != seq[i - 1] * a + b) { is_answer = false; break; } } if (is_answer) { if (find_answer)

제출 #48062

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: