Untitled
unknown
plain_text
a year ago
583 B
9
Indexable
#include <stdio.h>
void printPoly(int a[] , int l) {
for(int i=l-1; i>=0; i--) {
if(i != 0)
printf("%dx^%d+",a[i],i);
else
printf("%d",a[i]);
}
}
int main() {
int a[] = {3,0,5};
int b[] = {4,3,1};
int l1 = sizeof(a) / sizeof(a[0]);
int l2 = sizeof(b) / sizeof(b[0]);
int max = l1 > l2 ? l1 : l2;
int min = l1 > l2 ? l2 : l1;
int c[max];
for(int i=0; i<min; i++)
c[i] = a[i] + b[i];
while(min < max) {
c[min++] = l1 > l2 ? a[min] : b[min];
}
printPoly(c,max);
return 0;
}Editor is loading...
Leave a Comment