UVA_2379 Help is needed for Dexter(math)
来源:互联网 发布:自制编程语言 编辑:程序博客网 时间:2024/06/06 05:30
题目请点我
题解:
容易发现是可以不断降维的,奇数从最中间往后都减去中值,可以得到两个相同的子列以及中间一个0;偶数类似,得到两个相同的子列。同学直接对N以2为底取对数思路也是一样的。
代码实现:
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#define LL long longusing namespace std;int N;int a[4] = {0,1,2,2};int result;int main(){ while( scanf("%d",&N) != EOF ){ result = 0; while( N >= 3 ){ if( N%2 == 0 ){ result++; N = N/2; } else{ result++; N = (N-1)/2; } } result += a[N]; printf("%d\n",result); } return 0;}
0 0
- UVA_2379 Help is needed for Dexter(math)
- Help is needed for Dexter
- Help is needed for Dexter
- Help Is needed for Dexter
- Help is needed for Dexter
- Help is needed for Dexter
- UVA 11384 Help is needed for Dexter (找规律)
- uva 11384 正整数序列( Help is needed for Dexter)
- Uva 11384 - Help is needed for Dexter()
- 正整数序列 (Help is needed for Dexter, UVa 11384)
- UVA - 11384 - Help is needed for Dexter (找规律!!)
- uva 11384 Help is needed for Dexter(模拟)
- UVA 11384 Help is needed for Dexter(找规律)
- UVA Help is needed for Dexter 11384 (递归)
- UVA 11384 - Help is needed for Dexter
- uva 11384 Help is needed for Dexter
- Uva-11384-Help is needed for Dexter
- UVA 11384 - Help is needed for Dexter
- 经典的Oracle修改表结构文档
- Linux find 用法示例
- Linux进程间通信(一)---进程间通信概述及其种类
- java开发环境搭建
- Android移动应用开发之MySQL操作
- UVA_2379 Help is needed for Dexter(math)
- ViewPropertyAnimator介绍
- 用 PHP 编写支持高并发的网站
- java 理解Java对象序列化
- [leetcode] Longest Substring Without Repeating Characters
- fibonacci递归算法的“备忘录/Memo”优化法
- 自定义EditText画任意行线并限制文本的物理长度
- CAS简介
- 整理入门笔记_Spring