QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#57488 | #4398. Luxury cruise ship | qinjianbin# | AC ✓ | 231ms | 1840kb | C++17 | 701b | 2022-10-22 14:08:32 | 2022-10-22 14:08:35 |
Judging History
answer
#include<cstdio>
typedef long long LL;
LL n;
const LL x0=-22,y0=5;
LL min(LL x,LL y)
{
if (x==-1) return y;
return x<y?x:y;
}
void standing_by()
{
int i;
LL tot;
LL tmp;
LL ans=-1;
LL x,y;
scanf("%lld",&n);
tmp=0;
for(i=1;tmp!=1;i++)
{
tmp=(tmp+31)%7;
//printf("%d %lld\n",i,i*31);
}
tot=n/365;
for(i=0;i<=tot&&i<=100000;i++)
{
tmp=n-(tot-i)*365;
x=x0*tmp;
y=y0*tmp;
x=x%31;
if (x<0) x+=31;
y=(tmp-x*7)/31;
if (y>=0)
{
ans=min(ans,x+y+tot-i);
}
}
printf("%lld\n",ans);
}
void complete()
{
}
int main()
{
int t;
scanf("%d",&t);
for(;t;t--)
{
standing_by();
complete();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 231ms
memory: 1840kb
input:
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101...
output:
-1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 2 -1 -1 -1 -1 -1 -1 3 -1 -1 -1 -1 -1 -1 4 -1 -1 1 -1 -1 -1 5 -1 -1 2 -1 -1 -1 6 -1 -1 3 -1 -1 -1 7 -1 -1 4 -1 -1 -1 8 -1 -1 5 -1 -1 2 9 -1 -1 6 -1 -1 3 10 -1 -1 7 -1 -1 4 11 -1 -1 8 -1 -1 5 12 -1 -1 9 -1 -1 6 13 -1 3 10 -1 -1 7 14 -1 4 11 -1 -1 8 15 -1 5 12 -1 -...
result:
ok 1000 lines