ICPC-数论:模算术
文章平均质量分 78
数论中有关模算术的题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
UVA12081 LA3413 POJ2769 Reduced ID Numbers【同余】
Reduced ID NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11934 Accepted: 4666DescriptionT. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN s is an int原创 2021-05-12 00:24:14 · 128 阅读 · 0 评论 -
UVA10176 Ocean Deep! - Make it shallow!!【输入流+模除】
Ocean deep I’m so afraid to show my feelings, I have sailed a million ceilings In my solitary roomOcean deep The lines above are from a very popular song of Cl原创 2021-03-07 00:55:53 · 399 阅读 · 0 评论 -
HDU1066 Last non-zero Digit in N!【大数+模除】
Last non-zero Digit in N!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10306 Accepted Submission(s): 2474Problem DescriptionThe express...原创 2020-04-23 00:45:01 · 376 阅读 · 0 评论 -
UVA11879 Multiple of 17【模算术】
Theorem: If you drop the last digit d of an integer n (n ≥ 10), subtract 5d from theremaining integer, then the difference is a multiple of 17 if and only if n is a multiple of 17. &...原创 2020-03-09 19:28:37 · 247 阅读 · 0 评论 -
UVA11718 Fantasy of a Summation【快速模幂】
If you think codes, eat codes then sometimes you may get stressed. In your dreams you may see huge codes, as I have seen once. Here is the code I saw in my dream.Actually the code was about:‘You ar...原创 2020-02-28 22:54:19 · 299 阅读 · 0 评论 -
HDU2099 整除的尾数【模除】
整除的尾数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44553Accepted Submission(s): 18940Problem Description一个整数,只知道前几位,不知道...原创 2016-04-29 07:52:27 · 4265 阅读 · 4 评论 -
HDU1212 Big Number【大数+模除】
Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8835Accepted Submission(s): 5994Problem DescriptionAs we know, Big...原创 2017-12-08 12:49:57 · 654 阅读 · 0 评论 -
POJ1150 UVA10212 The Last Non-zero Digit【排列】
The Last Non-zero DigitTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5677 Accepted: 1770DescriptionIn this problem you will be given two decimal integer number N, M. You will have to...原创 2019-03-17 07:48:28 · 400 阅读 · 0 评论 -
UVA11582 Colossal Fibonacci Numbers!【快速模幂+数列模除】
The i'th Fibonacci number f(i) is recursively defined in the following way: • f(0) = 0 and f(1) = 1 • f(i + 2) = f(i + 1) + f(i) forevery i ≥ 0 Your task is to compute some values of this...原创 2018-04-06 00:35:47 · 435 阅读 · 0 评论 -
UVA10929 You can say 11【大数模除】
Your job is, given a positive number N, determine if it is a multiple of eleven.InputThe input is a file such that each line contains a positive number. A line containing the number ‘0’ is the end...原创 2018-05-03 08:23:15 · 703 阅读 · 0 评论 -
UVA10922 2 the 9s【大数模除+进制】
A well-known trick to know if an integer N is a multiple of nine is to compute the sum S of its digits. If S is a multiple of nine, then so is N. This is a recursive test, and the depth of the recursi...原创 2018-05-03 08:48:37 · 684 阅读 · 0 评论 -
HDU5832 A water problem【大数模除】
A water problemTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5419 Accepted Submission(s): 1768Problem DescriptionTwo planets named Haha...原创 2019-01-01 20:29:09 · 337 阅读 · 0 评论 -
POJ1604 UVA568 UVALive5499 Just the Facts【模除+打表】
Just the FactsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9631 Accepted: 5042DescriptionThe expression N!, read as “N factorial,” denotes the product of the first N positive intege...原创 2019-02-21 09:31:13 · 354 阅读 · 0 评论 -
ZOJ1222 Just the Facts【大数+模除】
Just the FactsTime Limit: 2 Seconds Memory Limit: 65536 KBThe expression N!, read as “N factorial,” denotes the product of the first N positive integers, where N is nonnegative. So, for example...原创 2019-02-21 10:49:51 · 415 阅读 · 0 评论 -
HDU1324 ZOJ1278 UVA350 UVALive5458 Pseudo-Random Numbers【模除+随机函数】
Pseudo-Random NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1064 Accepted Submission(s): 460Problem DescriptionComputers normall...原创 2019-02-21 16:05:36 · 355 阅读 · 0 评论