#include <iostream> using namespace std; int Answer; int main(int argc, char** argv) { int T, test_case; int N; cin >> T; for(test_case = 0; test_case < T; test_case++) { Answer = 0; int x; cin >> N; for(int i=0; i<N; i++) { cin>>x; Answer ^= x; } cout << "Case #" << test_case+1 << endl; cout << Answer << endl; } return 0;//Your program should return 0 on normal termination. }
'알고리즘 문제 풀이 > 1DP_과제(~180615)' 카테고리의 다른 글
171103_거듭제곱 (0) | 2017.11.03 |
---|---|
171103_14503_로봇청소기(틀림) (0) | 2017.11.03 |
171102_11403_경로찾기 (0) | 2017.11.02 |
171102_2178_미로탐색 (0) | 2017.11.02 |
171101_회문1 (0) | 2017.11.01 |