| 123456789101112131415161718192021222324252627282930313233 |
- <view>
- <view class="header margin-bottom">
- <view class="header-main">
- <view class="flex-box flex-v-ce" >
- <view class="laber">奖票对象</view>
- <view class="flex-1">{{dataDetail.rule_list }}</view>
- </view>
- <view class="flex-box flex-v-ce" >
- <view class="laber">奖票时间</view>
- <view class="flex-1">{{dataDetail.date }}</view>
- </view>
- <view class="flex-box flex-v-ce">
- <view class="laber">发放人</view>
- <view class="flex-1">{{dataDetail.recorder_name}}</view>
- </view>
- </view>
- </view>
- <view class="main margin-bottom">
- <view class="mian-title border-bottom">对于积分事件</view>
- <view class="header-main">
- <view class="shijContent">
- <view style="word-break: break-all;">
- 在本题中，读入一个无向图的邻接矩阵（即数组表示），建立无向图并按照以上描述中的算法遍历所有顶点，输出遍历顶点的顺序。【输入形式】输入的第
- 一行包含一个正整数n，表示图中共有n个顶点。其中n不超过50。以后的n行中每行有n个用空格隔
- </view>
- <view class="red">+ 10分</view>
- </view>
- </view>
- </view>
- <view class="bottom"> <view class="blueBtn" catchTap="openCx">撤回奖票</view></view>
- <view style="height:2rem"></view>
- </view>
|
