{"id":1349,"date":"2015-04-07T22:06:14","date_gmt":"2015-04-07T20:06:14","guid":{"rendered":"http:\/\/www.webotlet.hu\/?p=1349"},"modified":"2019-10-12T23:52:06","modified_gmt":"2019-10-12T21:52:06","slug":"java-programozas-2005-majusi-emelt-informatika-erettsegi-programozasi-feladatanak-megoldasa","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=1349","title":{"rendered":"Java programoz\u00e1s – 2005 m\u00e1jusi emelt informatika \u00e9retts\u00e9gi programoz\u00e1si feladat\u00e1nak megold\u00e1sa"},"content":{"rendered":"

A feladat le\u00edr\u00e1s\u00e1t, melynek a megold\u00e1s\u00e1t k\u00f6zz\u00e9teszem innen<\/a> t\u00f6ltheted le.<\/p>\n

A let\u00f6lthet\u0151<\/a> t\u00f6m\u00f6r\u00edtett \u00e1llom\u00e1nyban megtal\u00e1lod a NetBeans-ben megnyithat\u00f3 projectet. Amennyiben Geany szerkeszt\u0151vel k\u00edv\u00e1nod megtekinteni a megold\u00e1st, akkor t\u00f6r\u00f6ld ki a forr\u00e1sok elej\u00e9r\u0151l a k\u00f6vetkez\u0151 sorokat:<\/p>\n

\r\npackage webotlet_e05maj_lotto;\r\n<\/pre>\n
A megold\u00e1sban csak egy oszt\u00e1ly tal\u00e1lhat\u00f3, mivel a feladat egy k\u00e9tdimenzi\u00f3s t\u00f6mb t\u00edpusfeladat, \u00edgy nincs sz\u00fcks\u00e9g k\u00fcl\u00f6n oszt\u00e1lyra. Akkor l\u00e1ssuk a megold\u00e1st:<\/p>\n
\r\n\/**\r\n *\r\n * @author http:\/\/webotlet.hu\r\n *\/\r\n\r\npackage webotlet_e05maj_lotto;\r\n\r\nimport java.io.*;\r\nimport java.util.Scanner;\r\n\r\npublic class Webotlet_e05maj_lotto\r\n{\r\n  public static void main( String[] args )\r\n  {\r\n    Scanner sc = new Scanner(System.in);\r\n    RandomAccessFile raf;\r\n    String sor;\r\n    int db;\r\n    try\r\n    {\r\n\/\/ 1. feladat\r\n      System.out.print("Ird be az 52. het lottoszamait szokozzel elvalasztva: ");\r\n      String[] het52 = sc.nextLine().split(" ");\r\n      int[] het52sz = new int[5];\r\n      for ( int i = 0; i < het52.length; i++ )\r\n      {\r\n        het52sz[i] = Integer.parseInt(het52[i]);\r\n      }\r\n        \r\n\/\/ 2. feladat\r\n      System.out.println("\\n2. feladat");\r\n      int csere;\r\n      for ( int i = 0; i < het52sz.length-1; i++ )\r\n      {\r\n        for ( int j = i+1; j < het52sz.length; j++ )\r\n        {\r\n          if( het52sz[i] > het52sz[j] )\r\n          {\r\n            csere = het52sz[i];\r\n            het52sz[i] = het52sz[j];\r\n            het52sz[j] = csere;\r\n          }\r\n        }\r\n      }\r\n      \r\n      for( int sz : het52sz )\r\n      {\r\n        System.out.print(sz+" ");\r\n      }\r\n      System.out.println();\r\n\r\n\/\/ 3. feladat\r\n      System.out.println("\\n3. feladat");\r\n      System.out.println("Adj meg egy szamot (1-51): ");\r\n      int het = sc.nextInt(); \r\n\r\n\/\/ 4. feladat      \r\n      int[][] szamok = new int[52][5];\r\n      raf = new RandomAccessFile("lottosz.dat","r");\r\n      db = 0;\r\n      String[] heti;\r\n      for( sor = raf.readLine(); sor != null; sor = raf.readLine() )\r\n      {\r\n        heti = sor.split(" ");\r\n        for( int i = 0; i < heti.length; i++ )\r\n        {\r\n          szamok[db][i] = Integer.parseInt(heti[i]);\r\n        }\r\n        db++;\r\n      }\r\n      \r\n      System.out.println("A "+het+". het nyeroszamai: ");\r\n      for( int i = 0; i < szamok[het-1].length; i++ )\r\n      {\r\n        System.out.print(szamok[het-1][i]+" ");\r\n      }\r\n      System.out.println();\r\n      \r\n\/\/ 5. feladat\r\n      System.out.println("\\n5. feladat");\r\n      int[] szamokDb = new int[90];\r\n\/\/ az 52. h\u00e9t adatait egyel\u0151re kihagyjuk, az\u00e9rt -1\r\n      for( int i = 0; i < szamok.length-1; i++ )\r\n      {\r\n        for( int j = 0; j < szamok[i].length; j++ )\r\n        {\r\n          szamokDb[szamok[i][j]-1]++;\r\n        }\r\n      }\r\n      boolean van = false;\r\n      for( int sz : szamokDb )\r\n      {\r\n        if( sz == 0 )\r\n        {\r\n          van = true;\r\n          break;\r\n        }\r\n      }\r\n\r\n      if( van )\r\n      {\r\n        System.out.println("Van");\r\n      }\r\n      else\r\n      {\r\n        System.out.println("Nincs");\r\n      }\r\n      \r\n\/\/ 6. feladat\r\n      System.out.println("\\n6. feladat");\r\n      int paratlan = 0;\r\n\/\/ kettes\u00e9vel l\u00e9pked\u00fcnk a megsz\u00e1molt sz\u00e1mokon, hogy csak\r\n\/\/ a p\u00e1ratlanok darabsz\u00e1mait adjuk \u00f6ssze\r\n      for( int i = 0; i < szamokDb.length; i += 2 )\r\n      {\r\n        paratlan += szamokDb[i];\r\n      }\r\n      System.out.println("A fajlban levo szamok alapjan "+paratlan+\r\n                         " alkalommal huztak paratlan szamot");\r\n\r\n\/\/ 7. feladat\r\n\/\/ az 52. h\u00e9t sz\u00e1mait hozz\u00e1f\u0171zz\u00fck a t\u00f6bbihez\r\n      for( int i = 0; i < het52sz.length; i++ )\r\n      {\r\n        szamok[51][i] = het52sz[i];\r\n      }\r\n\r\n      RandomAccessFile ki = new RandomAccessFile("lotto52.ki","rw");\r\n\/\/ ha esetleg l\u00e9tezne a f\u00e1jl, t\u00f6r\u00f6lj\u00fck a tartalm\u00e1t\r\n      ki.setLength(0);\r\n\r\n      StringBuilder sb = new StringBuilder();\r\n      \r\n      for( int i = 0; i < szamok.length; i++ )\r\n      {\r\n        for ( int j = 0; j < szamok[i].length; j++ )\r\n        {\r\n          sb.append(szamok[i][j]+ " ");\r\n        }\r\n        sb.append("\\n");\r\n      }\r\n      \r\n      ki.writeBytes( sb.toString().replaceAll(" \\n", "\\n") );\r\n\r\n\/\/ 8. feladat\r\n      System.out.println("\\n8. feladat");\r\n      sb = new StringBuilder();\r\n      for( int i = 0; i < szamokDb.length; i++ )\r\n      {\r\n        sb.append(szamokDb[i]+" ");\r\n        if( (i+1) % 15 == 0 )\r\n        {\r\n          sb.append("\\n");\r\n        }\r\n      }\r\n      System.out.println(sb.toString().replaceAll(" \\n", "\\n"));\r\n      \r\n\/\/ 9. feladat\r\n      System.out.println("\\n9. feladat");\r\n      System.out.print("A kovetkezo primszamokat nem huztak ki: ");\r\n      int[] primek = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89 };\r\n\r\n\/\/ a kezzel beirt 52. het szamainak hozzaszamolasa az eddigiekhez\r\n      for( int i = 0; i < het52sz.length; i++ )\r\n      {\r\n        szamokDb[het52sz[i]-1]++;\r\n      }\r\n      \r\n      for( int sz : primek )\r\n      {\r\n        if( szamokDb[sz-1] == 0 )\r\n        {\r\n          System.out.print(sz+" ");\r\n        }\r\n      }\r\n    }\r\n    catch( IOException e )\r\n    {\r\n      System.err.println("HIBA");\r\n    }\r\n  }\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"
A feladat le\u00edr\u00e1s\u00e1t, melynek a megold\u00e1s\u00e1t k\u00f6zz\u00e9teszem innen t\u00f6ltheted le. A let\u00f6lthet\u0151 t\u00f6m\u00f6r\u00edtett \u00e1llom\u00e1nyban megtal\u00e1lod a NetBeans-ben megnyithat\u00f3 projectet. Amennyiben Geany szerkeszt\u0151vel k\u00edv\u00e1nod megtekinteni a megold\u00e1st, akkor t\u00f6r\u00f6ld ki a forr\u00e1sok elej\u00e9r\u0151l a k\u00f6vetkez\u0151 sorokat: package webotlet_e05maj_lotto; A megold\u00e1sban csak Tov\u00e1bb   Java programoz\u00e1s – 2005 m\u00e1jusi emelt informatika \u00e9retts\u00e9gi programoz\u00e1si feladat\u00e1nak megold\u00e1sa<\/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":[27,107,109,22,86,143],"class_list":["post-1349","post","type-post","status-publish","format-standard","hentry","category-java-emelt-erettsegi-feladatok","tag-alap-algoritmusok","tag-emelt-erettsegi","tag-emelt-informatika-erettsegi","tag-fajlkezeles","tag-java","tag-programozas"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1349","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=1349"}],"version-history":[{"count":8,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1349\/revisions"}],"predecessor-version":[{"id":2632,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1349\/revisions\/2632"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1349"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1349"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1349"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}