Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package matura;
- import java.io.File;
- import java.io.FileNotFoundException;
- import java.io.PrintWriter;
- import java.util.Scanner;
- public class start {
- /**
- * @param args
- */
- public static void main(String[] args) {
- // TODO Auto-generated method stub
- System.out.println("START");
- try {
- Scanner plik = new Scanner(new File("przyklad.txt"));
- PrintWriter wyniki = new PrintWriter(new File("wyniki.txt"));
- //System.out.println(plik.next());
- int min = 255;
- int max = 0;
- int [][]tab = new int[200][320];
- int w = 0;
- int k = 0;
- while(plik.hasNext()){
- int piksel = plik.nextInt();
- //System.out.println(piksel);
- if (piksel > max) max = piksel;
- if (piksel < min) min = piksel;
- tab[w][k++]=piksel;
- if (k>319){
- w++;
- k=0;
- }
- }
- for(int i=0; i<200;i++){
- for(int j=0;j<320;j++)
- System.out.print(tab[i][j]+ " ");
- System.out.println("");
- }
- int ilosc=0;
- for(int i=0; i<200;i++)
- for(int j=0;j<160;j++)
- if(tab[i][j]!=tab[i][319-j]){
- ilosc++;
- break;
- }
- int sasiad = 0;
- for(int i=0; i<200;i++)
- for(int j=0;j<320;j++)
- {
- if (j-1>0 && (Math.abs(tab[i][j]-tab[i][j-1])>128)){ sasiad ++; break;}
- }
- //zad1
- System.out.println("min= "+min +" max = "+max);
- wyniki.println("min= "+min +" max = "+max);
- //zad2
- System.out.println("Do usuniecia = "+ilosc);
- wyniki.println("Do usuniecia = "+ilosc);
- wyniki.close();
- } catch (FileNotFoundException e) {
- // TODO Auto-generated catch block
- e.printStackTrace();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement