Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //maximum svake vrste
- class jujuju{
- public static void main(String[]args){
- int[]max;
- int[][]M;
- int i,j,n,max,maxindex;
- System.out.println("Unesite dimenzije matrice");
- n=TextIO.getlnInt();
- M=new int [n][n];
- for(i=0;i<n;i++){
- for(j=0;j<n;j++){
- System.out.println("Unesite vrednost matrice na mestu ["+i+"],["+j+"]");
- M[i][j]=TextIO.getlnInt();
- }
- }
- maxindex=0;
- max=new int[0];
- for(i=0;i<n;i++){
- max[i] = M[i][0];
- // trazim najveci element u i-toj vrsti
- //
- for(j=0;j<n;j++){
- if(M[i][j]
- ){
- max=
- ////////////////////////////////////
- //unesite kv matricu i broj parnih
- class brparnihh{
- public static void main(String[]args){
- int i,j,n,brpar=0;
- int[][]M;
- System.out.println("Unesite dimenzije matrice");
- n=TextIO.getlnInt();
- int[]brparnih=new int[n];
- M=new int[n][n];
- for(i=0;i<n;i++){
- for(j=0;j<n;j++){
- System.out.println("Unesite vrednost matrice [ "+i+" ],[ "+j+" ]");
- M[i][j]=TextIO.getlnInt();
- }
- }
- for(i=0;i<n;i++){
- for(j=0;j<n;j++){
- if(M[i][j]%2==0){
- brpar++;
- }
- }
- }
- for(i=0;i<n;i++){
- for(j=0;j<n;j++){
- if(M[i][j]%2==0){
- brparnih[i]++;
- }
- }
- System.out.print(" "+brparnih[i]);
- }
- int max=brpar[0];
- int maxindex=0
- for(i=0;i<n;i++){
- if(brpar[i]>max){
- max=brpar[i];
- maxindex=i;
- }
- }
- }
- }
- //////////////////////////////
- class oceneucenika{
- public static void main(String[]args){
- double[]prosek=new double[2];
- int[][]matrica=new int [2][5];
- int i,j;
- for(i=0;i<2;i++){
- for(j=0;j<5;j++){
- System.out.println("Unesite vrednost matrice na mestu [" + i + "],[" + j +"]" );
- matrica[i][j]=TextIO.getlnInt();
- }
- }
- for(i=0;i<2;i++){
- for(j=0;j<5;j++){
- prosek[i]+=matrica[i][j]/5;
- }
- System.out.print(prosek[i]);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement