結果
問題 | No.1837 Same but Different |
ユーザー |
👑 |
提出日時 | 2022-01-16 14:34:07 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 1,112 bytes |
コンパイル時間 | 224 ms |
コンパイル使用メモリ | 31,616 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-23 10:38:00 |
合計ジャッジ時間 | 1,816 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 23 |
ソースコード
#include <stdio.h> int main() { int N; scanf("%d", &N); int i, A[3001], B[3001]; if (N % 3 == 0) { for (i = 1; i <= N / 3; i++) { A[i] = i * 3; B[i] = i * 3 - 2; } for (; i <= N; i++) { A[i] = i * 3; B[i] = i * 3 + 1; } } else if (N % 3 == 1) { A[1] = 0; B[1] = 1; for (i = 2; i <= N / 3 * 2 + 1; i++) { A[i] = A[i-1] + 3; B[i] = B[i-1] + 3; } if (i <= N - 1) { A[i] = A[i-1] + 6; B[i] = B[i-1] + 3; } for (i++; i <= N - 1; i++) { A[i] = A[i-1] + 3; B[i] = B[i-1] + 3; } B[N] = B[N-1] + 3; A[N] = B[N] + 3; } else { A[1] = 0; A[2] = 12; B[1] = 10; B[2] = 13; for (i = 3; i <= N / 3 * 2 + 1; i++) { A[i] = A[i-1] + 3; B[i] = B[i-1] + 3; } if (i <= N - 2) { A[i] = A[i-1] + 6; B[i] = B[i-1] + 3; } for (i++; i <= N - 2; i++) { A[i] = A[i-1] + 3; B[i] = B[i-1] + 3; } B[N-1] = B[N-2] + 3; B[N] = B[N-1] + 3; A[N-1] = B[N] + 3; A[N] = A[N-1] + 3; } for (i = 1; i <= N; i++) printf("%d ", A[i]); printf("\n"); for (i = 1; i <= N; i++) printf("%d ", B[i]); printf("\n"); fflush(stdout); return 0; }