| 比赛 |
防止浮躁的小练习v0.3 |
评测结果 |
AAAAAAAAAA |
| 题目名称 |
数字积木 |
最终得分 |
100 |
| 用户昵称 |
_Itachi |
运行时间 |
0.037 s |
| 代码语言 |
C++ |
内存使用 |
0.29 MiB |
| 提交时间 |
2016-10-12 16:00:01 |
显示代码纯文本
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
#define Tree_In_Tree_With_Chairman_Tree int
const Tree_In_Tree_With_Chairman_Tree maxn=1005;
#define Tree_In_Tree_with_Chairman_Tree string
Tree_In_Tree_with_Chairman_Tree Tree_in_Tree_with_Chairman_Tree[maxn];Tree_In_Tree_With_Chairman_Tree tree_in_tree_with_Chairman_Tree;
bool Tree_IN_Tree_With_ChairMan_TRee(Tree_In_Tree_with_Chairman_Tree Tree_IN_Tree_With_Chairman_Tree,Tree_In_Tree_with_Chairman_Tree Tree_iN_Tree_With_Chairman_Tree){
return Tree_IN_Tree_With_Chairman_Tree
+Tree_iN_Tree_With_Chairman_Tree
>Tree_iN_Tree_With_Chairman_Tree+Tree_IN_Tree_With_Chairman_Tree;
}
void _work(){
cin>>tree_in_tree_with_Chairman_Tree;
Tree_In_Tree_With_Chairman_Tree Tree_iN_Tree_With_Chairman_TRee;
for(Tree_iN_Tree_With_Chairman_TRee=0;
Tree_iN_Tree_With_Chairman_TRee<tree_in_tree_with_Chairman_Tree;
Tree_iN_Tree_With_Chairman_TRee++)
cin>>Tree_in_Tree_with_Chairman_Tree[Tree_iN_Tree_With_Chairman_TRee];
sort(Tree_in_Tree_with_Chairman_Tree,
Tree_in_Tree_with_Chairman_Tree+tree_in_tree_with_Chairman_Tree,Tree_IN_Tree_With_ChairMan_TRee);
for(Tree_iN_Tree_With_Chairman_TRee=0;
Tree_iN_Tree_With_Chairman_TRee<tree_in_tree_with_Chairman_Tree;
Tree_iN_Tree_With_Chairman_TRee++)
cout<<Tree_in_Tree_with_Chairman_Tree[Tree_iN_Tree_With_Chairman_TRee];
}
Tree_In_Tree_With_Chairman_Tree main(){
#define Tree_in_Tree_with_Chairman_tree Tree_in_tree_with_Chairman_Tree
#ifdef Tree_in_Tree_with_Chairman_tree
freopen("brick.in","r",stdin);
freopen("brick.out","w",stdout);
#endif
_work();
#ifndef Tree_in_Tree_with_Chairman_tree
getchar(),getchar();
#endif
fclose(stdin);fclose(stdout);
}