-
Notifications
You must be signed in to change notification settings - Fork 990
/
13thOct-3.java
125 lines (110 loc) · 2.35 KB
/
13thOct-3.java
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
import java.io.*;
import java.util.*;
import java.math.*;
import java.math.BigInteger;
class gcd_Of_Factorial
{
public static void main(String args[])
{
FastReader in=new FastReader();
int N=in.nextInt();
int A[][]=new int[N][N];
set(A,N);
spiral(A,N);
}
static void spiral(int A[][],int N)
{
int row=0, M=N,col = 0;
while (row < N && col < M)
{
for (int i=col; i<N; i++)
{
System.out.print(A[row][i] + " ");
}
row+=1;
for (int i=row; i<M; i++)
{
System.out.print(A[i][N-1] + " ");
}
N--;
if (row<N)
{
for (int i=N-1; i>=col; i--)
{
System.out.print(A[M-1][i] + " ");
}
M--;
}
if (col<N)
{
for (int i=M-1; i>=row; i--)
{
System.out.print(A[i][row-1] + " ");
}
col++;
}
}
}
static void set(int A[][],int N)
{
int x=1;
for(int i=0; i<N; i++)
{
for(int j=0; j<N; j++)
A[i][j]=x++;
}
}
}
//Code For FastReader
//Code For FastReader
//Code For FastReader
//Code For FastReader
class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br=new BufferedReader(new InputStreamReader(System.in));
}
String next()
{
while(st==null || !st.hasMoreElements())
{
try
{
st=new StringTokenizer(br.readLine());
}
catch(IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str="";
try
{
str=br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}