Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

补充一下

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:

质疑 (98) mfkxowvfp 2010-12-21 15:27:49
- Re:质疑 (25) shixinfei 2011-01-19 13:48:41
- Re:质疑 (11) HH_YT 2012-08-25 10:38:59
Re:补充一下 (18) witstorm 2018-01-14 09:08:54

Post your reply here:

Home Page Go Back To top