湖大ACM-Recaman's Sequence
来源:互联网 发布:冬天敬酒服穿什么知乎 编辑:程序博客网 时间:2024/05/01 05:19
Recaman’s Sequence
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB
Total submit users: 1547, Accepted users: 1361
Problem 10010 : No special judgement
Problem description
The Recaman’s sequence is defined by a0 = 0 ; for m > 0, am = am−1 − m if the rsulting am is positive and not already in the sequence, otherwise am = am−1 + m.
The first few numbers in the Recaman’s Sequence is 0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9 …
Given k, your task is to calculate ak.Input
The input consists of several test cases. Each line of the input contains an integer k where 0 <= k <= 500000. The last line contains an integer −1, which should not be processed.Output
For each k given in the input, print one line containing ak to the output.Sample Input
7
10000
-1Sample Output
20
18658Problem Source
Shanghai-P 2004
解决方案:超大数组保存是否使用过该值
代码部分:
#include <stdio.h>#include <malloc.h>int main (){ int arr[500001],i; int * b=(int *)malloc (4000000 *sizeof(int)); arr[0]=0; for (i=0;i<500000;i++) if ((arr[i-1]-i>0) &&((b[arr[i-1]-i])!=1) ) {arr[i]=arr[i-1]-i; b[arr[i-1]-i]=1;} else {arr[i]=arr[i-1]+i; b[arr[i-1]+i]=1;} int key=0; scanf("%d",&key); while (key!=-1) { printf ("%d\n",arr[key]); scanf("%d",&key); } return 0;}
- 湖大ACM-Recaman's Sequence
- acm pku 2091 Recaman's Sequence
- Pku acm 2081 Recaman's Sequence
- 北大ACM poj2081 Recaman's Sequence
- Recaman's Sequence
- PKUOJ2081 Recaman's Sequence
- ZOJ2421 Recaman's Sequence
- POJ2081:Recaman's Sequence
- poj2081 Recaman's Sequence
- POJ2081 Recaman's Sequence
- poj2081 Recaman's Sequence
- Recaman's Sequence
- Recaman's Sequence
- WOJ1265-Recaman's Sequence
- zoj 2421 Recaman's Sequence
- POJ 2081 Recaman's Sequence
- poj 2081 Recaman's Sequence
- POJ 2081 Recaman's Sequence
- spring整合hibernate的时候数据源配置了,hiberate 能够连接数据,但是spring却包找不到驱动啊
- Notepad++的实用技巧
- cvLoadIamge读取图片失败的几点原因(亲自试验过)VC6+OpenCV1.0
- KVM原理与架构系列之五 IO虚拟化篇
- iOS开发动态计算cell的高度
- 湖大ACM-Recaman's Sequence
- 堆和栈的区别
- struts2对获取三大作用域的封装类----BaseAction
- leetcode 237 --Delete Node in a Linked List 链表 删除节点
- 61. Rotate List LeetCode
- centos 6.5安装GitLab全过程和问题记录
- MFC消息处理时,双击鼠标左键响应单击左键消息的处理
- Battery Charging
- Android 内核 - 02 Context