SlideShare a Scribd company logo
1 of 9
Colegio de Estudios Científicos
Y Tecnológicos del Estado de México
Miriam Daniela Robledo Acosta
304
Software
Primer parcial
Manual de prácticas
Índice
1. Área de un triángulo
2. Array mayor
3. Bisiesto
4. Cilindro
5. Cohete
6. Deuda 2
7. Divisores
8. Figuras rectangulares
9. Hipotenusa
10. Mayor menor
11. Multiplicando
12. Triangulo
13. Promedio
14. Creciente y decreciente
15. Ordena alumno
16. Cuadro mágico
17. Misión calcular área
18. Mensaje suma
19. A+B
20. Resta y multiplicación
21. Área de un rectángulo
22. Rombo
23. Flecha
1.-area de un triangulo
#include <iostream> #include<iomanip> using
namespace std; int main() { float h,b,area;
cin>>h>>b; area=h*b/2; std::cout << std::fixed;
std::cout<<std::setprecision(2)<< area <<endl;
return 0; }
2.- Array mayor
#include <iostream> using namespace std; int
main() { int n,mayor=0,menor=1000,pos=0,col=0;
cin>>n; int * a=new int [n]; for (int i=0;i<n;i++){
cin>>a[i]; if (a[i]>mayor){ pos=i; mayor=a[i]; } if
(a[i]<=menor){ col=i; menor=a[i]; } }
cout<<"posicion mayor : "<<pos<< " Valor ->
"<<a[pos]<<endl; cout<<"posicion menor :
"<<col<< " Valor -> "<<a[col]<<endl; return 0; }
3.-bisiesto
#include <iostream> using namespace std; int
main() { int n; cin>> n; int* a =new int[n]; for(int
i=0; i<n; i++) { cin>>a[i]; } for(int j=0; j<n; j++) {
if(a[j]%4==0) { cout<<"S"<<endl; } else {
cout<<"N"<<endl; } return 0; }
4.-cilindro
#include <iostream> #include<iomanip> using
namespace std; int main() { float pi=3.1416,r,h,a;
cin>>h>>r; a=2*pi*r*h; std::cout << std::fixed;
std::cout<<std::setprecision(2)<< a <<endl;
return 0; }
5.-cohete
#include <iostream> using namespace std; int
main() { int j,n; cin>>n; for (j=0;j<n;j++) { for (int
y=n-j;y>0;y--) cout<<""; for (int l=(2*j)+1;l>0;l--)
cout<<"*"; cout<<"n"; } for (int i=0;i<n;i++){ for (int
i=0;i<n;i++){ cout<<""; } for (int i=0; i<n*3;i++){
cout<<"*"; } if (i<=n/2){ for (int a=0;a<i;a++){
cout<<"*"; } } cout<<endl; } for (int j=0;j<n;j++) {
for (int i=0;i<n-j-1;i++){ cout<<""; } for (int j=n-
2;j>=0;--j){ for (int i=0;i<n-j-1;i++) cout<<""; for (int
i=0;i<2*j+1;i++) cout<<"*"; cout<<endl; } return 0 ;
} }
6.- deuda
#include<iostream> using namespace std; int
main(){ float i,n,m,interes=0,total,a,suma=0;
cin>>i>>n>>m; cout<<i; cout<<n; cout<<m; for(int
i=0;i<m;i++){ cin>>a; suma=suma+a; }
interes=n/100*i+n; total=interes-suma;
cout<<endl; cout<<total; return 0; }
7.- divisores
#include <iostream> using namespace std; int
main() { int v,i; cin>>v; for (int i=1;i<=v;i++){ if
(v%i==0){ cout<<i<<endl; } } return 0;
8.-Figuras rectangulares
#include <iostream> #include<math.h>using
namespace std; int main() { int
n,r=0,cuadrado=0,h=0,rec=0; cin>>n;
cuadrado=sqrt(n); h=cuadrado*cuadrado;
rec=n/2*2; if (n==h && n==rec){
cout<<"ambos"<<endl; } else if (sqrt
(n)==cuadrado){ cout<<"cuadrado"<<endl; } else
if (n==rec){ cout<<"rectangulo"<<endl; } else{
cout<<"ninguno"<<endl; } return 0; }
9.-hipotenusa
#include <iostream> #include<math.h> using
namespace std; int main() { float O,A,H=0.00;
float ca1,co1; cin>>A; cin>>O; ca1=A*A;
co1=O*O; H=sqrt(ca1+co1); cout<<H; return 0; }
10.-mayor menor
#include <conio.h> #include <stdio.h> #include
<iostream> using namespace std; int main() { int
n,i,j,A[50],aux; cin>>n; for(i=1;i<=n;i++){
cin>>A[i]; } for(i=1;i<=n-1;i++) { for(j=1;j<=n-1;j++)
{ if(A[j]>A[j+1]) { aux=A[j]; A[j]=A[j+1]; A[j+1]=aux;
} } } for(i=n;i>=1;i--) { cout<<" "<<A[i]; } getch(); }
11.-multiplicando
#include <iostream> using namespace std; int
main() { long n,a=1; cin>>n; for(long i=1; i<=n;
i++) { a=a*i; } cout<<a<<endl; return 0; }
12.-triangulo
#include <iostream> using namespace std; int
main() { int j,n; cin>>n; for (j=0;j<n;j++) { for (int
y=n-j;y>0;y--) cout<<" "; for (int l=(2*j)+1;l>0;l--)
cout<<"*"; cout<<"n"; } for (j=0;j>n;j++) { for (int
y=n+j;y<0;y--) cout<<" "; for (int l=(2*j)+1;l>0;l--)
cout<<"*"; cout<<"n"; return 0;} }
13.-promedio
#include <iostream> #include <iomanip> using
namespace std; int main() { int n ; float
promedio=0, suma=0; cin>>n; int * a=new int[n];
for(int i=0; i<n; i++){ cin>>a[i]; suma=suma+a[i]; }
promedio=suma/n; std::cout<< std::fixed;
std::cout<< std::setprecision(2)<<
promedio<<endl; return 0; }
14.-creciente y decreciente
#include <iostream> using namespace std; int
main() { int n,c=0,d=0; cin>>n; int * m=new int [n];
for (int i=0;i<n;i++){cin>>m[i]; } for (int
i=1;i<n;i++){ if(m[i]>=m[i-1]){ c++; } if(m[i]<=m[i-
1]){ d++; } } if(c==n-1){ cout<<"CRECIENTE";
}else if(d==n-1){ cout<<"DECRECIENTE";}else{
cout<<"NO ORDENADA"; } return 0; }
15.-ordena alumnos
#include <iostream> #include <stdio.h> #include
<stdlib.h> using namespace std; int main (){ int
n,aux; cin>>n; int * numeros=new int[n]; for(int
i=0;i<n;i++){ cin>>numeros[i]; }
cout<<endl<<endl; for(int i=0;i<n;i++){for(int
j=1;j<n;j++){ if(numeros[j]>numeros[j-1]){
aux=numeros [j]; numeros[j]=numeros[j-1];
numeros[j-1]=aux; } } } cout<<endl<<endl; for(int
i=0;i<n;i++){ cout <<numeros [i]<<endl;} return 0;
}
16.-cuadro mágico
#include <iostream> using namespace std; int
main() { int
a,b,c,d,e,f,g,h,i,s=0,u=0,m=0,l=0,su=0,ma=0,sa=
0,mu=0; cin>>a; cin>>b; cin>>c; cin>>d; cin>>e;
cin>>f; cin>>g; cin>>h; cin>>i; s=a+b+c; u=d+e+f;
m=g+h+i; l=a+d+g; su=b+e+h; ma=c+f+i;
sa=a+e+i; mu=g+e+c; if(s==15&&u==15){
cout<<"SI"; } else{ cout<<"NO"; }return 0; }
17.-mision calcular área
#include <iostream> #include<iomanip> using
namespace std; int main() { int r,h; float
p=3.1416; double c=0; cin>>r; if(r<0){ cin>>r; }
cin>>h; if(h<0){ cin>>h; } c=(2*p)*r*h; std::cout <<
std::fixed; std::cout<<std::setprecision(2)<< c
<<endl; return 0; }
18.- mensaje suma
#include <iostream> using namespace std; int
main() { int a,b,suma; cin>>a; cin>>b; suma=a+b;
cout<<"la suma de "<<a<<" + "<<b<<" es
"<<suma<<endl; return 0; }
19.-A+B
#include <iostream> using namespace std; int
main() { int a,b,suma; cin>>a; cin>>b; suma=a+b;
cout<<suma; return 0; }
20.-resta y multiplicación
#include <iostream> using namespace std; int
main() { int a,b,c,d,diferencia; cin>>a; cin>>b;
cin>>c; cin>>d; diferencia=(a-b)*(c-d);
cout<<diferencia<<endl; return 0; }
21. Área de un rectángulo
#include <iostream> using namespace std; int
main() { int b,h,area; cin>>b; cin>>h; area=b*h;
cout<<area; return 0; }
22. Rombo
#include <iostream> #include<stdio.h>
#include<stdlib.h> using namespace std; int
main(){ int n; cin>>n; for(int a=0;a<n;a++){ for(int
b=n;b>a;b--){ cout<<" "; } for(int j=2;j<=a+1;j++){
cout<<"* "; } cout<<endl; } for(int a=0;a<n;a++){
for(int j=0;j<=a-1;j++){ cout<<" "; } for(int
b=n;b>a;b--){ cout<<"* "; } cout<<endl; } return 0;
}
23. Flecha
#include <iostream> using namespace std; int
main() { int n; cin >>n; for(int j = 0; j<n; j++){ for
(int i=0; i<n-j-1; i++)cout << " "; for(int i = 0; i <
2*j+1; i++)cout<< "*";cout<< endl; } for(int
i=0;i<=n;i++){ for(int l=0;l<n/2+2;l++){ cout<<" "; }
for(int j=0;j<=n/3;j++){ cout<<"*"; } cout<<endl; }
return 0; }

More Related Content

What's hot

Python codigo graficas
Python codigo graficasPython codigo graficas
Python codigo graficasBrayan Kalaka
 
12X1 T02 02 integrating exponentials
12X1 T02 02 integrating exponentials12X1 T02 02 integrating exponentials
12X1 T02 02 integrating exponentialsNigel Simmons
 
Eliminación gaussiana java codigo
Eliminación gaussiana java codigo Eliminación gaussiana java codigo
Eliminación gaussiana java codigo Edwin Juracan
 
Как помочь и как помешать компилятору. Андрей Олейников ➠ CoreHard Autumn 2019
Как помочь и как помешать компилятору. Андрей Олейников ➠  CoreHard Autumn 2019Как помочь и как помешать компилятору. Андрей Олейников ➠  CoreHard Autumn 2019
Как помочь и как помешать компилятору. Андрей Олейников ➠ CoreHard Autumn 2019corehard_by
 
Programación funcional en Haskell
Programación funcional en HaskellProgramación funcional en Haskell
Programación funcional en HaskellRoberto Bonvallet
 
contoh Program C++ tentang fungsi for
contoh Program C++ tentang fungsi forcontoh Program C++ tentang fungsi for
contoh Program C++ tentang fungsi forM Fahmi Ansori
 
Công thức tích phân
Công thức tích phânCông thức tích phân
Công thức tích phândiemthic3
 
Kelompok 2 slideshare rk
Kelompok 2 slideshare rkKelompok 2 slideshare rk
Kelompok 2 slideshare rkcbenk
 

What's hot (19)

Oop lect 10
Oop lect   10Oop lect   10
Oop lect 10
 
Python codigo graficas
Python codigo graficasPython codigo graficas
Python codigo graficas
 
Los fantastico
Los fantasticoLos fantastico
Los fantastico
 
Info clasa
Info clasaInfo clasa
Info clasa
 
12X1 T02 02 integrating exponentials
12X1 T02 02 integrating exponentials12X1 T02 02 integrating exponentials
12X1 T02 02 integrating exponentials
 
Prueba de montecarlo
Prueba de montecarloPrueba de montecarlo
Prueba de montecarlo
 
Sumas
SumasSumas
Sumas
 
Eliminación gaussiana java codigo
Eliminación gaussiana java codigo Eliminación gaussiana java codigo
Eliminación gaussiana java codigo
 
Как помочь и как помешать компилятору. Андрей Олейников ➠ CoreHard Autumn 2019
Как помочь и как помешать компилятору. Андрей Олейников ➠  CoreHard Autumn 2019Как помочь и как помешать компилятору. Андрей Олейников ➠  CoreHard Autumn 2019
Как помочь и как помешать компилятору. Андрей Олейников ➠ CoreHard Autumn 2019
 
Programación funcional en Haskell
Programación funcional en HaskellProgramación funcional en Haskell
Programación funcional en Haskell
 
contoh Program C++ tentang fungsi for
contoh Program C++ tentang fungsi forcontoh Program C++ tentang fungsi for
contoh Program C++ tentang fungsi for
 
Programacion
ProgramacionProgramacion
Programacion
 
Rafaeltorres
RafaeltorresRafaeltorres
Rafaeltorres
 
Kelompok 2.6
Kelompok 2.6Kelompok 2.6
Kelompok 2.6
 
1ee prova com_gab
1ee prova com_gab1ee prova com_gab
1ee prova com_gab
 
Kelompok 2.6
Kelompok 2.6Kelompok 2.6
Kelompok 2.6
 
Corridas
CorridasCorridas
Corridas
 
Công thức tích phân
Công thức tích phânCông thức tích phân
Công thức tích phân
 
Kelompok 2 slideshare rk
Kelompok 2 slideshare rkKelompok 2 slideshare rk
Kelompok 2 slideshare rk
 

Viewers also liked

0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...
0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...
0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...Antika Alanlar
 
Dissertation at www.cheapassignmenthelp.com
Dissertation at www.cheapassignmenthelp.comDissertation at www.cheapassignmenthelp.com
Dissertation at www.cheapassignmenthelp.comAssignment Help
 
Sushil Kumar Jain resume (National) mod 3 (2)
Sushil Kumar Jain resume (National) mod 3 (2)Sushil Kumar Jain resume (National) mod 3 (2)
Sushil Kumar Jain resume (National) mod 3 (2)Sushil Kumar Jain
 
0531-981-01-90 VE 0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...
0531-981-01-90 VE  0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...0531-981-01-90 VE  0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...
0531-981-01-90 VE 0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...antika alanlar
 
Warning: Plagiarists of Awesome Content Will be Eaten
Warning: Plagiarists of Awesome Content Will be EatenWarning: Plagiarists of Awesome Content Will be Eaten
Warning: Plagiarists of Awesome Content Will be EatenPaul Croubalian
 
(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...
(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...
(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...antika alanlar
 
(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...
(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...
(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...antika alanlar
 
Onomatopee I - Animal sounds
Onomatopee I - Animal soundsOnomatopee I - Animal sounds
Onomatopee I - Animal soundsIolanda Fevola
 
Academia Photography Portfolio
Academia Photography PortfolioAcademia Photography Portfolio
Academia Photography PortfolioStewart Hopkins
 
Gr11 parent meeting 23092014
Gr11 parent meeting 23092014Gr11 parent meeting 23092014
Gr11 parent meeting 23092014Alan Perkins
 
(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...
(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...
(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...antika alanlar
 
2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand Champions
2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand Champions2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand Champions
2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand ChampionsArchersan
 

Viewers also liked (19)

0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...
0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...
0531 981 01 90 İDEALTEPE KİTAP ALANLAR-PLAK-KİTAP-ANTİKA EŞYA SATIN ALANLAR 0...
 
Energia
EnergiaEnergia
Energia
 
Testimonial
TestimonialTestimonial
Testimonial
 
ARUN RESUME
ARUN  RESUMEARUN  RESUME
ARUN RESUME
 
Dissertation at www.cheapassignmenthelp.com
Dissertation at www.cheapassignmenthelp.comDissertation at www.cheapassignmenthelp.com
Dissertation at www.cheapassignmenthelp.com
 
Sushil Kumar Jain resume (National) mod 3 (2)
Sushil Kumar Jain resume (National) mod 3 (2)Sushil Kumar Jain resume (National) mod 3 (2)
Sushil Kumar Jain resume (National) mod 3 (2)
 
Creativity
CreativityCreativity
Creativity
 
0531-981-01-90 VE 0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...
0531-981-01-90 VE  0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...0531-981-01-90 VE  0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...
0531-981-01-90 VE 0532-335-75-06 İKİNCİ EL KİTAP ALANLAR İZZETPAŞADAN KİTAP ...
 
CellNets Vodacom
CellNets VodacomCellNets Vodacom
CellNets Vodacom
 
Warning: Plagiarists of Awesome Content Will be Eaten
Warning: Plagiarists of Awesome Content Will be EatenWarning: Plagiarists of Awesome Content Will be Eaten
Warning: Plagiarists of Awesome Content Will be Eaten
 
Jorge Carbajal Resume
Jorge Carbajal ResumeJorge Carbajal Resume
Jorge Carbajal Resume
 
(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...
(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...
(0531-981-01-90) KADIKÖY KİTAPCILAR ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+...
 
(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...
(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...
(0531-981-01-90) ÜSKÜDARDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLAR+A...
 
Onomatopee I - Animal sounds
Onomatopee I - Animal soundsOnomatopee I - Animal sounds
Onomatopee I - Animal sounds
 
Academia Photography Portfolio
Academia Photography PortfolioAcademia Photography Portfolio
Academia Photography Portfolio
 
Gr11 parent meeting 23092014
Gr11 parent meeting 23092014Gr11 parent meeting 23092014
Gr11 parent meeting 23092014
 
Moreven (moscow)
Moreven (moscow)Moreven (moscow)
Moreven (moscow)
 
(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...
(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...
(0531-981-01-90) BAĞLABAŞINDA ANTİKA ESKİ EŞYA-KİTAP-PLAK-MOBİLYA-HALI+ALANLA...
 
2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand Champions
2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand Champions2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand Champions
2015 NCET Expo: Paul Klein - How To Turn Your Customers Into Brand Champions
 

Recently uploaded

FAIL REKOD PENGAJARAN.pptx fail rekod pengajaran
FAIL REKOD PENGAJARAN.pptx fail rekod pengajaranFAIL REKOD PENGAJARAN.pptx fail rekod pengajaran
FAIL REKOD PENGAJARAN.pptx fail rekod pengajaransekolah233
 
TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...
TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...
TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...Nguyen Thanh Tu Collection
 
TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...
TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...
TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...Nguyen Thanh Tu Collection
 
مختصر علم احكام القرآن فقه القرآن وفق منهج العرض
مختصر علم احكام القرآن فقه القرآن وفق منهج العرضمختصر علم احكام القرآن فقه القرآن وفق منهج العرض
مختصر علم احكام القرآن فقه القرآن وفق منهج العرضأنور غني الموسوي
 

Recently uploaded (6)

LAR MARIA MÃE DE ÁFRICA .
LAR MARIA MÃE DE ÁFRICA                 .LAR MARIA MÃE DE ÁFRICA                 .
LAR MARIA MÃE DE ÁFRICA .
 
Energy drink .
Energy drink                           .Energy drink                           .
Energy drink .
 
FAIL REKOD PENGAJARAN.pptx fail rekod pengajaran
FAIL REKOD PENGAJARAN.pptx fail rekod pengajaranFAIL REKOD PENGAJARAN.pptx fail rekod pengajaran
FAIL REKOD PENGAJARAN.pptx fail rekod pengajaran
 
TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...
TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...
TUYỂN TẬP 25 ĐỀ THI HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2023 CÓ ĐÁP ÁN (SƯU...
 
TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...
TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...
TUYỂN TẬP 20 ĐỀ THI KHẢO SÁT HỌC SINH GIỎI MÔN TIẾNG ANH LỚP 6 NĂM 2020 (CÓ Đ...
 
مختصر علم احكام القرآن فقه القرآن وفق منهج العرض
مختصر علم احكام القرآن فقه القرآن وفق منهج العرضمختصر علم احكام القرآن فقه القرآن وفق منهج العرض
مختصر علم احكام القرآن فقه القرآن وفق منهج العرض
 

Manual

  • 1. Colegio de Estudios Científicos Y Tecnológicos del Estado de México Miriam Daniela Robledo Acosta 304 Software Primer parcial Manual de prácticas
  • 2. Índice 1. Área de un triángulo 2. Array mayor 3. Bisiesto 4. Cilindro 5. Cohete 6. Deuda 2 7. Divisores 8. Figuras rectangulares 9. Hipotenusa 10. Mayor menor 11. Multiplicando 12. Triangulo 13. Promedio 14. Creciente y decreciente 15. Ordena alumno 16. Cuadro mágico 17. Misión calcular área 18. Mensaje suma 19. A+B 20. Resta y multiplicación 21. Área de un rectángulo 22. Rombo 23. Flecha
  • 3. 1.-area de un triangulo #include <iostream> #include<iomanip> using namespace std; int main() { float h,b,area; cin>>h>>b; area=h*b/2; std::cout << std::fixed; std::cout<<std::setprecision(2)<< area <<endl; return 0; } 2.- Array mayor #include <iostream> using namespace std; int main() { int n,mayor=0,menor=1000,pos=0,col=0; cin>>n; int * a=new int [n]; for (int i=0;i<n;i++){ cin>>a[i]; if (a[i]>mayor){ pos=i; mayor=a[i]; } if (a[i]<=menor){ col=i; menor=a[i]; } } cout<<"posicion mayor : "<<pos<< " Valor -> "<<a[pos]<<endl; cout<<"posicion menor : "<<col<< " Valor -> "<<a[col]<<endl; return 0; } 3.-bisiesto #include <iostream> using namespace std; int main() { int n; cin>> n; int* a =new int[n]; for(int i=0; i<n; i++) { cin>>a[i]; } for(int j=0; j<n; j++) { if(a[j]%4==0) { cout<<"S"<<endl; } else { cout<<"N"<<endl; } return 0; } 4.-cilindro #include <iostream> #include<iomanip> using namespace std; int main() { float pi=3.1416,r,h,a; cin>>h>>r; a=2*pi*r*h; std::cout << std::fixed; std::cout<<std::setprecision(2)<< a <<endl; return 0; }
  • 4. 5.-cohete #include <iostream> using namespace std; int main() { int j,n; cin>>n; for (j=0;j<n;j++) { for (int y=n-j;y>0;y--) cout<<""; for (int l=(2*j)+1;l>0;l--) cout<<"*"; cout<<"n"; } for (int i=0;i<n;i++){ for (int i=0;i<n;i++){ cout<<""; } for (int i=0; i<n*3;i++){ cout<<"*"; } if (i<=n/2){ for (int a=0;a<i;a++){ cout<<"*"; } } cout<<endl; } for (int j=0;j<n;j++) { for (int i=0;i<n-j-1;i++){ cout<<""; } for (int j=n- 2;j>=0;--j){ for (int i=0;i<n-j-1;i++) cout<<""; for (int i=0;i<2*j+1;i++) cout<<"*"; cout<<endl; } return 0 ; } } 6.- deuda #include<iostream> using namespace std; int main(){ float i,n,m,interes=0,total,a,suma=0; cin>>i>>n>>m; cout<<i; cout<<n; cout<<m; for(int i=0;i<m;i++){ cin>>a; suma=suma+a; } interes=n/100*i+n; total=interes-suma; cout<<endl; cout<<total; return 0; } 7.- divisores #include <iostream> using namespace std; int main() { int v,i; cin>>v; for (int i=1;i<=v;i++){ if (v%i==0){ cout<<i<<endl; } } return 0;
  • 5. 8.-Figuras rectangulares #include <iostream> #include<math.h>using namespace std; int main() { int n,r=0,cuadrado=0,h=0,rec=0; cin>>n; cuadrado=sqrt(n); h=cuadrado*cuadrado; rec=n/2*2; if (n==h && n==rec){ cout<<"ambos"<<endl; } else if (sqrt (n)==cuadrado){ cout<<"cuadrado"<<endl; } else if (n==rec){ cout<<"rectangulo"<<endl; } else{ cout<<"ninguno"<<endl; } return 0; } 9.-hipotenusa #include <iostream> #include<math.h> using namespace std; int main() { float O,A,H=0.00; float ca1,co1; cin>>A; cin>>O; ca1=A*A; co1=O*O; H=sqrt(ca1+co1); cout<<H; return 0; } 10.-mayor menor #include <conio.h> #include <stdio.h> #include <iostream> using namespace std; int main() { int n,i,j,A[50],aux; cin>>n; for(i=1;i<=n;i++){ cin>>A[i]; } for(i=1;i<=n-1;i++) { for(j=1;j<=n-1;j++) { if(A[j]>A[j+1]) { aux=A[j]; A[j]=A[j+1]; A[j+1]=aux; } } } for(i=n;i>=1;i--) { cout<<" "<<A[i]; } getch(); } 11.-multiplicando #include <iostream> using namespace std; int main() { long n,a=1; cin>>n; for(long i=1; i<=n; i++) { a=a*i; } cout<<a<<endl; return 0; }
  • 6. 12.-triangulo #include <iostream> using namespace std; int main() { int j,n; cin>>n; for (j=0;j<n;j++) { for (int y=n-j;y>0;y--) cout<<" "; for (int l=(2*j)+1;l>0;l--) cout<<"*"; cout<<"n"; } for (j=0;j>n;j++) { for (int y=n+j;y<0;y--) cout<<" "; for (int l=(2*j)+1;l>0;l--) cout<<"*"; cout<<"n"; return 0;} } 13.-promedio #include <iostream> #include <iomanip> using namespace std; int main() { int n ; float promedio=0, suma=0; cin>>n; int * a=new int[n]; for(int i=0; i<n; i++){ cin>>a[i]; suma=suma+a[i]; } promedio=suma/n; std::cout<< std::fixed; std::cout<< std::setprecision(2)<< promedio<<endl; return 0; } 14.-creciente y decreciente #include <iostream> using namespace std; int main() { int n,c=0,d=0; cin>>n; int * m=new int [n]; for (int i=0;i<n;i++){cin>>m[i]; } for (int i=1;i<n;i++){ if(m[i]>=m[i-1]){ c++; } if(m[i]<=m[i- 1]){ d++; } } if(c==n-1){ cout<<"CRECIENTE"; }else if(d==n-1){ cout<<"DECRECIENTE";}else{ cout<<"NO ORDENADA"; } return 0; }
  • 7. 15.-ordena alumnos #include <iostream> #include <stdio.h> #include <stdlib.h> using namespace std; int main (){ int n,aux; cin>>n; int * numeros=new int[n]; for(int i=0;i<n;i++){ cin>>numeros[i]; } cout<<endl<<endl; for(int i=0;i<n;i++){for(int j=1;j<n;j++){ if(numeros[j]>numeros[j-1]){ aux=numeros [j]; numeros[j]=numeros[j-1]; numeros[j-1]=aux; } } } cout<<endl<<endl; for(int i=0;i<n;i++){ cout <<numeros [i]<<endl;} return 0; } 16.-cuadro mágico #include <iostream> using namespace std; int main() { int a,b,c,d,e,f,g,h,i,s=0,u=0,m=0,l=0,su=0,ma=0,sa= 0,mu=0; cin>>a; cin>>b; cin>>c; cin>>d; cin>>e; cin>>f; cin>>g; cin>>h; cin>>i; s=a+b+c; u=d+e+f; m=g+h+i; l=a+d+g; su=b+e+h; ma=c+f+i; sa=a+e+i; mu=g+e+c; if(s==15&&u==15){ cout<<"SI"; } else{ cout<<"NO"; }return 0; } 17.-mision calcular área #include <iostream> #include<iomanip> using namespace std; int main() { int r,h; float p=3.1416; double c=0; cin>>r; if(r<0){ cin>>r; } cin>>h; if(h<0){ cin>>h; } c=(2*p)*r*h; std::cout << std::fixed; std::cout<<std::setprecision(2)<< c <<endl; return 0; }
  • 8. 18.- mensaje suma #include <iostream> using namespace std; int main() { int a,b,suma; cin>>a; cin>>b; suma=a+b; cout<<"la suma de "<<a<<" + "<<b<<" es "<<suma<<endl; return 0; } 19.-A+B #include <iostream> using namespace std; int main() { int a,b,suma; cin>>a; cin>>b; suma=a+b; cout<<suma; return 0; } 20.-resta y multiplicación #include <iostream> using namespace std; int main() { int a,b,c,d,diferencia; cin>>a; cin>>b; cin>>c; cin>>d; diferencia=(a-b)*(c-d); cout<<diferencia<<endl; return 0; } 21. Área de un rectángulo #include <iostream> using namespace std; int main() { int b,h,area; cin>>b; cin>>h; area=b*h; cout<<area; return 0; }
  • 9. 22. Rombo #include <iostream> #include<stdio.h> #include<stdlib.h> using namespace std; int main(){ int n; cin>>n; for(int a=0;a<n;a++){ for(int b=n;b>a;b--){ cout<<" "; } for(int j=2;j<=a+1;j++){ cout<<"* "; } cout<<endl; } for(int a=0;a<n;a++){ for(int j=0;j<=a-1;j++){ cout<<" "; } for(int b=n;b>a;b--){ cout<<"* "; } cout<<endl; } return 0; } 23. Flecha #include <iostream> using namespace std; int main() { int n; cin >>n; for(int j = 0; j<n; j++){ for (int i=0; i<n-j-1; i++)cout << " "; for(int i = 0; i < 2*j+1; i++)cout<< "*";cout<< endl; } for(int i=0;i<=n;i++){ for(int l=0;l<n/2+2;l++){ cout<<" "; } for(int j=0;j<=n/3;j++){ cout<<"*"; } cout<<endl; } return 0; }