Initial commit

Author: ssavi08

.gitignore

@@ -0,0 +1,29 @@
+### IntelliJ IDEA ###
+out/
+!**/src/main/**/out/
+!**/src/test/**/out/
+
+### Eclipse ###
+.apt_generated
+.classpath
+.factorypath
+.project
+.settings
+.springBeans
+.sts4-cache
+bin/
+!**/src/main/**/bin/
+!**/src/test/**/bin/
+
+### NetBeans ###
+/nbproject/private/
+/nbbuild/
+/dist/
+/nbdist/
+/.nb-gradle/
+
+### VS Code ###
+.vscode/
+
+### Mac OS ###
+.DS_Store

.idea/.gitignore

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

.idea/misc.xml

@@ -0,0 +1,52 @@
+package dodatniZad.zad1;
+
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner input = new Scanner(System.in);
+        int n = input.nextInt();
+
+        int[][] a = new int[n][n];
+
+        for(int i=0; i<n; i++){
+            for(int j=0; j<n; j++){
+                a[i][j] = input.nextInt();
+            }
+        }
+
+        int[] sRed = new int[n];
+        int[] sStup = new int[n];
+        int sGd=0, sSd=0;
+
+        for(int i=0; i<n; i++){
+            for(int j=0; j<n; j++){
+                sRed[j] += a[j][i];
+                sStup[i] += a[i][j];
+                if(i == j){
+                    sGd += a[i][j];
+                }
+                if((i+j)==n-1){
+                    sSd += a[i][j];
+                }
+            }
+        }
+        int fd=0;
+
+        for(int i=0; i<n; i++){
+            for(int j=0; j<n; j++){
+                System.out.print(a[i][j]);
+            }
+            System.out.println("");
+        }
+            for(int j=0; j<n; j++){
+               if(sRed[j] == sStup[j] && sStup[j] == sGd && sGd == sSd){
+                   fd=1;
+               }else{
+                   fd=-1;
+               }
+            }
+
+        System.out.println(fd);
+    }
+}

.idea/modules.xml

@@ -0,0 +1,41 @@
+package predrok1.zad1;
+
+import java.util.Scanner;
+
+/*potrebno je napisati program koji ce za kvadratnu matricu A s N redaka i N stupaca koja u sebi ima samo nule i
+jedinice, izracunati koliko ima ponavljanja broja 0, a da su oko njega sve jedinice*/
+public class Main {
+    public static void main(String[] args) {
+
+        Scanner input = new Scanner(System.in);
+
+        int n = input.nextInt();
+        int[][] A = new int[n][n];
+
+        //Unosenje 0 i 1
+        for(int i=0; i<n; i++){
+            for(int j=0; j<n; j++){
+                int unos;
+                do{
+                    A[i][j] = input.nextInt();
+                    unos = A[i][j];
+                }while( unos != 0 && unos != 1 );
+            }
+        }
+
+        System.out.println(String.valueOf(funkcija(A, n)));
+    }
+
+    public static int funkcija(int[][] a, int b){
+        int brojac = 0;
+
+        for(int i=1; i<b-1; i++){
+            for(int j=1; j<b-1; j++){
+                if( a[i][j] == 0 && a[i-1][j-1]==1 && a[i][j-1]==1 && a[i+1][j-1]==1 && a[i-1][j]==1 && a[i+1][j]==1 && a[i-1][j+1]==1 && a[i][j+1]==1 && a[i+1][j+1]==1){
+                    brojac++;
+                }
+            }
+        }
+        return brojac;
+    }
+}

.idea/uiDesigner.xml

@@ -0,0 +1,24 @@
+package predrok1.zad2;
+
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner input = new Scanner(System.in);
+        int n = input.nextInt();
+        int[][] A = new int[n][n];
+
+        for(int i=0; i<n; i++){
+            for(int j=0; j<n; j++){
+                A[i][j] = input.nextInt();
+            }
+        }
+
+        for(int i=0; i<n; i++){
+            Nit nit = new Nit(A, i);
+            nit.start();
+        }
+
+        input.close();
+    }
+}

.idea/vcs.xml

@@ -0,0 +1,21 @@
+package predrok1.zad2;
+
+public class Nit extends Thread{
+    private final int[][] A;
+    private final int redak;
+
+    public Nit(int[][] A, int redak){
+        this.A = A;
+        this.redak = redak;
+    }
+
+    @Override
+    public void run(){
+        int suma = 0;
+
+        for(int stupac : A[redak]){
+            suma = suma + stupac;
+        }
+        System.out.println("Nit "+redak+" suma="+suma);
+    }
+}