2013年7月29日
hdu 4389 X mod f(x) (数位DP，打表秒杀，5级)
摘要： X mod f(x)Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1297Accepted Submission(s): 568 Problem DescriptionHere is a function f(x): int f ( int x ) { if ( x == 0 ) return 0; return f ( x / 10 ) + x % 10; } Now, you want to ... 阅读全文
posted @ 2013-07-29 20:14 剑不飞 阅读(1802) 评论(0) 推荐(0)