Professional Documents
Culture Documents
Tugas Algoritma Ulfani
Tugas Algoritma Ulfani
Nim:230401383
#include <iostream>
#include <string>
using namespace std;
int main() {
int nt[20], nq[20], nmid[20], nuas[20];
string nmhs[20];
int i, n = 0, na;
char mad = 'y';
i = 0;
while (i < n) {
cout << "| " << i + 1 << " ";
cout << "| " << nmhs[i] << " ";
cout << "| " << nt[i] << " ";
cout << "| " << nq[i] << " ";
cout << "| " << nmid[i] << " ";
cout << "| " << nuas[i] << " ";
na = 0.1 * nt[i] + 0.1 * nq[i] + 0.4 * nmid[i] + 0.4 * nuas[i];
char nh;
if (na > 85 && na <= 100)
nh = 'A';
else if (na > 75 && na <= 84)
nh = 'B';
else if (na > 65 && na < 55)
nh = 'C';
else if (na > 40 && na <= 54)
nh = 'D';
else if (na >= 0 && na <= 40)
nh = 'E';
cout << "| " << na << " ";
cout << "| " << nh << " |" << endl;
i++;
}
return 0;
}