3 solutions
- 1
Information
- ID
- 778
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- # Submissions
- 48
- Accepted
- 19
- Uploaded By
from 课件
#include<bits/stdc++.h>
using namespace std;
int main(){
int v[4]={10,20,50,100},f[9999],n;
cin>>n;
f[0]=1;
for(int i=0;i<4;i++){
for(int j=v[i];j<=n;j++){
f[j]+=f[j-v[i]];
}
}
cout<<f[n]<<endl;
}
#include <bits/stdc++.h>
using namespace std;
int a[5]={0,10,20,50,100};
long long dp[10001],f[10001];
int main()
{
f[0]=1;
int n;
cin>>n;
if(n%10!=0)
{
cout<<0;
return 0;
}
for(int i=1;i<=4;i++)
{
for(int j=a[i];j<=n;j++)
{
f[j]+=f[j-a[i]];
}
}
cout<<f[n];
return 0;
}
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.