-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsubarray.cpp
More file actions
87 lines (70 loc) · 1.99 KB
/
subarray.cpp
File metadata and controls
87 lines (70 loc) · 1.99 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
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
//Bismillahir rahmanir rahim
//Arman Hossain C193033
//Programming is nothing but an addiction.
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long;
using vi = vector<int>;
using vll = vector<ll>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sortv sort(v.begin(), v.end())
#define rev_sortv sort(v.begin(), v.end(), greater<int>())
#define inv vi v;for(int i = 0; i < n; ++i){int x;cin >> x; v.pb(x);};
#define out(v) for(int i=0;i<v.size();++i){cout<<v[i]<<" ";}cout<<endl;
#define sz(s) (s).length()
#define all(x) (x).begin(), (x).end()
#define digits(x) trunc(log10(x))+1
#define even(x) (x)%2
#define inn int n;cin>>n;
void practice()
{
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
v.pb(x);
}
// for (int i = 0 ; i < v.size() ; i++)
// {
// for (int j = 1 ; j <= n-i ; ++j)
// {
// for (int k = 0 , m = i ; k < j ; ++k , m++)
// {
// cout << v[m] << " ";
// }
// cout << endl;
// }
// }
for (int i = 0; i < v.size(); ++i)
{
for (int j = i; j < v.size(); ++j)
{
for (int k = i; k <= j; ++k)
{
cout << v[k] << " ";
}
cout << endl;
}
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("F:/io/input.txt", "r", stdin);
freopen("F:/io/output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
practice();
return 0;
}