Professional Documents
Culture Documents
LP Parcial
LP Parcial
PROBLEMA 1
#include "stdio.h"
main()
{ int cod[5],x1[5][7],x2[5][7];
int i,j;
for(i=0;i<5;i++){
scanf("%d",&cod[i]);
for(j=0;j<7;j++){
scanf("%d",&x1[i][j]); scanf("%d",&x2[i][j]);
p=F_S1; p(cod,x1,x2,3);
for(j=0;j<7;j++){
ind1=ind1+x1[sec-1][j]; ind2=ind2+x2[sec-1][j];
ind1=ind1/7.0; ind2=ind2/7.0;
printf("%f\n",ind1-ind2);
PROBLEMA 2
#include "stdio.h"
main()
{ int DNI[125],edad[125];
int i,j;
for(i=0;i<125;i++){
scanf("%d",&DNI[i]);scanf("%d",&edad[i]);
for(i=0;i<125;i++){
if(dni==DNI[i]){ scanf("%d",&ne);edad[i]=ne;a=a+1;}
}
if(a==0){printf("DNI no existe\n");}
p=F_S2; p(edad);
{ int fre[]={0,0,0,0,0,0,0,0},FA[]={0,0,0,0,0,0,0,0},i,tot=0;
for(i=0;i<125;i++){
for(i=0;i<8;i++){
tot=tot+fre[i];
if(i==0){FA[i]=fre[i];}
else { FA[i]=FA[i-1]+fre[i];}
printf("10-15\t%d\t%d\n",fre[0],FA[0]);
printf("16-21\t%d\t%d\n",fre[1],FA[1]);
printf("22-27\t%d\t%d\n",fre[2],FA[2]);
printf("28-33\t%d\t%d\n",fre[3],FA[3]);
printf("34-39\t%d\t%d\n",fre[4],FA[4]);
printf("40-45\t%d\t%d\n",fre[5],FA[5]);
printf("46-51\t%d\t%d\n",fre[6],FA[6]);
printf("52-57\t%d\t%d\n",fre[7],FA[7]);
printf("TOTAL\t%d\n",tot);
2018-1
PROBLEMA 2
#include "stdio.h"
int F_S2_C1(int cod[],int t1[], int t2[], int t3[], int cod_req)
{ int max;
max=t1[cod_req-1];
if(t2[cod_req-1]>max){ max=t2[cod_req-1];}
if(t3[cod_req-1]>max){ max=t3[cod_req-1];}
int total;
total=t1[cod_req-1]+t2[cod_req-1]+t3[cod_req-1];
printf("%d\n",total);
return max;
main()
{ int cod[5],t1[5],t2[5],t3[5];
int i;
for(i=0;i<5;i++)
{ scanf("%d",&cod[i]);scanf("%d",&t1[i]);scanf("%d",&t2[i]);scanf("%d",&t3[i]); }
int aux=F_S2_C1(cod,t1,t2,t3,2);
printf("%d\n",aux);
PROBLEMA 3
#include "stdio.h"
void F_S3_C2( int sede[], int mes[], float ing[3][4], float egre[3][4], int cod_suc)
{ int i,j;
D[0]=ing[0][cod_suc-1]-egre[0][cod_suc-1];
D[1]=ing[1][cod_suc-1]-egre[1][cod_suc-1];
D[2]=ing[2][cod_suc-1]-egre[2][cod_suc-1];
for(i=0;i<3;i++)
{ for(j=i+1;j<3;j++)
{ if(D[i]>D[j]){ aux=D[i];D[i]=D[j];D[j]=aux;} }
printf("%f %f %f\n",D[0],D[1],D[2]);
main()
int i,j;
for(i=0;i<4;i++){scanf("%d",&sede[i]); }
for(i=0;i<3;i++){scanf("%d",&sede[i]); }
for(i=0;i<3;i++){
for(j=0;j<4;j++){
scanf("%f",&ing[i][j]); scanf("%f",&egre[i][j]); } }
F_S3_C2(sede,mes,ing,egre,3);
PROBLEMA 4
#include "stdio.h"
for(i=0;i<3;i++){
for(j=0;j<3;j++){
x[i][j]=p[i][j]*c[i][j];
if(max<x[i][j]){ max=x[i][j];a=i;b=j;}
int t[]={2015,2016,2017};
printf("%f\n",max);
return t[a];
main()
int i,j;
for(i=0;i<3;i++){ scanf("%d",&cod[i]);
for(j=0;j<3;j++){
scanf("%f",&p[i][j]);scanf("%f",&c[i][j]);
int aux=F_S4_C3(cod,p,c);
printf("%d\n",aux);
2017-1
PROBLEMA 1
#include <stdio.h>
int F_S1 (int s,int np, int alt, int E[65][2], int D[65], int S[65]);
int (*p)(int s,int np, int alt, int E[65][2], int D[65], int S[65]);
main()
for(i=0;i<3;i=i+1)
{ scanf("%d",&E[i][0]); scanf("%d",&E[i][1]);
scanf("%d",&D[i]); scanf("%d",&S[i]); }
p=F_S1; printf("Cant=%d\n",p(1,0,1,E,D,S)); printf("Cant=%d\n",p(2,0,1,E,D,S));//c
printf("Cant=%d\n",p(1,0,2,E,D,S)); printf("Cant=%d\n",p(2,0,2,E,D,S));
printf("Cant=%d\n",p(1,1,1,E,D,S)); printf("Cant=%d\n",p(2,1,1,E,D,S));
printf("Cant=%d\n",p(1,1,2,E,D,S)); printf("Cant=%d\n",p(2,1,2,E,D,S));
int F_S1 (int s,int np, int alt, int E[65][2], int D[65], int S[65])//b
{int i, con=0;
for(i=0;i<3;i=i+1)
{ if (S[i]==s)
{ if (E[i][np]==alt)
{ con = con+1; }
} return con;
PROBLEMA 2
#include <stdio.h>
main()
for(i=0;i<8;i=i+1)
p=F_S2; p(1.2,c1,c2,k);
for(i=0;i<8;i=i+1) { t=t+a[i]+b[i]; }
z=a[wk]+b[wk];
printf("%f\n",z/t); }
PROBLEMA 3
#include <stdio.h>
main()
{ int i,j;float c1[11],c2[11]; int k[11];
for(i=0;i<11;i=i+1)
{ return (a[x-1]-b[x-1])/b[x-1]; }
PROBLEMA 4
#include <stdio.h>
main()
for(i=0;i<5;i=i+1)
for(i=0;i<5;i=i+1){p[0]=p[0]+a[i];p[1]=p[1]+b[i];p[2]=p[2]+c[i];p[3]=p[3]+d[i];}
t=(p[0]+p[1]+p[2]+p[3])/20.0; x=t;
char l[10][10]={"cero","uno","dos","tres","cuatro","cinco","seis","siete","ocho","nueve"};
u=(x%10-x%1)/1;printf("Unidades=%s\n",l[u]);
de=(x%100-x%10)/10;printf("Decenas=%s\n",l[de]);
ce=(x%1000-x%100)/100;printf("Centenas=%s\n",l[ce]);
2005-2
#include <stdio.h>
#include <conio.h>
void main(void)
int c,i,j,L[9],aux;
float X[7][10];
for(i=0;i<9;i++)
{
L[i]=i;
for(i=0;i<7;i++)
for(j=0;j<10;j++)
X[i][j]=0.0;
for(i=0;i<6;i++) //sector
for(j=0;j<9;j++) //factor
scanf("%f",&X[i][j]);
j=9;
X[i][j]=f_calcular(X,1,i); // 1=indice
X[6][9]=X[6][9]+X[i][j];
for(j=0;j<9;j++)
X[i][j]=f_calcular(X,2,j); // promedio
for(i=0;i<6;i++)
for(j=0;j<9;j++)
printf("%1.0f\t",X[i][j]);
//printf("%1.2f\n",X[i][9]);
}
printf("-----------------------------------------------------------------------------\n");
for(i=0;i<10;i++)
printf("%1.2f\t",X[6][i]);
// ordenando //verificar
for(i=0;i<8;i++)
for(j=i+1;j<9;j++)
if(X[6][i]<X[6][j])
aux=L[i];
L[i]=L[j];
L[j]=aux;
for(i=0;i<9;i++)
if((X[6][L[i]]>5.0)&&(X[6][L[i]]<8.0))
printf("factor%d %1.2f\n",L[i]+1,X[6][L[i]]);
c=getch();
{ int m; float z;
switch(tipocalculo)
{ case 1:
z=0.0;
for(m=0;m<9;m++)
{ z=z+A[col_fil][m]; }
z=(z/9);
break;
case 2:
z=0.0;
for(m=0;m<6;m++)
{z=z+A[m][col_fil]; }
z=(z/6);
break;
default:
break;
return z;