HDU 6124 Euler theorem (2017 Multi-Univ Training Contest 7)
来源:互联网 发布:闲鱼淘宝介入 编辑:程序博客网 时间:2024/06/04 18:22
Problem
HazelFan is given two positive integers a,b, and he wants to calculate a mod b. But now he forgets the value of b and only remember the value of a, please tell him the number of different possible results.
已知 a ,求对于任意的 b ,a % b 有多少种可能。
Idea
显然,对于一个 a
a % a 余 0
a % (a-1) 余 1
a % (a-2) 余 2
…
当然,余数最大的取值为 < a/2 ,
∵ a 为偶数时, a % (a/2+1) 余 a/2-1, a % (a/2) 余 0 ; a 为奇数时, a % (a/2+1) 余 a/2, a%(a/2) 余 1 .同时,任意一个 b > a ,a % b 余 a 。
故总共的可能的余数为
Code
#include<bits/stdc++.h>using namespace std;int main(){ int T, a; scanf("%d", &T); while(T-- && scanf("%d", &a)) printf("%d\n", (a+1)/2+1);}
阅读全文
0 0
- HDU 6124 Euler theorem (2017 Multi-Univ Training Contest 7)
- HDU 6127 Hard challenge (极角排序+二分, 2017 Multi-Univ Training Contest 7)
- HDU 6121 Build a tree (递归+特判, 2017 Multi-Univ Training Contest 7)
- HDU 6125 Free from square (状压 dp , 2017 Multi-Univ Training Contest 7)
- HDU 6128 Inverse of sum (数论, 2017 Multi-Univ Training Contest 7)
- HDU 6058 Kanade's sum (链表, 2017 Multi-Univ Training Contest 3)
- HDU 6065 RXD, tree and sequence (LCA, 2017 Multi-Univ Training Contest 3)
- HDU 6071 Lazy Running (Dijstra, 2017 Multi-Univ Training Contest 4)
- HDU 6078 Wavel Sequence (dp + 树状数组, 2017 Multi-Univ Training Contest 4)
- HDU 6069 Counting Divisors (2017 Multi-Univ Training Contest 4)
- HDU 6070 Dirt Ratio (二分+线段树, 2017 Multi-Univ Training Contest 4)
- HDU 6073 Matching In Multiplication (拓扑+DFS, 2017 Multi-Univ Training Contest 4)
- HDU 6046 hash (HASH, 2017 Multi-Univ Training Contest 2)
- HDU 6074 Phone Call (LCA+并查集, 2017 Multi-Univ Training Contest 4)
- HDU 6076 Security Check (DP, 2017 Multi-Univ Training Contest 4)
- HDU 6085 Rikka with Candies (bitset, 2017 Multi-Univ Training Contest 5)
- HDU 6090 Rikka with Graph (贪心+构造, 2017 Multi-Univ Training Contest 5)
- HDU 6072 Logical Chain (Biset+Kosaraju, 2017 Multi-Univ Training Contest 4)
- HDFS工作原理
- hdu6129 二进制+数学
- java笔记之java多线程的安全问题
- 【Python3.6爬虫学习记录】(七)使用Selenium+ChromeDriver爬取知乎某问题的回答
- 远程挂断电话流程分析
- HDU 6124 Euler theorem (2017 Multi-Univ Training Contest 7)
- VS2010程序打包操作(超详细的)
- 数学建模--K-近邻算法
- 频道拖拽
- Kaggle 入门介绍 https://dnc1994.com/2016/04/rank-10-percent-in-first-kaggle-competition/
- Netty(一):基础概念及消息处理流程
- Java Swing 调节图片亮度
- scala学习-scala中的元组Tuple概念
- #bzoj3393#二叉树(Splay / RMQ)