荔园在线

荔园之美,在春之萌芽,在夏之绽放,在秋之收获,在冬之沉淀

[回到开始] [上一篇][下一篇]


发信人: kaman (天外飞仙), 信区: ACMICPC
标  题: 偶数幻方算法(转载)
发信站: 荔园晨风BBS站 (2004年09月14日20:40:24 星期二), 站内信件

【 以下文字转载自 kaman 的信箱 】
寄信人: kaman.bbs@argo.zsu.edu.cn
标  题: [转寄] 贴个偶数阶幻方的构造,方法就是肥仔上次评讲时说的那个
发信站: 荔园晨风BBS站 BBS 信差
来  源: from argo.zsu.edu.cn (argo.zsu.edu.cn [202.116.64.6])
日  期: Tue Sep 14 20:38:41 2004

发信人: zhonglei (radium), 信区: ACMICPC
标  题: 贴个偶数阶幻方的构造,方法就是肥仔上次评讲时说的那个
发信站: 逸仙时空 Yat-sen Channel (Mon Sep 13 23:07:54 2004)

其中matrix矩阵就是幻方

for(i*i<{i++)
                        a[i][i]+
                for(i{i>*i--)
                        a[i][n-i+1]mi+1;
                tm1;
                for(j*j<{j++){
                        if(a[1][j])
                                continue;
                        a[1][j]?
                        t--;
                }
                a[2][1]la[2][n]*
                t+
                while(t襹|t*+1-2)
                        t++;
                for(j*j<{j++){
                        if(a[2][j])
                                continue;
                        a[2][j]?
                        t++;
                        while(t襹|t*+1-2)
                                t++;
                }
                for(i;i<o2;i++){
                        t*
                        while(t*||t*+1-i)
                                t++;
                        for(j*j<{j++){
                                if(a[i][j])
                                        continue;
                                a[i][j]?
                                t++;
                                while(t*||t*+1-i)
                                        t++;
                        }
                }
                for(io2+1;i<{i++){
                        t{
                        while(t*||t*+1-i)
                                t--;
                        for(j*j<{j++){
                                if(a[i][j])
                                        continue;
                                a[i][j]?
                                t--;
                                while(t*||t*+1-i)
                                        t--;
                        }
                }
                for(i*i<{i++){
                        for(j*j<{j++)
                                b[i][j]j(a[i][j]-1);
                }
                for(i*i<{i++){
                        for(j*j<{j++){
                                matrix[i][j]膉][i]+b[i][j];
                        }
                }
--

※ 来源:.逸仙时空 Yat-sen Channel http://bbs.zsu.edu.cn [FROM: 192.168.48.151]
--
※ 转寄:.逸仙时空 Yat-sen Channel bbs.zsu.edu.cn.[FROM: BBS.szu.edu.cn]
--
※ 转载:·荔园晨风BBS站 bbs.szu.edu.cn·[FROM: 192.168.111.200]


[回到开始] [上一篇][下一篇]

荔园在线首页 友情链接:深圳大学 深大招生 荔园晨风BBS S-Term软件 网络书店