Codeforces 124B. Permutations
2015-03-24 00:09
239 查看
这题全排列可以下标,因为每一行的数字都得按同一规则全排列,而他们的下标都一样,再乘以相应的权值就行了!
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> using namespace std; char s[20][20]; int a[20]; char index[20]; int t[20]; int main() { int n, k; int res; int temp; int sum; int count; while(cin >> n >> k) { for(int i=0; i<n; i++) cin >> s[i]; for(int i=0; i<k; i++) index[i] = i+'0'; a[0]=1; for(int i=1; i<k; i++) a[i] = a[i-1] * 10; res=100000000; do{ count=0; for(int i=0; i<n; i++) { sum=0; for(int j=0; j<k; j++) sum = sum + (s[i][j]-'0') * a[(index[j]-'0')]; t[count++] = sum; } sort(t, t+count); if(res > t[count-1]-t[0]) res = t[count-1]-t[0]; }while(next_permutation(index, index+k)); cout << res << endl; } return 0; }
相关文章推荐
- CodeForces 124B Permutations
- CodeForces 124 B.Permutations(next_permutation)
- Codeforces- 124B-Permutations (深搜找全排列以及取出一个数的每一位)
- codeforces 340E Iahub and Permutations(错排or容斥)
- codeforces 285E Positions in Permutations(DP+容斥,hard)
- 【CODEFORCES】 D. Gargari and Permutations
- Codeforces 285E Positions in Permutations (dp + 容斥)
- codeforce 124B——全排列dfs——Permutations
- CodeForces-213E:Two Permutations(神奇的线段树+hash)
- 【codeforces 501D】Misha and Permutations Summation
- Codeforces 382 D Permutations
- 【矩阵相关】[Codeforces - 736D]Permutations
- Permutations CodeForces - 189C(思维)
- Codeforces 285E - Positions in Permutations 【题解待补全】
- Codeforces 513B2 or 513B1 Permutations 策略题
- codeforces 124B、124C
- Codeforces 463D. Gargari and Permutations【DP】
- Codeforces 264 (Div. 2) D. Gargari and Permutations
- CodeForces 513B1 Permutations
- CodeForces Div124-1 hrbust 1474 哈理工oj 求字典序最大的子串【贪心】