Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

补充一下

Posted by archerstarlee at 2008-07-20 16:07:29 on Problem 1026
In Reply To:求解该题要注意的地方 Posted by:felips at 2007-10-16 22:41:12
> 输入:
> scanf("%d",k);
  if(k == 0)
    break;
> getchar();
> gets(s);
> for(i=0;i<=n;i++)
> {
>     if(s[i]==10 || s[i]==0) s[i]=' ';
> }
> 处理置换群:
> 分解成循环,对每个循环,做(k mod (循环的阶数))次置换就可得到加密后的信息,不能求所有循环阶数的最小公因子total,然后做total次置换,这样会超时
> 

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator