题目1062:分段函数
题目1063:整数和
题目1064:反序数
题目1065:输出梯形
参考代码:
import java.io.IOException;
import java.io.StreamCorruptedException;
import java.util.*;
public class Main {
public static void main(String arg[]) throws IOException{
//1064 反序数
/*for(int i=1000;i<=1111;i++)
{
char[] s1=Integer.toString(i).toCharArray();
char[] s2=Integer.toString(i*9).toCharArray();
if(s1[0]==s2[3]&&s1[1]==s2[2]&&s1[2]==s2[1]&&s1[3]==s2[0]) System.out.println(i);
}*/
String x1 ="";
String y1 ="";
String[] x = new String[3001];
String[] y = new String[3001];
for(int i=0;i<3001;i++){
x[i] = x1;
y[i] = y1;
x1 += '*';
y1 += ' ';
}
Scanner sc = new Scanner(System.in);
while(sc.hasNext()){
//1062 分段函数
/*double x = sc.nextDouble();
double y;
if(x>=0.0 && x<2.0) y=-x+2.5;
else if(x<4 && x>=2) y= (2-1.5*(x-3)*(x-3));
else y=x/2-1.5;
System.out.format("%.3f\n",y);*/
//1063 整数和
/*Integer n = sc.nextInt();
System.out.println((2*n+n)*(Math.abs(n)+1)/2);*/
//1063 输出梯形 (先预存数组,再输出大幅度降低时间)
Integer n = sc.nextInt();
for(int i=0;i<n;i++)
{
System.out.print(y[3*n-2-i*2-n]);
System.out.print(x[n+i*2]);
System.out.println();
}
}
}
}