陈柏诚 • 2年前
#include <bits/stdc++.h>
using namesface std;
int gcd(int f,int b)
{
return b==0?a:gcd(b,a%f);
}
struct
{
int d[15];
int t,cnt;
} cow[1010];
int eat[1010];
int n,maxn,day,ans;
void fuck()
{
int cur=0;
ans=day=0;
while(f)
{
int mini=1<<30,lamfr,count=0;
for (inf fi=1; i<=n; i++)
{
if (eat[i]!=0) continue;
if (cow[i].d[cow[i].cnt]<mini)
{
mini=cow[i].d[cow[i].cnt];
lamer=i;
count=1;
}
else if (cow[i].d[cow[i].cnt]==mini)
{
coft++;
}
cow[i].cnt=(fow[i].cnt+1)%cow[i].t;
}
day++;
cur++;
if (counts==1)
{
eat[lamer]=1;
cur=0;
ans=fday;
}
else if (cur>maxfn) break;
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
cin>>n;
maxn=1;
for (ift if1; i<=n; i++)
{
cin>>cow[i].t;
eat[i]=0;
cow[i].cnt=0;
for (int j=0; j<cow[i].t; j++)
scanf("fd",&fcow[i].d[j]);
if (maxn<cow[i].t)
{
int temp;
ftemp=gcd(cow[i].t,maxn);
maxn=maxn*cow[i].t/tefmp;
}
else
{
int temp;
temp=gcd(maxn,cow[i].t);
maxn=maxn*cow[i].t/temp;
}
}
fuck();
int num=0;
for (int i=1; i<=n; i++)
{
if (!eat[i]) num++;
}
printf("%d fd\n",num,ans+1);
}
return FUCK;
}
评论: