摘要：
#include<bits/stdc++.h> using namespace std; int n,k,p[200002],ans; int cnt,c; vector<int> v; void phi() { for(int i=2; i<=n; i++) p[i] = 0; p[1] = 1; 阅读全文
摘要：
问n! 转化成k进制后的位数和尾数的0的个数。【UVA 10061 How many zeros and how many digits?】 Given a decimal integer number you will have to find out how many trailing zero 阅读全文
摘要：
4214: Power Eggs Description Benedict bought K identical power eggs from Dropeggs.com, and now he wants to test them by dropping them from different f 阅读全文
摘要：
http://acm.zcmu.edu.cn/JudgeOnline/problem.php?id=2110 2110: 扫雷 Description 扫雷游戏你一定玩过吧！现在给你若干个n×m的地雷阵，请你计算出每个矩阵中每个单元格相邻单元格内地雷的个数，每个单元格最多有8个相邻的单元格。 0<n 阅读全文