模拟
文章平均质量分 64
算法之旅
订阅笔试机试专栏,共同进步!
展开
-
HDU-1443 Joseph
Problem Description The Joseph\\\\\\\'s problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is goin原创 2016-01-24 22:56:39 · 3438 阅读 · 0 评论 -
POJ-3735 Training little cats
POJ-3735 Training little catsg i — 给第 i 只猫一颗花生 e i — 吃掉第 i 只猫的所有花生 s i j — 交换第 i 只猫和第 j 只猫的花生共有n只猫,k次操作,重复这k个操作m次对于(n+1)*1的矩阵 0 //第一只猫的初始值 0 //2 0 //3 … 0 //n 1 //增量我们需要动态构造一个N*N的矩阵(N=n+1) 以原创 2017-03-22 01:30:53 · 9068 阅读 · 0 评论