Hackerrank-Leetcode/GradingStudents.cpp at master · skanda99/Hackerrank-Leetcode · GitHub

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

// problem: "https://www.hackerrank.com/challenges/grading/problem"


#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main()
{
    int n,grade,fgrade[60];
    cin >> n;
    for(int a0 = 0; a0 < n; a0++)
    {
        cin >> grade;
        if(grade<38)
            fgrade[a0]=grade;
        else if((grade%5)>2)
            fgrade[a0]=grade+5-(grade%5);
        else
            fgrade[a0]=grade;
    }

    for(int a0=0;a0<n;a0++)
        cout<<fgrade[a0]<<endl;

    return 0;
}