DTL66的博客

1.欧几里德： 应用：用于求a,b的最大公约数：递归解法：__int64 gcd(__int64 a,__int64 b)//求解a,b的最大公约数 { if(a%b==0)//b为最大公约数 return b; return gcd(b,a%b);//gcd(a,b)=gcd(b,a%b) } 非递归解法：__int64 gcd(__int64 a,__in

C - F是签到题Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeOpenJ_Bailian 1061 Description 两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西

Strange Way to Express IntegersTime Limit:1000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu DescriptionElina is reading a book written by Rujia Liu, which introduces a strange way to expr

C - BiorhythmsTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmitStatusPractice Description人生来就有三个生理周期，分别为体力、感情和智力周期，它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天，人

F - C LooooopsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu DescriptionA Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable !

RomanticTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u DescriptionThe Sky is Sprite. The Birds is Fly in the Sky. The Wind is Wonderful. Blew Throw the Trees Tree