百步穿楊
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3851 Accepted Submission(s): 1495
弓箭的基本樣子爲 ">+---+>",其中"+---+"爲箭身,數據保證箭身長度 > 2
每行一個N (N < 50 ),接下去有N行,第i行兩個整數Ai , Bi,分別代表需要箭身長度爲Ai的弓箭Bi枝. (Ai < 30 , Bi < 10 )
輸入數據保證每一個Ai都是不同的.
#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
struct sword {
int length;
int num;
} s[55];
bool cmp (sword a,sword b)
{
return a.length < b.length;
}
void result(int n)
{
for (int i=0;i<n;i++)
{
for (int j=0;j<s[i].num;j++)
{
cout<<">+";
for (int k=0;k<s[i].length-2;k++)
cout<<"-";
cout<<"+>";
printf("\n");
}
printf("\n");
}
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &s[i].length, &s[i].num);
}
sort(s,s+n,cmp);
result(n);
}
return 0;
}