- 博客(7)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 COdeforces Round #264 (Div. 2) C. Gargari and Bishops
直接暴力枚举，分别枚举hei #include #include #include #include #include #include using namespace std; typedef long long ll; const int maxn = 2005; int grid[maxn][maxn]; ll a[maxn<<1],b[maxn<<1]; int n; in
2014-08-31 00:31:24
436
原创 Light OJ 1138 - Trailing Zeroes (III)
采用二分法， #include #include #include using namespace std; typedef long long ll; const int maxn = 1000000000; ll fac(int n,int x){ ll ans = 0; while(n){ ans += n/x; n /= x;
2014-08-12 12:25:01
676
原创 Codeforces Round #260 (Div. 2)B. Fedya and Maths
#include #include #include #include #include #include #include using namespace std; const int maxn = 100005; char num[maxn]; int n; int mpow(int x,int y){ int ans = 1; for(;y;y>>=1){
2014-08-09 17:06:07
376
原创 Light OJ 1090 - Trailing Zeroes (II)
#include #include #include #include #include #include #include using namespace std; int fac(int x , int y){//N! int s = 0 ; while(x){ s += x/y ; x /= y ; } ret
2014-08-07 16:24:38
557
原创 Codeforces Round #256 (Div. 2) D. Multiplication Table
#include #include #include #include #include #include #include using namespace std; typedef long long ll; int main(){ // freopen("in.txt","r",stdin); ll n,m,k; while(cin>>n>>m>>
2014-08-05 14:18:36
434
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人