編程里乘法是
九九乘法表c語言編程內容如下：
//九九乘法表，左下三角
#include<stdio.h>
int main()
｛
int i=0,j=0;
for(i=1;i<10;i++)
{
for(j=1;j<=i;j++)
{
printf("%d*%d=%d ",j,i,i*j);
}
printf(" ");
}
printf(" ");
return 0;
}
語言簡介
C語言是一種應用廣泛，並且實現靈活的一種計算機編程語言，用C語言編出來的程序，可以在很多平台上運行，可移植性強。
不僅如此，我們用的眾多聊天工具也可以用C語言來實現。具體的C語言編程內容請參加C或者C++等。C語言有一個突出的優點就是適合於多種操作系統，如DOS、UNIX，也適用於多種機型。
B. C語言2個數相乘
兩數相乘的C語言編程：
(2)編程里乘法是擴展閱讀:
C語言是一門通用計算機編程語言，應用廣泛。C語言的設計目標是提供一種能以簡易的方式編譯、處理低級存儲器、產生少量的機器碼以及不需要任何運行環境支持便能運行的編程語言。
C 語言是以函數形式提供給用戶的，這些函數可方便的調用，並具有多種循環、條件語句控製程序流向，從而使程序完全結構化。
C. C語言：乘號怎樣表示
* 表示乘號，且不可省略，數學上有的時候乘號可以省略，但是C程序中不能省略，如數學上表示a和b相乘，可以寫成ab，但是在C程序中必須寫成a*b，*必須要有。
另外語句後有分號；所有符號都是英文半形符號。
比如：
使用公式c=2πr計算圓的周長。該語句應寫為：
c=2*3.14*r;
(3)編程里乘法是擴展閱讀
源代碼如下：
#include <stdio.h>
#include <stdlib.h>
int main()
{
int a=12;
int b=10;
printf("a=%d
", a);
a=a+8;
printf("a=%d ", a);
a=a*b;
printf("a=%d ", a);
system("pause");
return 0;
}
D. 加減乘除的c語言編程怎麼寫
c語言的加減乘除可以這樣寫，假設有int變數a,b，c
加法:c=a+b
減法：c=a-b
乘法：c=a*b
除法：c=a/b
E. C語言乘號用法
C語言中*是二元運算符：乘號，用於將兩個表達式的值相乘；
也是一元運算符：取值，用在指針表達式的左邊，取指針指向的存儲位置的值。
使用示例：
#include <stdio.h>
int main()
{
int a = 12;
int b = 100;
float c = 8.5;
int m = a + b;
float n = b * c;
double p = a / c;
int q = b % a;
printf("m=%d, n=%f, p=%lf, q=%d ", m, n, p, q);
return 0;
}
(5)編程里乘法是擴展閱讀
C語言後綴表達式2級
postfix-expression [ expression ]，數組下標運算。
postfix-expression ( argument-expression-list)，函數調用，括弧內的參數可選。
postfix-expression . identifier，成員訪問，
postfix-expression -> identifier，成員訪問，->號之前應為指針。
postfix-expression ++，後綴自增
postfix-expression --，後綴自減
( type-name ) { initializer-list }
( type-name ) { initializer-list , } 復合初始化，C99後新增。
F. c++編程 多項式的乘法
#include <iostream>
#include<algorithm>
using namespace std;
class Polynomial;
class Term{//多項式的每一項
friend Polynomial;
public:
float coef;//系數
int exp;//指數
};
class Polynomial{//多項式類
friend ostream & operator<<(ostream &o,const Polynomial & poly);
public:
Polynomial();
Polynomial(const Polynomial & poly);
~Polynomial();
Polynomial operator+(const Polynomial & poly);//多項式加法
Polynomial operator*(const Polynomial & poly);//多項式乘法
float Eval(float x);//數x代入多項式求值
void NewTerm(float coef,int exp);//添加一項,若有相同的指數項，則合並
private:
void insertTerm(const Term & term);//項的有序插入
private:
Term *termArray;//非零系數項數組
int capacity;//數組大小
int terms;//非零系數的項數
};
Polynomial::Polynomial()
{
this->terms=0;
this->capacity=10;
termArray=new Term[this->capacity];
}
Polynomial::Polynomial(const Polynomial & b)
{
this->terms=0;
this->capacity=b.capacity;
termArray = new Term[this->capacity];
for(int i=0;i<b.terms;i++){
NewTerm(b.termArray[i].coef,b.termArray[i].exp);
}
}
Polynomial::~Polynomial()
{
delete [] termArray;
}
Polynomial Polynomial::operator+(const Polynomial & b)
{
Polynomial c;
int aPos=0;
int bPos=0;
while(aPos<terms && bPos<b.terms){
if(termArray[aPos].exp == b.termArray[bPos].exp){
float coef=termArray[aPos].coef+b.termArray[bPos].coef;
if(coef)c.NewTerm(coef,termArray[aPos].exp);
aPos++;bPos++;
}else if(termArray[bPos].exp < b.termArray[bPos].exp){
c.NewTerm(b.termArray[bPos].coef,b.termArray[bPos].exp);
bPos++;
}else{
c.NewTerm(termArray[aPos].coef,termArray[aPos].exp);
aPos++;
}
}
while (aPos < terms){
c.NewTerm(termArray[aPos].coef,termArray[aPos].exp);
aPos++;
}
while (bPos < b.terms){
c.NewTerm(b.termArray[bPos].coef,b.termArray[bPos].exp);
bPos++;
}
return c;
}
Polynomial Polynomial::operator*(const Polynomial & b)
{
Polynomial c;
for(int i=0; i<terms; i++){
for(int j=0; j<b.terms; j++){
float coef = termArray[i].coef*b.termArray[j].coef;
int exp = termArray[i].exp + b.termArray[j].exp;
c.NewTerm(coef,exp);
}
}
return c;
}
void Polynomial::NewTerm(float coef, int exp)
{
if(terms == capacity){
capacity *= 2;
Term *tmp = new Term[capacity];
(termArray,termArray+terms,tmp);
delete [] termArray;
termArray = tmp;
}
Term ATerm;
ATerm.coef=coef;ATerm.exp=exp;
insertTerm(ATerm);
}
void Polynomial::insertTerm(const Term & term)
{
int i;
for(i=0; i<terms && term.exp<termArray[i].exp; i++){
}
if(term.exp == termArray[i].exp){
termArray[i].coef += term.coef;
if(!termArray[i].coef){
for(int j=i; j<terms-1; j++)
termArray[j]= termArray[j+1];
terms--;
}
}else{
for(int j=terms-1; j>=i;j--)
termArray[j+1]=termArray[j];
termArray[i] = term;
terms++;
}
}
float Polynomial::Eval(float x)
{
float res=0.0;
for(int i=0;i<terms; i++){
res += termArray[i].coef * pow(x,termArray[i].exp);
}
return res;
}
ostream & operator<<(ostream & o,const Polynomial & poly)
{
for(int i=0;i<poly.terms-1;i++){
o<<poly.termArray[i].coef<<"x^"<<poly.termArray[i].exp<<" + ";
}
o<<poly.termArray[poly.terms-1].coef<<"x^"<<poly.termArray[poly.terms-1].exp;
return o;
}
void test()
{
Polynomial p1;
p1.NewTerm(3,2);
p1.NewTerm(2.1,3);
Polynomial p2;
p2.NewTerm(1,2);
p2.NewTerm(1,3);
p2.NewTerm(5,1);
cout<<"("<<p1<<") + ("<<p2<<") = "<<p1+p2<<endl;
cout<<"F(x=2) = "<<(p1+p2).Eval(2)<<endl;
cout<<"("<<p1<<") * ("<<p2<<") = "<<p1 * p2<<endl;
}
int main()
{
test();
system("Pause");
return 0;
}
#include <iostream>
#include<algorithm>
using namespace std;
class Polynomial;
class Term{//多項式的每一項
friend Polynomial;
public:
float coef;//系數
int exp;//指數
};
class Polynomial{//多項式類
friend ostream & operator<<(ostream &o,const Polynomial & poly);
public:
Polynomial();
Polynomial(const Polynomial & poly);
~Polynomial();
Polynomial operator+(const Polynomial & poly);//多項式加法
Polynomial operator*(const Polynomial & poly);//多項式乘法
float Eval(float x);//數x代入多項式求值
void NewTerm(float coef,int exp);//添加一項,若有相同的指數項，則合並
private:
void insertTerm(const Term & term);//項的有序插入
private:
Term *termArray;//非零系數項數組
int capacity;//數組大小
int terms;//非零系數的項數
};
Polynomial::Polynomial()
{
this->terms=0;
this->capacity=10;
termArray=new Term[this->capacity];
}
Polynomial::Polynomial(const Polynomial & b)
{
this->terms=0;
this->capacity=b.capacity;
termArray = new Term[this->capacity];
for(int i=0;i<b.terms;i++){
NewTerm(b.termArray[i].coef,b.termArray[i].exp);
}
}
Polynomial::
~Polynomial()
{
delete [] termArray;
}
Polynomial Polynomial::operator+(const Polynomial & b)
{
Polynomial c;
int aPos=0;
int bPos=0;
while(aPos<terms && bPos<b.terms){
if(termArray[aPos].exp == b.termArray[bPos].exp){
float coef=termArray[aPos].coef+b.termArray[bPos].coef;
if(coef)c.NewTerm(coef,termArray[aPos].exp);
aPos++;bPos++;
}else if(termArray[bPos].exp < b.termArray[bPos].exp){
c.NewTerm(b.termArray[bPos].coef,b.termArray[bPos].exp);
bPos++;
}else{
c.NewTerm(termArray[aPos].coef,termArray[aPos].exp);
aPos++;
}
}
while (aPos < terms){
c.NewTerm(termArray[aPos].coef,termArray[aPos].exp);
aPos++;
}
while (bPos < b.terms){
c.NewTerm(b.termArray[bPos].coef,b.termArray[bPos].exp);
bPos++;
}
return c;
}
Polynomial Polynomial::operator*(const Polynomial & b)
{
Polynomial c;
for(int i=0; i<terms; i++){
for(int j=0; j<b.terms; j++){
float coef = termArray[i].coef*b.termArray[j].coef;
int exp = termArray[i].exp + b.termArray[j].exp;
c.NewTerm(coef,exp);
}
}
return c;
}
void Polynomial::NewTerm(float coef, int exp)
{
if(terms == capacity){
capacity *= 2;
Term *tmp = new Term[capacity];
(termArray,termArray+terms,tmp);
delete [] termArray;
termArray = tmp;
}
Term ATerm;
ATerm.coef=coef;ATerm.exp=exp;
insertTerm(ATerm);
}
void Polynomial::insertTerm(const Term & term)
{
int i;
for(i=0; i<terms && term.exp<termArray[i].exp; i++){
}
if(term.exp == termArray[i].exp){
termArray[i].coef += term.coef;
if(!termArray[i].coef){
for(int j=i; j<terms-1; j++)
termArray[j]= termArray[j+1];
terms--;
}
}else{
for(int j=terms-1; j>=i;j--)
termArray[j+1]=termArray[j];
termArray[i] = term;
terms++;
}
}
float Polynomial::Eval(float x)
{
float res=0.0;
for(int i=0;i<terms; i++){
res += termArray[i].coef * pow(x,termArray[i].exp);
}
return res;
}
ostream & operator<<(ostream & o,const Polynomial & poly)
{
for(int i=0;i<poly.terms-1;i++){
o<<poly.termArray[i].coef<<"x^"<<poly.termArray[i].exp<<" + ";
}
o<<poly.termArray[poly.terms-1].coef<<"x^"<<poly.termArray[poly.terms-1].exp;
return o;
}
void test()
{
Polynomial p1;
p1.NewTerm(3,2);
p1.NewTerm(2.1,3);
Polynomial p2;
p2.NewTerm(1,2);
p2.NewTerm(1,3);
p2.NewTerm(5,1);
cout<<"("<<p1<<") + ("<<p2<<") = "<<p1+p2<<endl;
cout<<"F(x=2) = "<<(p1+p2).Eval(2)<<endl;
cout<<"("<<p1<<") * ("<<p2<<") = "<<p1 * p2<<endl;
}
int main()
{
test();
system("Pause");
return 0;
}
測試結果：
Cpp代碼
(2.1x^3 + 3x^2) + (1x^3 + 1x^2 + 5x^1) = 3.1x^3 + 4x^2 + 5x^1
F(x=2) = 50.8
(2.1x^3 + 3x^2) * (1x^3 + 1x^2 + 5x^1) = 2.1x^6 + 5.1x^5 + 13.5x^4 + 15x^3
請按任意鍵繼續. . .
(2.1x^3 + 3x^2) + (1x^3 + 1x^2 + 5x^1) = 3.1x^3 + 4x^2 + 5x^1
F(x=2) = 50.8
(2.1x^3 + 3x^2) * (1x^3 + 1x^2 + 5x^1) = 2.1x^6 + 5.1x^5 + 13.5x^4 + 15x^3
請按任意鍵繼續. . .