文件名称:BitMagic
-
所属分类：
- 标签属性：
- 上传时间：2015-07-03
-
文件大小：1.53kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
You are given N numbers: d[0], d[1], ..., d[N - 1].
Output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number before d[i] which equals d[i], otherwise output 0.
Then, output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number after d[i] which equals d[i], otherwise output 0.
Input Format
N // count of the numbers in the input.
d[0] // 1st number
d[1] // 2nd number
...
d[n - 1] // last number
Output Format
The first line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number before b[i] which is equal to b[i].
The second line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number after b[i] which is equal to b[i].-You are given N numbers: d[0], d[1], ..., d[N - 1].
Output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number before d[i] which equals d[i], otherwise output 0.
Then, output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number after d[i] which equals d[i], otherwise output 0.
Input Format
N // count of the numbers in the input.
d[0] // 1st number
d[1] // 2nd number
...
d[n - 1] // last number
Output Format
The first line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number before b[i] which is equal to b[i].
The second line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number after b[i] which is equal to b[i].
Output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number before d[i] which equals d[i], otherwise output 0.
Then, output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number after d[i] which equals d[i], otherwise output 0.
Input Format
N // count of the numbers in the input.
d[0] // 1st number
d[1] // 2nd number
...
d[n - 1] // last number
Output Format
The first line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number before b[i] which is equal to b[i].
The second line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number after b[i] which is equal to b[i].-You are given N numbers: d[0], d[1], ..., d[N - 1].
Output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number before d[i] which equals d[i], otherwise output 0.
Then, output a string of bits with N bits (0/1) in which the i-th bit is 1 if there is any number after d[i] which equals d[i], otherwise output 0.
Input Format
N // count of the numbers in the input.
d[0] // 1st number
d[1] // 2nd number
...
d[n - 1] // last number
Output Format
The first line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number before b[i] which is equal to b[i].
The second line contains a string of n bits, where the i-th bit (as read left to right) indicates if there is any number after b[i] which is equal to b[i].
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Test2.cpp
Test.cpp
Test.cpp
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。