首先你要在文档页设置一个统一的节点。最好在文档的开始设置。
CTSectPrsectPr=XWPFDocument.getDocument.getBody.addNewSectPr();
CTPageSzpgSz=sectPr.addNewPgSz();
通过pgSz设置宽内度/高度和纸张容方向
//设置横板
pgSz.setW(BigInteger.valueOf(15840));
pgSz.setH(BigInteger.valueOf(11907));
pgSz.setOrient(STPageOrientation.LANDSCAPE);
//设置竖版
pgSz.setH(BigInteger.valueOf(15840));
pgSz.setW(BigInteger.valueOf(11907));
pgSz.setOrient(STPageOrientation.PORTRAIT);
㈡ 编写程序, 编写程序,随机生成10个两位整数， 用冒泡法将它们从小到大进行排序
#include <iostream>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
using namespace std;
int main()
{
int i,j,t;
int a[10];
srand(time(NULL));
cout<<"随机生成10个两位整数:";
for(i=0;i<10;i++)
{
a[i]=10+rand()%90;
cout<<setw(3)<<a[i];
}
cout<<endl;
for(i=0;i<10;i++)
{
for(j=i+1;j<10;j++)
{
if(a[j]<a[i])
{
t=a[j];
a[j]=a[i];
a[i]=t;
}
}
}
cout<<"用冒泡法将它们从小到大进行排序版:";
for(i=0;i<10;i++)
{
cout<<setw(3)<<a[i];
}
return 0;
} 运行结果截图权：
㈢ 怎样用java实现数字向右对齐
用格抄式袭化输出就行了吧：
System.out.printf("%4.0f : 1\n",1.0);
System.out.printf("%4.0f : 10\n",10.0);
System.out.printf("%4.0f : 100\n",100.0);
System.out.printf("%4.0f : 1000\n",1000.0);
㈣ 用java语言编写追赶法求解n阶三对角方程组
可以这样写，代码如下
#include "pch.h"
#include <iomanip>
#include <iostream>
# include <fstream>
#include <iomanip>
#include <math.h>
void Chasing_method(double **a, double *b, double *xx, int N_num);
using namespace std;
//*****************************
//追赶法求解AX=B矩阵
//*****************************
void Chasing_method(double **a, double *b, double *xx, int N_num)
{
int i, j, k;
double *gamma = new double[N_num]();
double *alpha = new double[N_num]();
double *beta = new double[N_num]();
double *y = new double[N_num]();
alpha[0] = a[0][0];
beta[0] = a[1][0] / alpha[0]; y[0] = b[0] / alpha[0];
for (i = 1; i < N_num; i++)
{
gamma[i] = a[i - 1][i];
alpha[i] = a[i][i] - gamma[i] * beta[i - 1];
if (i < N_num - 1)
{
beta[i] = a[i + 1][i] / alpha[i];
}
y[i] = (b[i] - gamma[i] * y[i - 1]) / alpha[i];
}
xx[N_num - 1] = y[N_num - 1];
for (i = N_num - 2; i >= 0; i--)
{
xx[i] = y[i] - beta[i] * xx[i + 1];
}
}
int main()
{
int N_num = 4;
double **a = new double*[N_num]();
for (int i = 0; i < N_num; i++) //AX=B方程a[n][n]为系数矩阵
a[i] = new double[N_num]();
double *b = new double[N_num](); //AX=B方程b[n]为右侧列矩阵
double *x = new double[N_num](); //AX=B方程x[n]为方程解
ifstream fin("ab.txt");
for (int i=0; i < N_num; i++)
{
for (int j=0; j < N_num; j++)
{
fin >> a[i][j]; //读取数
cout << fixed << setw(8) << setprecision(4) << a[i][j];
}
fin >> b[i];
cout << fixed << setw(8) << setprecision(4) << b[i] << endl;
}
Chasing_method(a, b, x, N_num);
cout << "追赶法求得方程组解为：" << endl;
for (int i = 0; i < N_num; i++)
{
cout<<"x["<<i<<"]=" << fixed << setw(8) << setprecision(4) << x[i] << endl;
}
}