2015 Multi-University Training Contest 5
来源:互联网 发布:我跟肌肉男的夜晚知乎 编辑:程序博客网 时间:2024/06/07 10:36
1009 MZL’s Border
字符串是可递归形式构造的,求解也是递归的;
但是递归时划分的三种情况,最终并没有做好化归
import java.io.*;import java.util.*;import java.math.*;public class Main{ static BigInteger f[] = new BigInteger[1005]; public static void main(String[] args){ f[1] = new BigInteger("1"); f[2] = new BigInteger("2"); for(int i = 3; i <= 1001; i++) f[i] = f[i - 1].add(f[i - 2]); Scanner cin = new Scanner(System.in); int T = cin.nextInt(); int n; BigInteger m; for(int cas = 1; cas <= T; cas++){ n = cin.nextInt(); m = cin.nextBigInteger(); BigInteger mm = m.add(new BigInteger("1")); int p = 0; for(int i = 1; i <= 1001; i++){ if(f[i].compareTo(mm) > 0){ p = i; break; } } BigInteger ans = m.subtract(f[p - 2]); System.out.println(ans.mod(new BigInteger("258280327"))); } }}
0 0
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5(HDOJ5351)
- 2015 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 5 - 1002 MZL's xor
- 2015 Multi-University Training Contest 5 - MZL's simple problem
- 2015 Multi-University Training Contest 5 1009 模板
- 2015 Multi-University Training Contest-5 MZL's xor
- 2015 Multi-University Training Contest-5 MZL's chemistry
- 2015 Multi-University Training Contest 1
- 2015 Multi-University Training Contest 1记录
- 2015 Multi-University Training Contest HDU5297
- 2015 Multi-University Training Contest 2
- 2015 Multi-University Training Contest 2
- 2015 Multi-University Training Contest 2
- 2015 Multi-University Training Contest 3
- 华为OJ(查找兄弟单词)
- html表单标记简单使用
- c++ string 路径处理
- HDOJ 题目3966 Aragorn's Story(Link Cut Tree成段加减点权,查询点权)
- WINCE应用程序全屏显示
- 2015 Multi-University Training Contest 5
- 模板多态
- 前端性能优化
- LeetCode: SingleNumIII
- 小米运维部14年校招笔试题A的个人答案
- a 标签绑定事件异常
- 状态栏被遮挡时的修改
- c++中按位取反运算,类型转换,扩位
- iOS笔记