CF 92 div2 B
2013-07-22 21:19
351 查看
题目:http://codeforces.com/problemset/problem/124/B
思路:学会用while(next_permutation(...))
View Code
思路:学会用while(next_permutation(...))
#include <cstdio> #include <iostream> #include <cmath> #include <algorithm> #include <cstring> using namespace std; #define inf 0xfffffff int num[10][10]; int p[10]; int main() { char s; int n,k; cin>>n>>k; for(int i=0;i<n;i++) for(int j=0;j<k;j++) { cin>>s; num[i][j]=s-'0'; } for(int i=0;i<k;i++) p[i]=i; int ans=inf; do{ int mx=-inf,mi=inf; int tmp; for(int i=0;i<n;i++) { tmp=0; for(int j=0;j<k;j++) { tmp*=10; tmp+=num[i][p[j]]; } mi=min(mi,tmp); mx=max(mx,tmp); } ans=min(mx-mi,ans); }while(next_permutation(p,p+k)); cout<<ans<<endl; }
View Code
相关文章推荐
- CF 335 div.1-B/div.2-D/605 B Lazy Student
- CF 179(div2)D(floyed)
- CF 174(div2) C
- CF 174(div2) D
- CF 168(div2)
- CF 162(div2)
- CF 2015 ICL, Finals, Div. 1 J. Ceizenpok’s formula [Lucas定理]
- CF 355 div2 C, D 题解 【很好的两道脑洞题】
- cf 194 div2 BEight Point Sets
- 记一场(伪)CF (Educational Codeforces Round 40 (Rated for Div. 2) )
- 在青岛穷游打的cf codeforces Round #318 (Div. 2) A.Bear and Elections
- CF_div2_C_神代码跟踪体会。
- CF DIV1 343A shuxue
- 【打CF,学算法——二星级】Codeforces Round #313 (Div. 2) B. Gerald is into Art(水题)
- CF_DIV2_153
- 【打CF,学算法——二星级】Codeforces Round #312 (Div. 2) A Lala Land and Apple Trees
- cf #360 div2 D-Remainders Game(中国剩余定理)
- CF-Codeforces Round #418 (Div. 2)-C-An impassioned circulation of affection
- CF 题目集锦 PART 7 #264 div 2 E
- 387 div2 cf 4