HDU 2132 An easy problem 小技巧

本文介绍了一个简单的递归问题——求解一个特定数列的值。对于给定的整数n,通过递归定义的方式计算sum(n)。当n能被3整除时,sum(n)等于前一项加上n的立方;否则,加上n本身。文章提供了完整的C语言代码实现,使用__int64类型确保了大数值的准确处理。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

An easy problem

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5719    Accepted Submission(s): 1556


Problem Description
We once did a lot of recursional problem . I think some of them is easy for you and some if hard for you.
Now there is a very easy problem . I think you can AC it.
  We can define sum(n) as follow:
  if i can be divided exactly by 3 sum(i) = sum(i-1) + i*i*i;else sum(i) = sum(i-1) + i;
  Is it very easy ? Please begin to program to AC it..-_-
 

Input
  The input file contains multilple cases.
  Every cases contain only ont line, every line contains a integer n (n<=100000).
  when n is a negative indicate the end of file.
 

Output
  output the result sum(n).
 

Sample Input
1 2 3 -1
 

Sample Output
1 3 30


直接模拟就可以了 但要注意的是用__int64来进行存储  下面红线的字体要注意

#include<stdio.h>
__int64  a[100010];

int main()
{
       __int64 i;  i用__int64来存储
       a[0]=0;
       a[1]=1;
       for( i=2; i<=100000; i++ )
       {
          if( i%3==0 ) a[i]=a[i-1]+i*i*i;  //如果 i用int的话 这里会越界 
          else a[i]=a[i-1]+i;    
       }
       int n;
       while(scanf("%d",&n)&&n>=0)
       {
         printf("%I64d\n",a[n]);                          
                                 
       }

}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值