微软2014实习生在线测试之K-th string
2014-04-12 23:12
447 查看
问题描述:
Time Limit: 10000ms
Case Time Limit: 1000ms
Memory Limit: 256MB
Description
Consider a string set that each of them consists of {0, 1} only. All strings in the set have the same number of 0s and 1s. Write a program to find and output the K-th string according to the dictionary order. If such a string doesn’t exist, or the input is
not valid, please output “Impossible”. For example, if we have two ‘0’s and two ‘1’s, we will have a set with 6 different strings, {0011, 0101, 0110, 1001, 1010, 1100}, and the 4th string is 1001.
Input
The first line of the input file contains a single integer t (1 ≤ t ≤ 10000), the number of test cases, followed by the input data for each test case.
Each test case is 3 integers separated by blank space: N, M(2 <= N + M <= 33 and N , M >= 0), K(1 <= K <= 1000000000). N stands for the number of ‘0’s, M stands for the number of ‘1’s, and K stands for the K-th of string in the set that needs to be printed
as output.
Output
For each case, print exactly one line. If the string exists, please print it, otherwise print “Impossible”.
Sample In
3
2 2 2
2 2 7
4 7 47
Sample Out
0101
Impossible
01010111011
基本思路:
简单点就是不断查找第K个数,但时间复杂度比较高。O((M+N)*K)
这里使用排列组合思想。时间复杂度O((M+N)*log(M))
首先分析共有多少可能,即排除Impossible。一共M+N位数字,M个'1',则共有
![](http://latex.codecogs.com/gif.latex?\textrm{C}_{M+N}^M)
种可能,凡是大于此数的K均为不合法。
然后对结果从高位到低位分析,若第1位是'0',剩下的数字中就有M个'1',N-1个0,共有
![](http://latex.codecogs.com/gif.latex?{k\_max} = \textrm{C}_{M+N-1}^{N-1})
种可能。
若K<k_max,则第1位是'0'
若K>k_max,则第1位是'1',K = K - k_max
若K==k_max,则前M位均为'1',剩下的N位为'0'
以此类推,得到代码,代码中M代表0,N代表1的个数:
Time Limit: 10000ms
Case Time Limit: 1000ms
Memory Limit: 256MB
Description
Consider a string set that each of them consists of {0, 1} only. All strings in the set have the same number of 0s and 1s. Write a program to find and output the K-th string according to the dictionary order. If such a string doesn’t exist, or the input is
not valid, please output “Impossible”. For example, if we have two ‘0’s and two ‘1’s, we will have a set with 6 different strings, {0011, 0101, 0110, 1001, 1010, 1100}, and the 4th string is 1001.
Input
The first line of the input file contains a single integer t (1 ≤ t ≤ 10000), the number of test cases, followed by the input data for each test case.
Each test case is 3 integers separated by blank space: N, M(2 <= N + M <= 33 and N , M >= 0), K(1 <= K <= 1000000000). N stands for the number of ‘0’s, M stands for the number of ‘1’s, and K stands for the K-th of string in the set that needs to be printed
as output.
Output
For each case, print exactly one line. If the string exists, please print it, otherwise print “Impossible”.
Sample In
3
2 2 2
2 2 7
4 7 47
Sample Out
0101
Impossible
01010111011
基本思路:
简单点就是不断查找第K个数,但时间复杂度比较高。O((M+N)*K)
这里使用排列组合思想。时间复杂度O((M+N)*log(M))
首先分析共有多少可能,即排除Impossible。一共M+N位数字,M个'1',则共有
种可能,凡是大于此数的K均为不合法。
然后对结果从高位到低位分析,若第1位是'0',剩下的数字中就有M个'1',N-1个0,共有
种可能。
若K<k_max,则第1位是'0'
若K>k_max,则第1位是'1',K = K - k_max
若K==k_max,则前M位均为'1',剩下的N位为'0'
以此类推,得到代码,代码中M代表0,N代表1的个数:
#include <iostream> #include <algorithm> #include <cmath> using namespace std; long long int cc(int n, int k){ double biggest_seq = 1 ; for ( int i = 0 ; i < k ; i ++) { biggest_seq *= ((double)n-i)/(k-i) ; } return floor(biggest_seq+0.0002); } int main() { int count = 0 ; cin >> count; int n, m, seq ; while ( count --) { cin >> m >> n >> seq; unsigned int biggest = 0; unsigned int smallest = 0; long long int biggest_seq = 1 ; char *ch = new char[m+n+1]; int ch_count = 0; ch[m+n] = '\0'; biggest_seq = cc(m+n, m) ; if ( biggest_seq < seq ) { cout << "Impossible\n"; continue; } int i, j; for ( i = 1, j = 0; i <= m && j < n ; ) { // if the highest value is 1 biggest_seq = cc(m-i+n-j, m-i) ; //cout << biggest_seq << ' ' << seq << ' '; if ( biggest_seq > seq ) { ch[ch_count++] = '0'; i ++; } else if ( biggest_seq < seq ) { ch[ch_count++] = '1'; seq -= biggest_seq; j ++; } else if ( biggest_seq == seq ) { ch[ch_count++] = '0'; while ( j < n ) { ch[ch_count++] = '1'; j ++; } while ( i < m ) { ch[ch_count++] = '0'; i ++; } } } while ( j < n ) { ch[ch_count++] = '1'; j ++; } while ( ch_count < m+n ) { ch[ch_count++] = '0'; i ++; } cout << ch << endl; } }
相关文章推荐
- 微软2014实习生在线测试之k-th string
- 微软2014实习生在线测试之K-th string
- 微软2014实习生及秋令营技术类职位在线测试——K-th string
- 微软2014实习生及秋令营技术类职位在线测试 K-th string
- 微软2014实习生及校招秋令营技术类职位在线测试:2.K-th string
- 微软2014实习生招聘在线测试第2题——K-th string
- 微软2014实习生及秋令营技术类职位在线测试: K-th string
- 【微软2014实习生及秋令营技术类职位在线测试】题目2 : K-th string
- 微软2014实习生及秋令营技术类职位在线测试-K-th string
- 微软2014实习生及秋令营技术类职位在线测试-题目2 : K-th string
- 微软2014实习生及秋令营技术类职位在线测试之 2. K-th String
- 微软2014实习生及秋令营技术类职位在线测试-题目1 : String reorder
- K-th string (微软2014实习生及秋令营技术类职位在线测试题)
- 微软2014实习生在线测试
- 微软2014实习生及秋令营技术类职位在线测试 题目1 : String reorder
- 微软2014实习生及秋令营技术类职位在线测试-2_kth string
- 微软2014实习生在线测试之String reorder .
- 微软2014实习生及秋令营技术类职位在线测试返回比赛列表
- 微软2014实习生及秋令营技术类职位在线测试——String reorder
- 微软2014实习生及秋令营技术类职位在线测试题目1+题目2