X-man

导航

2013年5月19日 #

快速幂

摘要： http://ch.vijos.org/Contest/%E8%BE%BD%E5%AE%81%E7%9C%81%E9%98%9F%E4%BA%92%E6%B5%8B%20Weak%201/Problem/Show/%E5%BF%AB%E9%80%9F%E5%B9%82#include<stdio.h>#include<string>#include<iostream>using namespace std;string s;int mod;long long multy(long long q, long long n){ long long cnt = n 阅读全文

posted @ 2013-05-19 19:16 雨钝风轻 阅读(203) 评论(0) 推荐(0) 编辑

C - Count The Carries(南洋理工OJ)

摘要： C - Count The Carries时间限制:3000 Ms内存限制:65535 Kb问题描述One day, Implus gets interested in binary addition and binary carry. He will transfer all decimal digits to binary digits to make the addition. Not as clever as Gauss, to make the addition from a to b, he will add them one by one f... 阅读全文

posted @ 2013-05-19 13:03 雨钝风轻 阅读(421) 评论(0) 推荐(0) 编辑