-
Notifications
You must be signed in to change notification settings - Fork 41
/
1-Demo.cpp
63 lines (48 loc) · 1.55 KB
/
1-Demo.cpp
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
# define ll long long
# define matarani ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
# define arrip(arr) for(ll i=0;i<arr.size();i++){cin>>arr[i];}
# define vstr vector<string>
# define vvstr vector<vector<string>>
# define arrop(arr) for(ll i=0;i<arr.size();i++){cout<<arr[i]<<" ";}
# define vch vector<char>
# define vvch vector<vector<char>>
# define vi vector<ll>
# define vvi vector<vector<ll>>
# define vp vector<pair<ll,ll>>
# define pb push_back
# define finish cout << endl;
#include<bits/stdc++.h>
using namespace std;
ll pairs(ll number)
{
return((number*(number-1))/2);
}
bool isPrime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)return false;
}
return true;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////MAIN LOGIC OF MY CODE IS HERE !!!!!!!!!
void JAIMATADI()
{
ll n;
vi arr(n);
arrip(arr);
arrop(arr);
}
///DON't Forget to say JAIMATADI !!!
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int32_t main() {
matarani;
ll t;
cin >> t;
while (t--) {
JAIMATADI();
}
}