{"id":2982,"date":"2019-12-18T11:11:54","date_gmt":"2019-12-18T10:11:54","guid":{"rendered":"https:\/\/www.webotlet.hu\/?p=2982"},"modified":"2019-12-18T11:15:24","modified_gmt":"2019-12-18T10:15:24","slug":"java-programozas-2018-oktoberi-emelt-informatika-erettsegi-kerites-1-verzio","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=2982","title":{"rendered":"Java programoz\u00e1s \u2013 2018 okt\u00f3beri emelt informatika \u00e9retts\u00e9gi \u2013 ker\u00edt\u00e9s (1. verzi\u00f3)"},"content":{"rendered":"

A feladat le\u00edr\u00e1s\u00e1t, melynek a megold\u00e1s\u00e1t k\u00f6zz\u00e9teszem innen<\/a> t\u00f6ltheted le. Ez a megold\u00e1s t\u00f6mbbel dolgozik. Nem a legszebb megold\u00e1som, de az alap Java ismeretekkel, ameddig 1 tan\u00e9v alatt eljutunk, megoldhat\u00f3 a feladat. A t\u00f6bbi megold\u00e1s m\u00e1r t\u00f6bb helyen is egyszer\u0171s\u00edteni fog.<\/p>\n

Adatt\u00e1rol\u00f3 oszt\u00e1ly:<\/p>\n

\r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_18okt_kerites;\r\n\r\npublic class Telek\r\n{\r\n  private int oldal;\r\n  private int szel;\r\n  private char szin;\r\n  \r\n  private int szam;\r\n  private boolean festett;\r\n  \r\n  public Telek(String[] tomb)\r\n  {\r\n    oldal = Integer.parseInt(tomb[0]);\r\n    szel = Integer.parseInt(tomb[1]);\r\n    szin = tomb[2].charAt(0);\r\n  }\r\n\r\n  public int getOldal()\r\n  {\r\n    return oldal;\r\n  }\r\n\r\n  public int getSzel()\r\n  {\r\n    return szel;\r\n  }\r\n\r\n  public char getSzin()\r\n  {\r\n    return szin;\r\n  }\r\n\r\n  public int getSzam()\r\n  {\r\n    return szam;\r\n  }\r\n\r\n  public void setSzam(int szam)\r\n  {\r\n    this.szam = szam;\r\n  }\r\n\r\n  @Override\r\n  public String toString()\r\n  {\r\n    return "Telek{" + "oldal=" + oldal + ", szel="\r\n      + szel + ", szin=" + szin + ", szam=" + szam + '}';\r\n  }\r\n}\r\n<\/pre>\n
A feladat megold\u00e1sai:<\/p>\n
\r\n\/**\r\n *\r\n * @author https:\/\/webotlet.hu\r\n *\/\r\npackage webotlet_18okt_kerites;\r\n\r\nimport java.io.IOException;\r\nimport java.io.RandomAccessFile;\r\nimport java.util.Scanner;\r\n\r\npublic class Webotlet_18okt_kerites\r\n{\r\n\r\n  public static void main(String[] args)\r\n  {\r\n    Telek[] telkek = null;\r\n    \r\n    try\r\n    {\r\n      RandomAccessFile raf = new RandomAccessFile("kerites.txt", "r");\r\n      String sor;\r\n      int db = 0;\r\n      for( sor = raf.readLine(); sor != null; sor = raf.readLine() )\r\n      {\r\n        db++;\r\n      }\r\n      telkek = new Telek[db];\r\n      raf.seek(0);\r\n      int hely = 0;\r\n      for( sor = raf.readLine(); sor != null; sor = raf.readLine() )\r\n      {\r\n        telkek[hely] = new Telek(sor.split(" "));\r\n        hely++;\r\n      }\r\n      raf.close();\r\n    }\r\n    catch( IOException e )\r\n    {\r\n      System.out.println("HIBA");\r\n    }\r\n    \r\n    System.out.println("2. feladat");\r\n    System.out.println("Az eladott telkek szama: " + telkek.length);\r\n    System.out.println();\r\n    \r\n    System.out.println("3. feladat");\r\n    \/\/ hazszamok kiosztasa\r\n    int paratlanSzam = 1;\r\n    int parosSzam = 2;\r\n    for( int i = 0; i < telkek.length; i++ )\r\n    {\r\n      if( telkek[i].getOldal() == 0 )\r\n      {\r\n        telkek[i].setSzam(parosSzam);\r\n        parosSzam += 2;\r\n      }\r\n      else\r\n      {\r\n        telkek[i].setSzam(paratlanSzam);\r\n        paratlanSzam += 2;\r\n      }\r\n    }\r\n    \r\n\/\/    for( int i = 0; i < telkek.length; i++ )\r\n\/\/    {\r\n\/\/      System.out.println(telkek[i].toString());\r\n\/\/    }\r\n    \r\n    if( telkek[telkek.length - 1].getOldal() == 0 )\r\n    {\r\n      System.out.println("A paros oldalon adtak el az utolso telket.");\r\n    }\r\n    else\r\n    {\r\n      System.out.println("A paratlan oldalon adtak el az utolso telket.");\r\n    }\r\n    \r\n    System.out.println("Az utolso telek hazszama: " + telkek[telkek.length - 1].getSzam());\r\n    System.out.println();\r\n    \r\n    System.out.println("4. feladat");\r\n    int paratlanDb = 0;\r\n    for( int i = 0; i < telkek.length; i++ )\r\n    {\r\n      if( telkek[i].getOldal() == 1 )\r\n      {\r\n        paratlanDb++;\r\n      }\r\n    }\r\n    \r\n    Telek[] paratlanok = new Telek[paratlanDb];\r\n    int hely = 0;\r\n    for( int i = 0; i < telkek.length; i++ )\r\n    {\r\n      if( telkek[i].getOldal() == 1 )\r\n      {\r\n        paratlanok[hely] = telkek[i];\r\n        hely++;\r\n      }\r\n    }\r\n    \r\n    for( int i = 0; i < paratlanok.length - 1; i++ )\r\n    {\r\n      if( paratlanok[i].getSzin() != ':' && paratlanok[i].getSzin() != '#'\r\n        && paratlanok[i].getSzin() == paratlanok[i + 1].getSzin() )\r\n      {\r\n        System.out.println("A szomszedossal egyezik a kerites szine: "\r\n          + paratlanok[i].getSzam());\r\n        break;\r\n      }\r\n    }\r\n    System.out.println();\r\n    \r\n    System.out.println("5. feladat");\r\n    Telek[] parosok = new Telek[telkek.length - paratlanDb];\r\n    hely = 0;\r\n    for( int i = 0; i < telkek.length; i++ )\r\n    {\r\n      if( telkek[i].getOldal() == 0 )\r\n      {\r\n        parosok[hely] = telkek[i];\r\n        hely++;\r\n      }\r\n    }\r\n    \r\n    Scanner sc = new Scanner(System.in);\r\n    System.out.print("Adjon meg egy hazszamot! ");\r\n    int szam = sc.nextInt();\r\n    int idx = -1;\r\n    char allapot;\r\n    String hasznalt = "";\r\n    if( szam % 2 == 0 )\r\n    {\r\n      idx = szam \/ 2 - 1;\r\n      allapot = parosok[idx].getSzin();\r\n      hasznalt += allapot;\r\n      if( idx > 0 )\r\n      {\r\n        hasznalt += parosok[idx - 1].getSzin();\r\n      }\r\n      if( idx < parosok.length - 1 )\r\n      {\r\n        hasznalt += parosok[idx + 1].getSzin();\r\n      }\r\n    }\r\n    else\r\n    {\r\n      idx = szam \/ 2;\r\n      allapot = paratlanok[idx].getSzin();\r\n      hasznalt += allapot;\r\n      if( idx > 0 )\r\n      {\r\n        hasznalt += paratlanok[idx - 1].getSzin();\r\n      }\r\n      if( idx < parosok.length - 1 )\r\n      {\r\n        hasznalt += paratlanok[idx + 1].getSzin();\r\n      }\r\n    }\r\n    System.out.println("A kerites szine \/ allapota: " + allapot);\r\n    String szinek = "ABCDEFGH";\r\n    \r\n    for( int i = 0; i < szinek.length(); i++ )\r\n    {\r\n      if( !hasznalt.contains(""+szinek.charAt(i)))\r\n      {\r\n        System.out.println("Lehetseges festesi szin: " + szinek.charAt(i));\r\n        break;\r\n      }\r\n    }\r\n    \r\n\/\/    for( int i = 0; i < paratlanok.length; i++ )\r\n\/\/    {\r\n\/\/      System.out.println(paratlanok[i].toString());\r\n\/\/    }\r\n    \r\n    \/\/ 6. feladat\r\n    try\r\n    {\r\n      RandomAccessFile ki = new RandomAccessFile("utcakep.txt", "rw");\r\n      ki.setLength(0);\r\n\r\n      for( int i = 0; i < paratlanok.length; i++ )\r\n      {\r\n        for( int j = 0; j < paratlanok[i].getSzel(); j++ )\r\n        {\r\n          ki.writeBytes(""+paratlanok[i].getSzin());\r\n        }\r\n      }\r\n      ki.writeBytes("\\n");\r\n\r\n      for( int i = 0; i < paratlanok.length; i++ )\r\n      {\r\n        ki.writeBytes(""+paratlanok[i].getSzam());\r\n        int start = 1;\r\n        if( paratlanok[i].getSzam() > 9 )\r\n        {\r\n          start++;\r\n        }\r\n        if( paratlanok[i].getSzam() > 99 )\r\n        {\r\n          start++;\r\n        }\r\n        for( int j = start; j < paratlanok[i].getSzel(); j++ )\r\n        {\r\n          ki.writeBytes(" ");\r\n        }\r\n      }\r\n      ki.writeBytes("\\n");\r\n      ki.close();\r\n    }\r\n    catch( IOException e )\r\n    {\r\n      System.out.println("HIBA");\r\n    }\r\n  }\r\n}\r\n<\/pre>\n
Ha hib\u00e1t tal\u00e1lsz benne, k\u00e9rlek jelezd!<\/p>\n","protected":false},"excerpt":{"rendered":"
A feladat le\u00edr\u00e1s\u00e1t, melynek a megold\u00e1s\u00e1t k\u00f6zz\u00e9teszem innen t\u00f6ltheted le. Ez a megold\u00e1s t\u00f6mbbel dolgozik. Nem a legszebb megold\u00e1som, de az alap Java ismeretekkel, ameddig 1 tan\u00e9v alatt eljutunk, megoldhat\u00f3 a feladat. A t\u00f6bbi megold\u00e1s m\u00e1r t\u00f6bb helyen is egyszer\u0171s\u00edteni Tov\u00e1bb   Java programoz\u00e1s \u2013 2018 okt\u00f3beri emelt informatika \u00e9retts\u00e9gi \u2013 ker\u00edt\u00e9s (1. verzi\u00f3)<\/span>→<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[106],"tags":[108,107,109,86,144,143,183,25,26,15],"class_list":["post-2982","post","type-post","status-publish","format-standard","hentry","category-java-emelt-erettsegi-feladatok","tag-emelt","tag-emelt-erettsegi","tag-emelt-informatika-erettsegi","tag-java","tag-java_programozas","tag-programozas","tag-programozas-feladat","tag-randomaccessfile","tag-szovegfajl","tag-tomb"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/2982","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2982"}],"version-history":[{"count":4,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/2982\/revisions"}],"predecessor-version":[{"id":2988,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/2982\/revisions\/2988"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2982"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2982"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2982"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}