数学
守护生命的绿荷
这个作者很懒,什么都没留下…
展开
-
关于欧几里得
欧几里得算法欧几里德算法又称辗转相除法,用于计算两个整数a,b的最大公约数。基本算法:设a=qb+r,其中a,b,q,r都是整数,则gcd(a,b)=gcd(b,r),即gcd(a,b)=gcd(b,a%b)。 证明略去了。基本代码实现:view source1int gcd(int a,intb)转载 2014-07-23 09:18:27 · 402 阅读 · 0 评论 -
HDU 1849(尼姆博弈)
Rabbit and GrassTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2200 Accepted Submission(s): 1669Problem Description大学时光是浪漫的,原创 2014-10-22 14:35:09 · 324 阅读 · 0 评论 -
hdu 1847(博弈)
Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5489 Accepted Submission(s): 3531Problem Description原创 2014-10-22 14:41:37 · 320 阅读 · 0 评论 -
hdu 1850(妮姆博奕)
Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4832 Accepted Submission(s): 2887Problem Descr原创 2014-10-22 14:52:57 · 681 阅读 · 0 评论 -
HDU 1556(树状数组)
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9755 Accepted Submission(s): 5020Problem DescriptionN个气球排成一排,从左原创 2014-10-27 16:53:15 · 289 阅读 · 0 评论 -
HDU 1042 (大数)
N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 56027 Accepted Submission(s): 15904Problem DescriptionGiven an integer N(0原创 2014-10-27 16:37:29 · 297 阅读 · 0 评论 -
HDU 1267(简单的动态规划)
下沙的沙子有几粒?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2844 Accepted Submission(s): 1491Problem Description2005年11月份,我们学校参加原创 2014-10-27 16:48:05 · 526 阅读 · 0 评论 -
HDU 1228(简单的字符处理)
A + BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12190 Accepted Submission(s): 7130Problem Description读入两个小于100的正整数A和B,计算原创 2014-10-27 16:58:16 · 305 阅读 · 0 评论 -
hdu 2114
Calculate S(n)Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7961 Accepted Submission(s): 2923Problem DescriptionCalculate原创 2014-10-29 18:28:14 · 399 阅读 · 0 评论 -
hdu 1846 (博弈)
Brave GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6808 Accepted Submission(s): 4580Problem Description十年前读大学的时候,中国每年都原创 2014-10-22 14:34:21 · 350 阅读 · 0 评论 -
九度oj 题目1009:二叉搜索树
import java.io.BufferedInputStream;import java.util.Scanner;public class Main1009 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner cin=new Scanner(new Bu原创 2014-08-27 22:23:55 · 466 阅读 · 0 评论 -
poj 3660 Cow Contest
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7016 Accepted: 3853DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa原创 2014-08-12 15:54:58 · 370 阅读 · 0 评论 -
Codeforces Round #259 (Div. 2)-C. Little Pony and Expected Maximum
C. Little Pony and Expected Maximumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwilight Sparkle was pla原创 2014-08-02 09:47:17 · 338 阅读 · 0 评论 -
hdu2045-不容易系列之(3)—— LELE的RPG难题
#include #include #include using namespace std;long long a[52];void f(){ int i; a[1]=3; a[2]=3; a[3]=6; for(i=4;i52;i++){ a[i]=a[i-1]+2*a[i-2]; } a[2]=6;原创 2014-07-31 10:29:31 · 278 阅读 · 0 评论 -
hdu 1002
大数不解释#include #include #include using namespace std; #define N 1200char s1[N],s2[N];int a1[N],a2[N],a[N];int main(){int i,j,k;int m,n;int q;int r;int l;int x;memset(s1,原创 2014-07-31 08:34:18 · 275 阅读 · 0 评论 -
hdu 1715 大菲波数
大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11144 Accepted Submission(s): 3773Problem DescriptionFibonacci数列,定义如下:f原创 2014-07-31 08:42:21 · 368 阅读 · 0 评论 -
poj 1664 放苹果
放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25954 Accepted: 16511Description把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。原创 2014-07-30 17:35:01 · 340 阅读 · 0 评论 -
hdu 1999 不可捉摸数
#include#include using namespace std;int main(){ int n,i,j,m,temp=0; int a[5000]={0}; a[0]=1;a[1]=1; for(i=2;i { a[i]=0; for(j=1;j原创 2014-07-31 08:47:45 · 356 阅读 · 0 评论 -
hdu 2048 神、上帝以及老天爷
神、上帝以及老天爷Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22034 Accepted Submission(s): 9277Problem DescriptionHDU 2006'10 ACM原创 2014-07-31 16:49:08 · 265 阅读 · 0 评论 -
hdu-1290-献给杭电五十周年校庆的礼物
直接公式 算是直线分平面的一个子问题原创 2014-07-31 16:44:55 · 287 阅读 · 0 评论 -
HDU 1848 (SG)
Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5365 Accepted Submission(s): 2250Problem Description原创 2014-10-22 14:30:37 · 374 阅读 · 0 评论