#pragma warning(disable:4786)
#include<iostream>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<time.h>
#include<stdlib.h>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<ctime>
#include<string.h>
using namespace std;
#define pi acos(-1.0)
//#define LL __int64
typedef long long LL;
#define INF 0x7fffffffffffffff
#define bug puts("hear!")
#define inf 0x7fffffff
#define eps 1e-10
#define FRE freopen("in.txt","r",stdin)
#define E exp(1.0)
#define mod 1000000007
int main(){
int n;
while(scanf("%d",&n)!=EOF)
{
int l,k,m;
l=n/1;
k=n/2;
m=n/3+1;
// printf("%d %d %d\n",l,k,m);
for(int i = 0 ; i <= n/3 ; i++)
{
int t = (n-3*i)/2;
m += t;
}
cout<<m<<endl;
}
return 0;
}
简单数学思想,看看能换多少个3粉的,然后从1到n个3分硬币算算能有多少2分的,剩下1分补。
HDU1284--钱币兑换问题 HDU(103)
最新推荐文章于 2022-05-05 19:38:43 发布