-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
60 lines (59 loc) · 1.26 KB
/
C.cpp
File metadata and controls
60 lines (59 loc) · 1.26 KB
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
#include<bits/stdc++.h>
#define vi vector<int>
#define mp map<int,int>
#define ump unordered_map <int,int>
#define ll long long int
#define pb push_back
#define mod 1000000007
#define int long long
#define loop(i,x,n) for(int i=x;i<n;i++)
#define rloop(i,n) for(int i=n-1;i>=0;i--)
#define test int t; cin>>t; while(t--)
using namespace std;
/*************************************************************************************************/
void solve()
{
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,x,y,z,j,k;
cin>>n;
vector<vector<int>> v(n,vector<int>(n,-1));
loop(i,0,n)
cin>>v[i][i];
loop(i,0,n)
{
//cout<<x<<endl;
x=v[i][i]-1;
j=i,k=i;
while (x--)
{
if(k-1>=0 && v[j][k-1]==-1)
{
k--;
v[j][k]=v[i][i];
}
else if(j+1<n && v[j+1][k]==-1)
{
j++;
v[j][k]=v[i][i];
}
else
{
cout<<-1;
return 0;
}
//x--;
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<=i;j++)
cout<<v[i][j]<<' ';
cout<<endl;
}
return 0;
}