1 条题解

  • 0
    @ 2025-9-10 0:09:10

    C++ :

    #include <stdio.h>
    #include <algorithm>
    using namespace std;
    
    int main()
    {
        //freopen("d.in","r",stdin);
        //freopen("d.out","w",stdout);
        int A,B,N,T;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d%d%d",&N,&A,&B);
            long long ans=1000000000000ll;
            if (A<B) swap(A,B);
            for (int i=0;i<=min(N/A+1,B);i++)
            {
                int forB=N-A*i;
                if (forB<0) ans=min(ans,(long long)A*i);
                else ans=min(ans,(long long)(B-forB%B)%B+N);
            }
            printf("%lld\n",ans);
        }
    }
    
    
    • 1

    信息

    ID
    2902
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者