From aea8d85191565ea5a209c11044dae933e5c8b0ad Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Cezary=20Bary=C5=82ka?= <cezbar@st.amu.edu.pl>
Date: Sun, 8 Jul 2018 22:24:39 +0000
Subject: [PATCH] Zadanie 2
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Program można uruchomić za pomocą polecenia java Main "6" "[1,2,3,0,1]" "[2,4,0,0,2]"
---
 zad2/Main.class                 | Bin 0 -> 2853 bytes
 zad2/Main.java                  |  34 ++++++++++++
 zad2/PolynomialOperations.class | Bin 0 -> 3314 bytes
 zad2/PolynomialOperations.java  |  88 ++++++++++++++++++++++++++++++++
 4 files changed, 122 insertions(+)
 create mode 100644 zad2/Main.class
 create mode 100644 zad2/Main.java
 create mode 100644 zad2/PolynomialOperations.class
 create mode 100644 zad2/PolynomialOperations.java

diff --git a/zad2/Main.class b/zad2/Main.class
new file mode 100644
index 0000000000000000000000000000000000000000..26f5cc38b13f30c9221b2f81c63a43cb9546fa59
GIT binary patch
literal 2853
zcma)8X;%|h7=DH<GlUT^3X0mA;ug}dh}K%5Rz%UXfLKtgDYXL`U}Q2AlL?Bo+Ev@y
z)vjvy&93Lven4u^@spo=`jb3upF2q;nCK}7?tSlj-{pC?%l!4v^&0>-<JSNlKzAi}
zphv;Z0Cu4_fZf;=KnSq_9>)^_^r2r+0}A$veNe%^0G`B<f?*l^1E@i_f&*edsNg9D
zhXi?8h{VP6w1N?_KO-z13DT`zg>g&-Az?~TW)+gKWY{uN68v3;WjNa;c*0EwBzSx5
zgf5|`&#?4?Y;sgj4{M_)Il(@AOfwH?X+xazOs_L(WN4$WUo)&uYA3l%s1L{cj%w3d
ztEpKNtwT=QuqHZ%btPd;8yUl<Ot4gf`dWH|_Lh`Ur<bIi$eOkUDJH>}vdx)Z2^I0e
zVK>buv!-LD1l&ahPu=OXHpA$w;|U3>opn-KCx?haLyk5!)vu-8aAdT|XqRz}7a14x
zu$|Yg50|2C5}rL2ln@xQv*|It*ASj7MJ`%I_$nH)Mn+mi29AW@!L*$@dGlf@Whb<o
z=RzqhttE9QJrlB0Eg_*05~`ubEsdeZ_{L~^bW^k~x^YCD+M}CEw?*4W8f9cvOyjtW
z6DnqKQbiXYmGPX)_Btiwc@?K|M#T#_MR@VH5fv{A(raZ+lfkKY2`@9ko%u@aN~djx
zu<Xuy?Z_HtLg$SXSMds7WvZhgo@nnh&Z;<v*HpZYH^_>rIFC0~yoI+V)b6lthgs25
z{kk)0Co(mDyi<#JYkYXG78g{!j}K&gsNy4hT#HY5>#G$(T*M_6m+`5L&s2PlFNj!V
zg9hi3?HxU;k1>-)tU@V^Su+_&PcnEGTS8r~a)#YH$Tk$E*R>>Db%|?sAzOl+5<({3
z)|D$cTX^w2oS5b46Cy<lOPSGmyo(weW$7UM)v}X@X6{YtY0cpfu+uBU@mM?-b9*Tl
zLe??NR=4eVtvGfeK+aUGsk93@7NXO|%z6e6?&MKFmeow^E(jo(xz47;6wp#B-QqAb
zmy58(L%t7~v8Cbi{!QJQa3<+L+{8dDGucs=pA#?M0fts$k*0i^lxZ+q8_Gc_Km4@G
z!bxaZ@U|4<$~kd!mlG7Pjwo~hU*anX>x&&NRC3>_JWITrU*923L+<lcHV)>}<m<A!
zkQx`kc-9&d^=<9V6O1@FU!?$<wxq^qcxxWuT@2*2SgKFcWed$p1YB_48MiOjmPa^j
z^R@`4LNG2*!uGO=7Alm1MSJ<wOIYE~N-^l$w;VO6@Va`#?0*^GsQ4B?sQ3|QB{a^D
znPE-aQ+jKkmK;rJd{ne?ZOpOLOnVid&%#N@&+P3!+n&lYoodXo^mLD@WimQv;qT(|
z=k4X5r#+gLF!jvZoMLBbk&8GB6o+S0da?Nbzs$M3w{G#&<SqATra5FdIxFsFOD1Lf
zB4J%gn#zSG;r@He@uMWfKk?(?X9E9iab3$(D|d;zFLDjiRT33g$JOsLy;x6L%?V%w
z!aP-?2@!IrES;yZO7bp8Zd`);J1T;nS$MBTJneJvbw#|~{QVK1*ao7_E9W53LFw?i
zWMzl1!AG?~Fwo(@f<S{$-1*(RDnZH(a!{ScqKlA&)gAJms5x{EwZX-+2sU`R1eXZP
zf18p8wUo;&>N*sHX;1_h!t=Nx^<pt;89pdjMA+4+LLGx!#nT#|TKJK*g)&_Tq6bU)
zVOEFzsK*g3!x&cJ0#@P@rA11{5x{oZeGpNmiU~k7^+AoZ%xD|avkGUh5$#Op8l1o;
zQXWbq`7b;QFa79vh&&&??8{r(k6!YlM0kPd9wwz=D{ZcaxB6e|`DHvJ$>?x@JGlb4
z1hexNmUAT{ekSA!L(E>cXw4CCWES<_#4MHtm(QYM4lAxR4*Y>t6}XQ31a*G}m(>z}
zqqAJ~s|glZjpb~bDEIj;XvQ{jL`olXrMKe>_W+%JhoA608t^R7^|Yf=W|WCbxYQ&J
G9Q_ZDd)pfT

literal 0
HcmV?d00001

diff --git a/zad2/Main.java b/zad2/Main.java
new file mode 100644
index 0000000..96e4cb4
--- /dev/null
+++ b/zad2/Main.java
@@ -0,0 +1,34 @@
+import java.util.Arrays;
+
+
+public class Main {
+
+    public static void main(String[] args) {
+        if (args.length == 0) {
+            System.out.println("Proszę podać parametry np. java Main \"6\" \"[1,2,3,0,1]\" \"[2,4,0,0,2]\"");
+            return;
+        }
+        int modulo = Integer.parseInt(args[0]);
+        int[] polyF = stringToArray(args[1]);
+        int[] polyG = stringToArray(args[2]);
+        String multiple = Arrays.toString(PolynomialOperations.multiple(polyF, polyG, modulo));
+        int[] divisionArray = PolynomialOperations.divide(polyF, polyG, modulo);
+        String division;
+        if (divisionArray.length == 0)
+            division = "[0]";
+        else
+            division = Arrays.toString(divisionArray);
+        String nwd = Arrays.toString(PolynomialOperations.NWD(polyF, polyG, modulo));
+        if (nwd.equals("null"))
+            nwd = "DivisionError";
+
+
+        String outputString = "[" + multiple + ", " + division + ", " + nwd + "]";
+        System.out.println(outputString);
+    }
+
+    private static int[] stringToArray(String str) {
+        return Arrays.stream(str.substring(1, str.length() - 1).split(","))
+                .map(String::trim).mapToInt(Integer::parseInt).toArray();
+    }
+}
diff --git a/zad2/PolynomialOperations.class b/zad2/PolynomialOperations.class
new file mode 100644
index 0000000000000000000000000000000000000000..85ee99535514c5d1f3b134f4e8de1a6cdb17d704
GIT binary patch
literal 3314
zcma)8&r=)s75}VO+6A#HpjgBpWRL?6NFd_Y#x*#uZDPkt0L6jexTGnIw4lW+t*Rfy
zr0q;+;#+4rJ+_BrS}wWd;GRO$jCyXTxBdw|^wQ4s>`Cf=-tGp8xK8Ua-yd(^_r1^O
zz4v`z{rTUYwE<kfPop@6ypGq@pK%|>>sXF+ai<S&VokQ|aVWT>W1|Omqv*xkQ9Orx
zGJIc#O&Q*i;RiCjE5i?UZ0Rr+Xjkm2-Mp$motoZI5MFXimV*9eyK1erD%)0l-Q0F4
zi7&fF)7dcVw(J98xLLLv3Wk>7aGisyTd_^2P_yc0({`(kMFl;TmeaIra=v$JGryV7
zPjBWGD0}>q+2-Glf{-WN<)%tNb*sTs3Sw(bvv_~Sta;9KoK+Crv8$z9X0hqksW_FV
zJuyQX$~GBP+!Dt|nICn!3!K#yL>gs#hbH^H*(wQK1xAh2ijR<6%{#&vc=EN@cC$`T
zB;g_Vfs<^kShvikwQ9ZRTM0Mp_sLIdRs^Vm0kc-4S+~@3+;!IzX(fB#mau9&0d|Ez
zLsc0{93o_8Js|YeyRVQ+QNgfdR<=v##Mf<2oToN<OR6IKrqiO)M4;QvX5u9VYt3!d
zi`Fe$!apovzn-Dop1E%tNMK08pseQ{v${K%uQsh+tFB|)KoP_@aKm+*4Tht(Vl~Td
zsnM^&8o&;xT?1v<I`$0Qhhw0E9HmU-*)DsIW9^#G_4;nBVpW?r9~7;cREUDhEHNn;
zw?1xGOXDR=5LUhYz9m_1j8|HX=6KoMx5k@gYrJ7rI56OX+BI+qIRjIeHZUuzZ{s@#
z7G$`9iv|{vQgG_OF(;=EzQXn%oqZ*0HEn0^dcAHQFxeVeTV_SUIE!F<**oJY_;Lx=
zny0ZCMGZgV{h4BJ<bp|onnhu%-~|f1&hE6TMd2@}mv~Vm2D~gI&$iBb-f`<U&0<-M
z{V!8e99q$>9Tav1327vPGhTWL*sks_PH*UF8ff9bz%9IDU<oX~uC&?JefPdKx9n9S
z6L0#(%bU_y>Fjj;nBJCM_kN2P&B#})R(;7a8x4zo|I+O@u;-W1ZRXpt8WaA(MW0eP
zye`R!gX;%1t6Tm5|LD8?=CeVXJRpJPCDU=%?54G-<0lFxJ7sgi^GQAm&U~{T(oD=L
zHgUjU@8%8U_&j%WoE6TI%%@O($3+OIIclCz#W2@$fC?Bvl5;Ock)ni$6_t7#W%n}e
zY<nwQ`aHU-&W97>O#2Ws>U<;-$#OM1n+PW&TkqsDiEu8Ph~&y!g@+O4<0pT680Pp_
z@5n3_pQ9rG=SFJ<@5?`CAJMq#0m|?l5?E2_<k5pO1ahA9CGKBFA6_NQJDl$#=7GLV
z`STd3-WZ|B@DkT!2;-V3l@(z#DrY&%>IJTZ<~>YMFGN2DOj4%e9Hk@BzC=vNi^>=1
zRUTvPF(O|e#MKZr*$@1H-~;N5<)nHwHF}6sBgs^GwDucBQlC6j$@QOc^%H*fDGd=A
zFi4<r3@|-$u1}Mk#5_YYAsQFZsu-kXjI*q=TnW@9W<00@FbY-h^b;4?>`einUvV#h
zCX*jB#g8)W&!a2EmT4zThZvkmWm3tlT*1dS(~0&Of&#&W2}UFPJ~~TyiBB?8sbh$-
zE{Kz?B|n;zjJ81R<H_@sg}fNXpfZS>1o1JAMWuNLC~s3GM27>JBZQNmNnCypErd=z
zM!oN8^wXTgXUNw-b~)gsjc<@N;=t<91McZerhNq6=gle;*12pdS9+SapOQ(kKSx(D
z($zUKnLg&*+r>A1>^zNm!eY-PU#S_NuYu5)=<U$u(-8psMF4Cf`BgR!F+4NV4wq6T
zVwEY#$=|zj;$xd-PI9dEIc6hAU+0gpX_QE{OSw!OW1GNty<CJ@N|#S!3sR9}(D;Ns
zBNaW*NX13QXZ{(fkh0_tFnJDrtI7qUq9yD}qc}wD59qxYkA8~2KMLKeSq}4IHjJ!f
z%2?1+iSTc6Nzx?k;0UpKeOOCGj_|DojSKw<{lgmN1DRp%2!jjSL-mQ*QvQ@lM8YLz
zyHm?Ic)39CI#~|l3N!dJBXyM+zsC$;<7K(dFE{ucE#WoX#2b8_-ey19#BIEbJWNWZ
z<lZEM1xEG?Ps;7s<JzzHJzDg;$6jzHhp_H>Q0Zxvex%=w@rUy@juCoY@^Ybh_u@3v
z!6&>BI!i^Wh5tAS;$9*PB8Xoyf^w15nf6EM$+mf&l}Fk3uQ8a(G7$0A?CZ13A3yn5
zrbGO!7xGo6x8OC$K~gx4H5TbQVZB8t8^^^XSN#S_Nb#iEYkXp9_8Om9x~tbjphlJW
zKvW*^plU9&=0iLhNsiR6bZ)Kxid^g}lZa=Bnhe8DB2Z|CKL(yQQ+~=!`h*$j(p_c<
j{8es4%-I9ZQ5xLG`*@FMR=AgTu}Yl+vs(yOZ=vuXV3BfA

literal 0
HcmV?d00001

diff --git a/zad2/PolynomialOperations.java b/zad2/PolynomialOperations.java
new file mode 100644
index 0000000..5dd3ea2
--- /dev/null
+++ b/zad2/PolynomialOperations.java
@@ -0,0 +1,88 @@
+import java.util.Arrays;
+
+public class PolynomialOperations {
+
+    public static int[] multiple(int[] f, int[] g, int n) {
+        int[] result = new int[f.length + g.length - 1];
+        for (int i = 0; i < f.length; i++)
+            for (int j = 0; j < g.length; j++)
+                result[i + j] += f[i] * g[j];
+
+        for (int i = 0; i < result.length; i++)
+            result[i] = result[i] % n;
+        return result;
+    }
+
+    private static int findFactor(int a, int b, int mod) {
+        for (int i = 0; i < mod; i++)
+            if (a == (b * i) % mod)
+                return i;
+        return Integer.MIN_VALUE;
+    }
+
+    private static int[] shr(int[] p, int shift) {
+        if (shift <= 0)
+            return p;
+        int[] shiftedPoly = new int[p.length];
+        for (int i = 0; i < p.length - shift; i++)
+            shiftedPoly[i] = p[i + shift];
+        return shiftedPoly;
+    }
+
+    private static void polyMultiply(int[] p, int n) {
+        Arrays.stream(p).forEach(value -> value = value * n);
+    }
+
+    private static int[] polySubtract(int[] p, int[] s) {
+        int result[] = Arrays.copyOf(p, p.length);
+        for (int i = 0; i < p.length; ++i) {
+            result[i] = p[i] - s[i];
+        }
+        return result;
+    }
+
+    private static int[] createNewPoly(int[] p, int size) {
+        int[] tmpTab = new int[size];
+        for (int j = 0; j < p.length; j++) {
+            tmpTab[tmpTab.length - 1 - j] = p[p.length - 1 - j];
+        }
+        return tmpTab;
+    }
+
+    private static void applyModuloToTab(int p[], int mod) {
+        Arrays.stream(p).forEach(value -> value = value % mod);
+    }
+
+    public static int[] divide(int[] n, int[] d, int mod) {
+        if (n.length < d.length) {
+            throw new IllegalArgumentException("Numerator and denominator vectors must have the same size");
+        }
+        int nd = n.length - 1;
+        int dd = d.length - 1;
+        int index = 0;
+        int[] tmpTab = createNewPoly(d, n.length);
+        while (nd >= dd) {
+            int factor = findFactor(n[nd], d[dd], mod);
+            tmpTab = shr(tmpTab, index);
+            polyMultiply(tmpTab, factor);
+
+            applyModuloToTab(tmpTab, mod);
+            tmpTab = polySubtract(n, tmpTab);
+            nd--;
+            index++;
+        }
+        return Arrays.copyOf(n, index - 1);
+    }
+
+    public static int[] NWD(int[] a, int[] b, int mod) {
+        if (a.length <= 0 || b.length <= 0)
+            return null;
+
+        while (b.length != 0) {
+            int[] c = divide(a, b, mod);
+            a = b;
+            b = c;
+        }
+        return a;
+    }
+}
\ No newline at end of file