結果
問題 |
No.571 3人兄弟(その2)
|
ユーザー |
|
提出日時 | 2017-10-28 11:51:36 |
言語 | C++11(廃止可能性あり) (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,681 bytes |
コンパイル時間 | 615 ms |
コンパイル使用メモリ | 63,920 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-22 03:01:23 |
合計ジャッジ時間 | 1,234 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 12 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:81:37: warning: ‘out_num’ may be used uninitialized in this function [-Wmaybe-uninitialized] 81 | if(W_tmp[i] == W[j] && j != out_num){ | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~ main.cpp:49:37: warning: ‘out_num’ may be used uninitialized in this function [-Wmaybe-uninitialized] 49 | if(W_tmp[i] == W[j] && j != out_num){ | ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <iostream> #include <algorithm> using namespace std; int main(){ int H[3], W[3]; string alphabets[3] = {"A", "B", "C"}; for(int i = 0; i < 3; i++){ cin >> H[i] >> W[i]; } int H_tmp[3]; for(int i = 0; i < 3; i++){ H_tmp[i] = H[i]; } sort(H_tmp, H_tmp + 3, greater<int>()); if(H_tmp[0] == H_tmp[1] && H_tmp[1] == H_tmp[2]){ int W_tmp[3]; for(int i = 0; i < 3; i++){ W_tmp[i] = W[i]; } sort(W_tmp, W_tmp + 3); for(int i = 0; i < 3; i++){ for(int j = 0; j < 3; j++){ if(W_tmp[i] == W[j]){ cout << alphabets[j] << endl; break; } } } }else if(H_tmp[0] == H_tmp[1]){ int W_tmp[2]; int out_num; for(int i = 0; i < 3; i++){ if(H_tmp[2] == H[i]){ int j_count = 0; out_num = i; for(int j = 0; j < 3; j++){ if(i != j){ W_tmp[j_count] = W[j]; j_count++; } } break; } } sort(W_tmp, W_tmp + 2); for(int i = 0; i < 2; i++){ for(int j = 0; j < 3; j++){ if(W_tmp[i] == W[j] && j != out_num){ cout << alphabets[j] << endl; break; } } } for(int i = 0; i < 3; i++){ if(H_tmp[2] == H[i]){ cout << alphabets[i] << endl; break; } } }else if(H_tmp[1] == H_tmp[2]){ int W_tmp[2]; int out_num; for(int i = 0; i < 3; i++){ if(H_tmp[0] == H[i]){ cout << alphabets[i] << endl; int j_count = 0; out_num = i; for(int j = 0; j < 3; j++){ if(i != j){ W_tmp[j_count] = W[j]; j_count++; } } break; } } sort(W_tmp, W_tmp + 2); for(int i = 0; i < 2; i++){ for(int j = 0; j < 3; j++){ if(W_tmp[i] == W[j] && j != out_num){ cout << alphabets[j] << endl; break; } } } }else{ for(int i = 0; i < 3; i++){ for(int j = 0; j < 3; j++){ if(H_tmp[i] == H[j]){ cout << alphabets[j] << endl; break; } } } } }