HNUSTOJ 1516:Loky的烦恼
1516: Loky的烦恼
时间限制: 1 Sec 内存限制: 128 MB
提交: 242 解决: 66
[提交][状态][讨论版]
题目描述
loky喜欢上一个女孩,女孩在loky眼中绝对是10分女。唯一有点遗憾的是女生有点近视,为了不影响她的美貌,所以她不想戴眼镜,这下问题来了--电脑上的数字她看不清楚。loky想如果自己能把这问题解决了,说不定女孩就喜欢上自己了。数字放大的模型loky已经搞定:数字
输入
多行输入。每行包括一个由数字0-9构成的字符串s,s长度不超过10000。
输出
每一行输入的字符串产生的输出描述如下:
字符串的每个数字字符按放大形式输出。规定每一行只能输出10个数字字符,超过则换行输出,详见样例。
样例输入
0123456789
00123456789
样例输出
--- ---- ---- ---- ---- ---- --- ---
| | | | | | | | | | | | | |
| | | | | | | | | | | | | |
--- ---- --- --- --- --- ---
| | | | | | | | | | | | |
| | | | | | | | | | | | |
--- ---- ---- ---- --- --- ----
--- --- ---- ---- ---- ---- ---- ---
| | | | | | | | | | | | | |
| | | | | | | | | | | | | |
--- ---- --- --- --- ---
| | | | | | | | | | | | | |
| | | | | | | | | | | | | |
--- --- ---- ---- ---- --- ---
---
| |
| |
---
|
|
----
提示
必须极小心数字的字符格式,建议以sample为准
来源
这道题是学校oj上的题,第一次见到的时候还是刚刚学C语言不久,看着这道题很久都不知道怎么下手,今天无意中又看到了这道题,觉得应该再尝试一下,然后就写起了代码,终于写出来了,别提多开心了,虽然这道题不难,但是能做出自己以前没做出的题,虽然只是迈出一小步,但是真的很开心;
代码如下:
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const char d[10][7][7]={
{" --- "," | |"," | |"," "," | |"," | |"," --- "},{" "," | "," | "," "," | "," | "," "},
{" ---- "," |"," |"," --- "," | "," | "," ----"},{" ---- "," |"," |"," ---- "," |"," |"," ---- "},
{" "," | |"," | |"," --- "," |"," |"," "},{" ----"," | "," | "," --- "," |"," |"," ---- "},
{" ----"," | "," | "," --- "," | |"," | |"," --- "},{" ---- "," |"," |"," "," |"," |"," "},
{" --- "," | |"," | |"," --- "," | |"," | |"," --- "},{" --- "," | |"," | |"," --- "," |"," |"," ---- "}};
void print(int &n,const int *a){
for(int i=0;i<7;i++){
for(int j=0;j<n;j++){
printf("%s",d[a[j]][i]);
}
printf("\n");
}
n = 0;
}
char ch[10005];
int a[10005];
int main(){
while(scanf("%s",ch)==1){
int len = strlen(ch),cnt=0;
for(int i=0;i<len;i++){
a[cnt++] = ch[i]-'0';
if(cnt == 10 ||(i==len-1)) print(cnt,a);
}
}
}
HNUSTOJ 1516:Loky的烦恼的更多相关文章
- 【热门技术】EventBus 3.0,让事件订阅更简单,从此告别组件消息传递烦恼~
一.写在前面 还在为时间接收而烦恼吗?还在为各种组件间的消息传递烦恼吗?EventBus 3.0,专注于android的发布.订阅事件总线,让各组件间的消息传递更简单!完美替代Intent,Handl ...
- CPU阿甘之烦恼
转自“码农翻身”公共号,原文地址CPU阿甘之烦恼 总结:(程序加载到内存运行的演变过程) 内存存放程序.OS负责加载程序到内存.CPU负责运行内存中的程序 1.串行:加载一个完整程序到内存,CPU运行 ...
- BZOJ 1005 [HNOI2008] 明明的烦恼(组合数学 Purfer Sequence)
题目大意 自从明明学了树的结构,就对奇怪的树产生了兴趣...... 给出标号为 1 到 N 的点,以及某些点最终的度数,允许在任意两点间连线,可产生多少棵度数满足要求的树? Input 第一行为 N( ...
- [bzoj1935][shoi2007]Tree 园丁的烦恼(树状数组+离线)
1935: [Shoi2007]Tree 园丁的烦恼 Time Limit: 15 Sec Memory Limit: 357 MBSubmit: 980 Solved: 450[Submit][ ...
- Android Studio线下版和线上版都使用正式签名脚本(保证keysore签名文件和项目在同级目录),不用再因为繁琐的发正式版而烦恼
场景:调用微信等第三方应用时如果生成的版本不是正式签名的可能会调用失败,使用如下脚本不用再为繁琐的发正式签名版而烦恼 app项目中的build.gradle追加如下代码: //使用正式签名脚本(保证k ...
- KM算法及其优化的学习笔记&&bzoj2539: [Ctsc2000]丘比特的烦恼
感谢 http://www.cnblogs.com/vongang/archive/2012/04/28/2475731.html 这篇blog里提供了3个链接……基本上很明白地把KM算法是啥讲清楚 ...
- 【BZOJ-1863】trouble 皇帝的烦恼 二分 + DP
1863: [Zjoi2006]trouble 皇帝的烦恼 Time Limit: 1 Sec Memory Limit: 64 MBSubmit: 559 Solved: 295[Submit] ...
- nyoj925_国王的烦恼_并查集
国王的烦恼 时间限制:3000 ms | 内存限制:65535 KB 难度:2 描述 C国由n个小岛组成,为了方便小岛之间联络,C国在小岛间建立了m座大桥,每座大桥连接两座小岛.两个小岛间可能 ...
- bzoj1005 [HNOI2008]明明的烦恼
1005: [HNOI2008]明明的烦恼 Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 3032 Solved: 1209 Description ...
随机推荐
- 简单配置prometheus
一,物理节点安装配置(简单配置,未涉及报警及grafana图形展示) 1,prometheus 官网下载安装 下载安装 # pwd /usr/local/src https://github.com/ ...
- php+html5实现无刷新上传,大文件分片上传,断点续传
核心原理: 该项目核心就是文件分块上传.前后端要高度配合,需要双方约定好一些数据,才能完成大文件分块,我们在项目中要重点解决的以下问题. * 如何分片: * 如何合成一个文件: * 中断了从哪个分片开 ...
- 点云数据中的三维信息提取pcl
https://www.hanspub.org/journal/PaperInformation.aspx?paperID=24702 https://wenku.baidu.com/view/160 ...
- 源码阅读-Kingfisher
最后更新:2018-01-16 使用教程: 官方的链接 使用 Kingfisher 处理网络图片的读取与缓存 1. 开始使用 桥接 KingFisher, 利用 KingfisherCompatibl ...
- Vue.use源码分析(转)+如何封装一个组件
封装一个组件:https://www.jianshu.com/p/89a05706917a 我想有过vue开发经验的,对于vue.use并不陌生.当使用vue-resource或vue-router等 ...
- 【每日一包0002】array-first
github地址:https://github.com/ABCDdouyae... array-first 获取数组的第一项或者前几项 文档地址:https://www.npmjs.com/packa ...
- insert和insertSelective区别
两者的区别在于如果选择insert 那么所有的字段都会添加一遍即使没有值 <insert id="insert" parameterType="com.ego.po ...
- socket基本概念
1.socket 是什么? 在计算机通信领域,socket 被翻译为“套接字”,它是计算机之间进行通信的一种约定或一种方式.通过 socket 这种约定,一台计算机可以接收其他计算机的数据,也可以向其 ...
- 十一、RF操作滚动条
两种方式: 方式一:window.scrollBy(0, document.body.scrollHeight) 方式二:window.scrollTo(0, document.body.scroll ...
- 为什么我上传了flv或MP4文件到服务器,可输入正确地址通过http协议来访问总是出现“无法找到该页”的404错误呢
常用MIME类型(Flv,Mp4的mime类型设置) 也许你会在纳闷,为什么我上传了flv或MP4文件到服务器,可输入正确地址通过http协议来访问总是出现“无法找到该页”的404错误呢?这就表明mp ...