# Answer to Question #33871 in Combinatorics | Number Theory for eka

Question #33871

solve the linear congruence 17x≅9(mod 276), by using Chinese Remainder Theorem.

Expert's answer

#include <stdio.h>

#include <iostream>

using namespace std;

int main()

{

cout << "Enter number of subjects: ";

int n = 0;

cin >> n;

double grad = 0;

cout << endl;

for (int i = 0; i < n; ++i)

{

cout << "Enter grade of " << (i+1) << " subject: ";

double g = 0;

cin >> g;

grad += g;

}

grad /= n;

cout << endl << "Your average is " << grad << endl;

cin.get();

cin.get();

return 0;

}

#include <iostream>

using namespace std;

int main()

{

cout << "Enter number of subjects: ";

int n = 0;

cin >> n;

double grad = 0;

cout << endl;

for (int i = 0; i < n; ++i)

{

cout << "Enter grade of " << (i+1) << " subject: ";

double g = 0;

cin >> g;

grad += g;

}

grad /= n;

cout << endl << "Your average is " << grad << endl;

cin.get();

cin.get();

return 0;

}

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment