Hamster Farm

仓鼠农场 - CodeForces 939B - 虚拟法官 (csgrandeur.cn)

以后初始化无穷再也不inf=0x3f3f3f3fl了,具体要看题目给的数据范围

#include<bits/stdc++.h>
#define x first
#define int long long
#define gcfx main
#define y second
#define mak make_pair
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define debug(a) cout<<a<<'\n'
#define endl '\n'
#define umap unordered_map
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
const int N=2e5+10,M=1,inf=0x3f3f3f3f,mod=1e9+7;
int n,k;
int a[N];

signed gcfx()
{
	IOS;
	cin>>k>>n;//k 仓鼠的数目 n种规格的xz
	for(int i=1;i<=n;i++) cin>>a[i];
	int res=1e18+10,idx;
	for(int i=1;i<=n;i++)
	{
		int x=k%a[i];
		if(res>x)
		{
		   idx=i;
		   res=x;
	    }
	}
	
	cout<<idx<<" ";
	cout<<k/a[idx]<<endl;
	
	return 0;
}

END