星澈的博客

PathTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2034Accepted Submission(s): 555Problem DescriptionYears later, Jerry fell in l...

Keen On Everything But TriangleTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3426Accepted Submission(s): 806Problem DescriptionN...

VacationTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2273Accepted Submission(s): 1018Special JudgeProblem DescriptionTom and J...

Minimal Power of PrimeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1528Accepted Submission(s): 331Problem DescriptionYou are give...

首先要明白，以a≡b(modn)为例子“≡”是数论中表示同余的符号（注意！！这个不是恒等号）同余的定义是这样的:给定一个正整数n，如果两个整数a和b满足a-b能被n整除，即(a-b)modn=0，那么就称整数a与b对模n同余，记作a≡b(modn)，同时可成立amodn=b。也就是相当于a被n整除余数等于b的意思。威尔逊定理(p−1)!≡p−1≡−1(modp)...

string matchingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 630Accepted Submission(s): 240Problem DescriptionString matching is...

描述计算 1 至 n 中数字 X 出现的次数，其中n≥1,X∈[0,9]n≥1,X∈[0,9]。解题思路这是一道比较简单的题目，举个例子先：假设n=11,X=1n=11,X=1，那么就是求 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 这 11 个数字中 1 出现的次数，很容易能看出来结果为 4，在 1 和 10 中各出现了一次，在 11 中出现了两次。最...