Beruflich Dokumente
Kultur Dokumente
package javaapplication14;
import java.util.Scanner;
public class SistemadeEcuaciones {
METODO LEER/////////////////
static int leer(){
Scanner leer= new Scanner (System.in);
int x= leer.nextInt();
return x;
}
METODO CARGA MANUAL///////////////////77
static double[][] cargarmanual(double [][] x){
int i,j;
for(i=0;i<x.length;i++){
for(j=0;j<x[0].length-1;j++){
System.out.print("Ecuacin "+(i+1)+" ingrese coeficiente de
X"+(j+1)+": ");
x[i][j]=leer();
System.out.println("");
}
System.out.print("Ecuacin "+(i+1)+" ingrese trmino independiente:
");
x[i][j]=leer();
System.out.println("");
}
for(i=0;i<x.length;i++){
for(j=0;j<x[0].length-2;j++){
System.out.print(x[i][j]+"X"+(j+1)+"+");
}
System.out.print(x[i][x[0].length-2]+"X"+(x[0].length-1)+"=");
System.out.print(x[i][x[0].length-1]);
System.out.println("");
}
System.out.println("");
return x;
}
METODO IMPRIMIR////////////////////
static void imprimir(double [][] x){
int i,j;
for(i=0;i<x.length;i++){
for(j=0;j<x[0].length;j++){
System.out.print(x[i][j]+" ");
}
System.out.println("");
}
}
else{
int l=j;
while(piv==0 && l<n){
piv=x[l][j];
l++;
}
if(l==n){
}
else{
l=l-1;
for(k=l+1;k<n;k++){
d=x[k][j]/piv;
for(i=j;i<n+1;i++){
x[k][i]=x[k][i]-x[l][i]*d;
}
}
}
}
}
return x;
}
METODO DETERMINANTE///////////////////////
for(i=0;i<x.length;i++){
deter=deter*x[i][i];
return deter;
}
METODO SOLUCION////////////
static double[] solucion(double [][] x){
int i,j,n=x.length,m=x[0].length;
double k=0,deter=1;
double [] sol= new double[n];
deter=deter(x);
if(deter!=0){
for(j=n-1;j>=0;j--){
k=0;
for(i=n-1;i>j;i--){
k=k+sol[i]*x[j][i];
}
if(j==n-1){
k=0;
}
sol[j]=(x[j][m-1]-k)/x[j][j];
}
versolucion(sol);
return sol;}
else{
System.out.println("No hay solucin ");
return sol;
}
}
CADENA
package problema2;
import java.util.Scanner;
int num=a.length();
return num;
System.out.print(a.charAt(i));
}
else{
System.out.println(".");
}
int num1=a.length();
int num2=plb.length();
int i=0,j,cont=0,aux;
for(i=0;i<num1-num2;i++){
aux=0;
for(j=0;j<num2;j++){
if(a.charAt(i+j)==plb.charAt(j)){
aux++;
}
if(aux==num2){
cont++;
}
}
return cont;
//invocar a la funcin
int cantidad=cuentapalabrascadena(p);
int busca=buscapalabrascadena(p,plb);
System.out.println("La palabra se encuentre "+busca+" veces");
imprimecadenadecambiodelinea(p);
}
}