FZOJ Problem 2219 StarCraft                                                                                          …

Description 题目描述 ZB loves playing StarCraft and he likes Zerg most! One day, when ZB was playing SC2, he came up with an idea: He wants to change the queen's ability, the queen's new ability is to choose a worker at any time, and turn it into an egg,…

                                                                                                                                          Problem 2150 Fire Game Accept: 2185    Submit: 7670Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Desc…

                                                                                              Problem 2148 Moon Game Problem Description Fat brother and Maze are playing a kind of special (hentai) game in the clearly blue sky which we can just consid…

                                                                                                                                 Problem 2107 Hua Rong Dao Accept: 401    Submit: 853Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description…

                                                                                                                                                     Problem 2110 Star Accept: 996    Submit: 2958Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem…

                                                                                                              Problem 2103 Bin & Jing in wonderland Accept: 221    Submit: 1175Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description Bin ha…

 Problem 2219 StarCraft Accept: 294    Submit: 860Time Limit: 1000 mSec    Memory Limit : 32768 KB  Problem Description ZB loves playing StarCraft and he likes Zerg most! One day, when ZB was playing SC2, he came up with an idea: He wants to change t…

中国剩余定理+原根+扩展欧几里得+BSGS 题解:http://blog.csdn.net/regina8023/article/details/44863519 新技能get√: LL Get_yuangen(LL p,LL phi){ ; ;i*i<=phi;i++) ) f[++c]=i,f[++c]=phi/i; ;;g++){ int j; ;j<=c;j++) ) break; ) return g; } ; } 求原根 void Split(int x){ num=; ;i*i&…

Description 有这样一个众所周知的问题: 你面前有7个硬币,其中有一个劣质的(它比正常的硬币轻一点点),你有一个天平,问需要你需要使用天平多少次能保证找到那个劣质的硬币. 众所周知的算法是: 第一次 把7个硬币分成3+3+1一共3堆,把前两堆放到天平的两端,若天平平了说明第三堆即剩下的那一枚硬币是劣质的,否则劣质的硬币在较轻的那一堆. 第二次 把3个硬币分成1+1+1一共3堆,把前两堆放到天平的两端,若天平平了说明第三堆即剩下的那一枚硬币是劣质的,否则劣质的硬币是较轻的那一堆的那一个硬…