#114253 (C#(csc)) No.401 数字の渦巻き

• 問題: No.401 数字の渦巻き
• ユーザー: YoshiRyu
• 提出日時: 2016-09-01 15:50:25
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 22 ms / 2,000 ms
• コード長: 3,282 bytes
• コンパイル時間: 2,953 ms
• コンパイル使用メモリ: 106,624 KB
• 実行使用メモリ: 17,792 KB
• 最終ジャッジ日時: 2024-11-15 16:44:45
• 合計ジャッジ時間: 4,208 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
other	AC * 30

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
using System;
using System.Collections.Generic;
using System.IO;
 
public class Test
{
    public static void Solve()
    {
        int N = MyConsole.Int();
        int[,] ans = new int[N, N];
        int Row = 0;
        int Col = 0;
        int Step = N;
        int OutputCounter = 1;
        // 一行目だけ先行処理
        while (OutputCounter <= N)
        {
            ans[Row, Col] = OutputCounter++;
            Col++;
        }
        Col--;
        bool ptrSwitch = true;
        // 進む回数をデクリメントしながら繰り返し処理
        while (Step-- > 0)
        {
            int cnt = 0;
            if (ptrSwitch == true)
            {
                // ↓
                for ( ; cnt < Step ; cnt++)
                {
                    Row++;
                    ans[Row, Col] = OutputCounter++;
                }
                // ←
                for (cnt = 0 ; cnt < Step ; cnt++)
                {
                    Col--;
                    ans[Row, Col] = OutputCounter++;
                }
            }
            else
            {
                // ↑
                for ( ; cnt < Step ; cnt++)
                {
                    Row--;
                    ans[Row, Col] = OutputCounter++;
                }
                // →
                for (cnt = 0 ; cnt < Step ; cnt++)
                {
                    Col++;
                    ans[Row, Col] = OutputCounter++;
                }
            }
            // パターンフラグをひっくり返す
            ptrSwitch = !ptrSwitch;
        }
        // 排出
        for (Row = 0 ; Row < N ; Row++)
        {
            for (Col = 0 ; Col < N - 1 ; Col++)
                Console.Write( "{0:D3} ", ans[Row, Col] );    // 半角スペース付き
            Console.WriteLine( "{0:D3}", ans[Row, Col] );     // スペース付けない＋改行
        }
    }
 
    public static void Main()
    {
        MyConsole.Read(); Solve(); MyConsole.Finish();
    }
}
 
public static class MyConsole
{
    private static List<string> ReadedLine = new List<string>();
    private static char[] buf = new char[1024];
    private static int i;
 
    public static void Read()
    {
        TextReader sr = Console.In;
 
        int Len = sr.Read( buf, 0, 1024 );
        var Line = string.Empty;
 
        for (int i = 0 ; i < Len ; i++)
        {
            if (buf[i] >= 33 && buf[i] <= 126)
            {
                Line += buf[i];
            }
            else if (Line.Length > 0)
            {
                ReadedLine.Add( Line );
                Line = string.Empty;
            }
 
        }
        if (Line.Length > 0) ReadedLine.Add( Line );
 
        Console.SetOut( new StreamWriter( Console.OpenStandardOutput() ) { AutoFlush = false } );
    }
 
    public static string String() { return ReadedLine[i++]; }
    public static int Int() { return int.Parse( ReadedLine[i++] ); }
    public static long Long() { return long.Parse( ReadedLine[i++] ); }
    public static double Double() { return double.Parse( ReadedLine[i++] ); }
 
    public static void wLine( string output = null )
    {
        Console.WriteLine( output );
    }
 
    public static void Finish()
    {
        Console.Out.Flush();
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX