-
Notifications
You must be signed in to change notification settings - Fork 1
/
tugas2praktikum.cpp
82 lines (65 loc) · 1.21 KB
/
tugas2praktikum.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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
// #1
double cube (int length, int width) {
return length * width;
}
double cube (int length, int width, int height) {
return length * width * height;
}
// #2
void swap(int *arr, int a, int b) {
int tmp = arr[a];
arr[a] = arr[b];
arr[b] = tmp;
}
void print(int *arr, int sz) {
for (int i = 0; i < sz; ++i) {
cout << arr[i] << " ";
}
}
// #3
#include <iostream>
#include <string>
using namespace std;
int main ()
{
int n;
cin >> n;
cin.ignore();
string str;
for (int i = 0; i < n; ++i) {
getline(cin, str);
cout << str << " " << str.size() << endl;
}
}
// #4
void sum (int *p, int size) {
long long sum = 0;
for (int i = 0; i < size; ++i) {
sum += *p;
++p;
}
cout << sum << endl;
}
// #5
string balik (string str) {
string res;
int sz = str.size();
for (int i = 0; i < sz; ++i) {
res.push_back(str[sz-i-1]);
}
return res;
}
// #6
int search(int *arr, int query, int sz)
{
int index = 0;
while (index < sz) {
if (arr[index] == query) {
index = index;
break;
}
++index;
}
if (index == sz) return -1;
return index;
}