import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while (t-- > 0) {
int n = sc.nextInt();
int An[] = new int[n];
int Bn[] = new int[n];
for (int i = 0; i < Bn.length; i++) {
An[i] = sc.nextInt();
Bn[i] = sc.nextInt();
}
for (int i = 0; i < An.length; i++) {
for (int j = i+1; j < An.length; j++) {
if (An[i]>An[j]) {
int temp = An[i];
An[i] = An[j];
An[j] = temp;
temp = Bn[i];
Bn[i] = Bn[j];
Bn[j] = temp;
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < Bn[i]; j++) {
System.out.print(">+");
for (int j2 = 0; j2 < An[i]-2; j2++) {
System.out.print("-");
}
System.out.println("+>");
}
System.out.println();
}
}
sc.close();
}
}
HDOJ 2550 百步穿杨
最新推荐文章于 2021-05-16 20:16:40 发布