摘要：BellTime Limit:3000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4767DescriptionWhat? MMM is learning Combinatorics!?Look... 阅读全文

摘要：C Looooops Description A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement; I.e., a loop which starts by setting variable to value A and while variable is not equal to B, repeats statement followed by increasing the variable by C. We want to know how many times does the statement get executed for particular values of A, B and C, assuming that all arithmetics is calculated in a k-bit unsigned integer type 阅读全文

摘要：X问题Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3921Accepted Submission(s): 1253Problem Descrip... 阅读全文

摘要：Modular InverseTime Limit:2 Seconds Memory Limit:65536 KBThe modular modular multiplicative inverse of an integeramodulomis an integerxsuch thata-1≡x(... 阅读全文

摘要：历届试题 买不到的数目 时间限制：1.0s 内存限制：256.0MB问题描述小明开了一家糖果店。他别出心裁：把水果糖包成4颗一包和7颗一包的两种。糖果不能拆包卖。小朋友来买糖的时候，他就用这两种包装来组合。当然有些糖果数目是无法组合出来的，比如要买 10 颗糖。你可以用计算机测试一下，在这种包装... 阅读全文

摘要：C -Chinese remainder theorem againTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescription我知道部分同学最近在看中国剩余定理，就这个定理本身，还是比较简单的：假设m1,... 阅读全文

摘要：青蛙的约会Time Limit:1000MSMemory Limit:10000KTotal Submissions:94174Accepted:17412Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西... 阅读全文

摘要：RomanticTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3218 Accepted Submission(s): 1274Prob... 阅读全文

摘要：BiorhythmsTime Limit:1000MSMemory Limit:10000KTotal Submissions:117973Accepted:37026DescriptionSome people believe that there are three cycles in a pe... 阅读全文

摘要：欧几里得算法作用：计算两个数的最大公约数。算法：欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。用gcd(a, b)表示a和b的最大公约数。gcd函数的基本性质：gcd(a,b)=gcd(b,a)=gcd(-a,b)=gcd(|a|,|b|)=gcd(a,b-a)C实现：typede... 阅读全文

摘要：扩展欧几里德求逆元模板:#include#define __int64 long longusing namespace std;//举例 3x+4y=1 ax+by=1//得到一组解x0=-1，y0=1 通解为x=-1+4k,y=1-3kinline __int64 extend_gcd(__in... 阅读全文

摘要：BellTime Limit:3000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4767Appoint description:DescriptionWhat? MMM is learning... 阅读全文