Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class g27s18974{
- public static void main(String [] args){
- {
- //zad 1
- System.out.println("zad 1");
- int tab1[] = new int[(int)(Math.random()*10+1)];
- int tab2[] = new int[(int)(Math.random()*10+1)];
- int tab3[] = new int[(int)(Math.random()*10+1)];
- for(int i = 0; i<tab1.length; i++)
- tab1[i] = (int)(Math.random()*10);
- for(int i = 0; i<tab2.length; i++)
- tab2[i] = (int)(Math.random()*10);
- for(int i = 0; i<tab3.length; i++)
- tab3[i] = (int)(Math.random()*10);
- System.out.println( "Dlugosc tablic od pierwszej do trzeciej: " + tab1.length + " " + tab2.length + " " + tab3.length);
- int tab4[][] = {tab1, tab2, tab3};
- for(int i = 0; i< tab4.length;i++){
- for(int j = 0; j < tab4[i].length; j++){
- System.out.print(tab4[i][j]+ " " );
- }
- System.out.println();
- }
- System.out.println();
- }
- // zad 2
- System.out.println("zad 2");
- {
- int tab[][] = new int[8][8];
- int tab2[] = new int [11];
- boolean flaga = false;
- for(int i = 0; i<tab.length; i++)
- for(int j = 0; j<tab[i].length; j++)
- tab[i][j] = (int)(Math.random()*10);
- for(int i = 0; i<tab.length; i++)
- System.out.print(tab[i][i] + " ");
- System.out.println();
- for(int i = 0; i<tab.length; i++)
- System.out.print(tab[i][tab[i].length -1 - i] + " ");
- System.out.println();
- for(int i = 0; i<tab.length; i++){
- tab2[tab[i][i]]++;
- tab2[tab[i][tab.length -1-i]]++;
- }
- for(int i = 0; i < tab2.length; i++)
- if(tab2[i] >=3)
- flaga = true;
- System.out.println(flaga);
- }
- // zad 3
- {
- System.out.println("zad 3");
- char [] [] tab = { {'S' , 'a' , 'm' , 's' , 'u' , 'n' , 'g'} ,
- {'N' , 'o' , 'k' , 'i' , 'a'} ,
- {'A' , 'p' , 'p' , 'l' , 'e' } ,
- {'B' , 'l' , 'a' , 'c' , 'k' , 'B' , 'e' , 'r' , 'r' , 'y'} ,
- {'A' , 'l' , 'c' , 'a' , 't' , 'e' , 'l'} ,
- {'S' , 'o' , 'n' , 'y'} ,
- {'J' , 'o' , 'l' , 'l' , 'a'} };
- /* for(int i = 0; i < tab.length; i++){
- for(int j = 0; j<tab[i].length; j++)
- System.out.print(tab[i][j]);
- System.out.println();
- }
- */
- int[] res = new int[tab.length];
- boolean flaga;
- for(int i = 0; i < tab.length; i++){
- flaga = false;
- for(int j = 0; j < tab[i].length; j++)
- for(int v = 0; v < tab[i].length; v++)
- if(j !=v)
- if(tab[i][j] == tab[i][v] || (tab[i][j] == (char)((int)(tab[i][v] + 'a' - 'A' ))) || (tab[i][j] == (char)((int)(tab[i][v] - 'a' + 'A' )))){
- flaga = true;
- }
- if(flaga==true)
- res[i]++;
- System.out.println(flaga);
- }
- System.out.println();
- int sum = 0;
- for(int i = 0; i < tab.length; i++){
- sum = 0;
- for(int j = 0; j < tab[i].length; j++)
- sum += tab[i][j];
- if(sum > 255){
- System.out.println(true);
- res[i]++;
- }
- else
- System.out.println(false);
- }
- System.out.println();
- boolean flaga2;
- for(int i = 0; i < tab.length; i++){
- flaga2 = false;
- for(int j = 0; j < tab[i].length; j++)
- if(tab[i][j] == 'i'){
- flaga2 = true;
- }
- if(flaga2==true)
- res[i]++;
- System.out.println(flaga2);
- }
- System.out.println();
- boolean flaga3;
- for(int i = 0; i < tab.length; i++){
- flaga3 = false;
- for(int j = 0; j < tab[i].length; j++)
- for(int v = 0; v < tab[i].length; v++)
- if(j !=v)
- if(tab[i][j] == tab[i][v])
- flaga3 = true;
- if(flaga3==true)
- res[i]++;
- System.out.println(flaga3);
- }
- System.out.println();
- for(int i = 0; i < tab.length; i++){
- if(res[i]>2){
- System.out.print(res[i] + " ");
- for(int j = 0; j < tab[i].length ; j++)
- System.out.print(tab[i][j]);
- System.out.println();
- }
- }
- }
- //zad 4
- {
- System.out.println();
- int tmp;
- int tab[][] = new int [10][10];
- for(int i = 0; i < tab.length; i++)
- for(int j = 0; j < tab[i].length; j++)
- tab[i][j] = (int) (Math.random()*10);
- for(int i = 0; i < tab.length; i++){
- for(int j = 0; j < tab[i].length ; j++)
- for(int v = 0; v < tab[i].length -1; v++)
- if(tab[i][v] > tab[i][v+1] ){
- tmp = tab[i][v];
- tab[i][v] = tab[i][v+1];
- tab[i][v+1] = tmp;
- }
- }
- for(int i = 0; i < tab.length; i++){
- for(int j = 0; j < tab[i].length; j++)
- System.out.print(tab[i][j] + " ");
- System.out.println();
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement