Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- const int v = 5;
- void Unos(int[][v]);
- void Ispis(int[][v]);
- void Euklid(int[][v]);
- int main() {
- int niz[v][v];
- Unos(niz);
- Ispis(niz);
- Euklid(niz);
- system("pause>0");
- return 0;
- }
- void Unos(int niz[][v]) {
- int prvi = 0, drugi = 1, sljedeci = 0;
- for (int i = 0; i < v; i++) {
- for (int j = 0; j < v; j++) {
- prvi = drugi;
- drugi = sljedeci;
- sljedeci = prvi + drugi;
- niz[j][i] = drugi;
- }
- }
- }
- void Ispis(int niz[][v]) {
- for (int i = 0; i < v; i++) {
- for (int j = 0; j < v; j++) {
- cout << niz[i][j] << " ";
- }
- cout << endl;
- }
- cout << endl;
- }
- void Euklid(int niz[][v]) {
- int a, b, p, nzd;
- for (int i = 0; i < v; i++) {
- for (int j = 0; j < v; j++) {
- if (i == v / 2 + 1 && j == v / 2 - 1) {
- break;
- }
- a = niz[i][j];
- b = niz[v - i - 1][v - j - 1];
- while (b > 0) {
- p = a;
- a = b;
- b = p % a;
- }
- nzd = a;
- cout << "Najveci zajednicki djelitelj za " << niz[i][j] << " i " << niz[v - i - 1][v - j - 1] << " je " << nzd << endl;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement