-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_-_Shift.cpp
More file actions
59 lines (54 loc) · 1.36 KB
/
A_-_Shift.cpp
File metadata and controls
59 lines (54 loc) · 1.36 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
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Code ios_base::sync_with_stdio(false);
#define By cin.tie(NULL);
#define Nasif cout.tie(NULL)
#define ll long long int
#define pb push_back
#define mp make_pair
#define Gcd(a, b) __gcd(a, b)
#define Lcm(a, b) (a * b) / Gcd(a, b)
#define mem(a, b) memset(a, b, sizeof(a)) // a is array or vector;b is the value that wants to set
#define show(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> // show(parameters)
void __f(const char *name, Arg1 &&arg1)
{
cout << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args)
{
const char *comma = strchr(names + 1, ',');
cout.write(names, comma - names) << ": " << arg1 << " | ";
__f(comma + 1, args...);
}
int main()
{
Code By Nasif;
int input[500], output[500], count, k, i;
cin >> count >> k;
for (i = 0; i < count; i++)
{
cin >> input[i];
}
for (i = 1; i <= k; i++)
{
if (input[i] <= k)
{
input[i] = 0;
}
}
// Copy numbers from inputArray to outputArray in
// reverse order
for (i = 0; i < count; i++)
{
output[i] = input[count - i - 1];
}
// Print Reversed array
for (i = 0; i < count; i++)
{
cout << output[i] << " ";
}
return 0;
}