Phoenix_Hijacker

poliniomicpp.cpp

May 26th, 2015
311
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.58 KB | None | 0 0
  1. /* fare il prodotto di 2 polinomio di grado n (3x*/
  2. #include <iostream>
  3. void somma();
  4. using namespace std;
  5. int main (){
  6. int i,j,l_pol1,l_pol2,k,l,m,n,q,w,e,r,t;
  7.  
  8. cout<<"Inserisci La Lungezza del primo Polinomio: ";cin>>l_pol1;
  9. cout<<"Inserisci La Lungezza del Secondo Polinomio: ";cin>>l_pol2;
  10.  
  11. int pol_1[l_pol1], pol_2[l_pol2], pol1_grado[l_pol1], pol2_grado[l_pol2];
  12.  
  13. for(i=0;i<l_pol1;i++){
  14. cout<<"\n\nInserisci "<<i+1<<" Cofficente del PRIMO polinomio: ";cin>>pol_1[i];
  15. cout<<"Di Grado se termine noto premi 0: ";cin>>pol1_grado[i];
  16. }
  17.  
  18. for(i=0;i<l_pol2;i++){
  19. cout<<"\n\nInserisci "<<i+1<<" Cofficente del SECONDO polinomio: ";cin>>pol_2[i];
  20. cout<<"Di Grado se termine noto premi 0: ";cin>>pol2_grado[i];
  21. }
  22.  
  23. k=l_pol1*l_pol2;
  24. int vet[k],vet2[k];
  25. n=0;
  26. for(i=0;i<k/2;i++){
  27.  
  28. for(j=0;j<l_pol2;j++){
  29.  
  30. l=(pol_1[i])*(pol_2[j]);
  31.  
  32. vet[n]=l;
  33.  
  34. m=pol1_grado[i]+pol2_grado[j];
  35.  
  36. vet2[n]=m;
  37.  
  38. n++;
  39.  
  40. if(m==1)
  41. cout<<l<<"x | ";
  42. else if(m==0)
  43. cout<<l<<" | ";
  44. else
  45. cout<<l<<"x "<<m<<" | ";
  46. }
  47. }
  48. cout<<endl;
  49.  
  50. /* for(i=0;i<n;i++){
  51.  
  52. for(j=0;j<n;j++){
  53.  
  54. if(vet2[i]==vet2[j]){
  55.  
  56. q=vet[i]+vet[j];
  57.  
  58. }
  59.  
  60.  
  61. if(m==1)
  62. cout<<l<<"x | ";
  63. else if(m==0)
  64. cout<<l<<" | ";
  65. else
  66. cout<<l<<"x "<<m<<" | ";
  67. }
  68.  
  69. }*/
  70. cout<<endl;
  71. //somma();
  72. return 0;
  73. }
  74.  
  75. /*
  76. void somma(){
  77. int i,j,k,l,
  78. for(i=0;i<n;i++){
  79.  
  80. for(j=0;j<n;j++){
  81.  
  82. if(vet2[i]==vet2[j]){
  83.  
  84.  
  85. }
  86. }
  87.  
  88. }
  89.  
  90. return 0;
  91. }
  92. */
Advertisement
Add Comment
Please, Sign In to add comment