2018 蓝桥杯 C++ A组

 9. 倍数问题

#include
using namespace std;
typedef long long ll;

const int maxn=1e5;

ll nn,k,vis[maxn],tmp[maxn],num[maxn];
vectorvc;

ll dfs(ll n)
{
	if(n>=3)
    {
		ll t=tmp[0]+tmp[1]+tmp[2];
		if(t%k==0)
			vc.push_back(t);
	}
	else
		for(int i=0;i

10. 付账问题

#include
using namespace std;
const int maxn = 5e5+5;
int a[maxn],n,s;

int main()
{
	scanf("%d %d",&n,&s);
	for(int i = 0;i