forked from dishanp/Algorithms-For-Software-Developers
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGrading Students.cpp
89 lines (67 loc) · 1.61 KB
/
Grading Students.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
83
84
85
86
87
88
89
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
/*
* Complete the 'gradingStudents' function below.
*
* The function is expected to return an INTEGER_ARRAY.
* The function accepts INTEGER_ARRAY grades as parameter.
*/
int mul(int n){
while(n%5!=0)
{
++n;
}
return n;
}
vector<int> gradingStudents(vector<int> g) {
int n=g.size();
for(int i=0;i<n;i++){
if(g[i]<38)
continue;
if(mul(g[i])-g[i]<3)
g[i]=mul(g[i]);
}
return g;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string grades_count_temp;
getline(cin, grades_count_temp);
int grades_count = stoi(ltrim(rtrim(grades_count_temp)));
vector<int> grades(grades_count);
for (int i = 0; i < grades_count; i++) {
string grades_item_temp;
getline(cin, grades_item_temp);
int grades_item = stoi(ltrim(rtrim(grades_item_temp)));
grades[i] = grades_item;
}
vector<int> result = gradingStudents(grades);
for (size_t i = 0; i < result.size(); i++) {
fout << result[i];
if (i != result.size() - 1) {
fout << "\n";
}
}
fout << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}