Advertisement
Guest User

Untitled

a guest
Jan 22nd, 2018
71
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.67 KB | None | 0 0
  1. package matura;
  2.  
  3. import java.io.File;
  4. import java.io.FileNotFoundException;
  5. import java.io.PrintWriter;
  6. import java.util.Scanner;
  7.  
  8. public class start {
  9.  
  10. /**
  11. * @param args
  12. */
  13. public static void main(String[] args) {
  14. // TODO Auto-generated method stub
  15.  
  16.  
  17. System.out.println("START");
  18. try {
  19. Scanner plik = new Scanner(new File("przyklad.txt"));
  20. PrintWriter wyniki = new PrintWriter(new File("wyniki.txt"));
  21. //System.out.println(plik.next());
  22. int min = 255;
  23. int max = 0;
  24.  
  25. int [][]tab = new int[200][320];
  26. int w = 0;
  27. int k = 0;
  28.  
  29. while(plik.hasNext()){
  30. int piksel = plik.nextInt();
  31. //System.out.println(piksel);
  32. if (piksel > max) max = piksel;
  33. if (piksel < min) min = piksel;
  34. tab[w][k++]=piksel;
  35. if (k>319){
  36. w++;
  37. k=0;
  38. }
  39.  
  40. }
  41.  
  42. for(int i=0; i<200;i++){
  43. for(int j=0;j<320;j++)
  44. System.out.print(tab[i][j]+ " ");
  45. System.out.println("");
  46. }
  47. int ilosc=0;
  48. for(int i=0; i<200;i++)
  49. for(int j=0;j<160;j++)
  50. if(tab[i][j]!=tab[i][319-j]){
  51. ilosc++;
  52. break;
  53. }
  54. int sasiad = 0;
  55. for(int i=0; i<200;i++)
  56. for(int j=0;j<320;j++)
  57. {
  58. if (j-1>0 && (Math.abs(tab[i][j]-tab[i][j-1])>128)){ sasiad ++; break;}
  59.  
  60.  
  61. }
  62.  
  63.  
  64. //zad1
  65.  
  66. System.out.println("min= "+min +" max = "+max);
  67. wyniki.println("min= "+min +" max = "+max);
  68. //zad2
  69. System.out.println("Do usuniecia = "+ilosc);
  70. wyniki.println("Do usuniecia = "+ilosc);
  71.  
  72. wyniki.close();
  73.  
  74.  
  75. } catch (FileNotFoundException e) {
  76. // TODO Auto-generated catch block
  77. e.printStackTrace();
  78. }
  79.  
  80.  
  81.  
  82.  
  83.  
  84. }
  85.  
  86. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement