2984. 数学手稿

using namespace std;
struct Node{
        int x,y,z;
}stu[1000001];
bool cmp(Node a,Node b)
{
        return a.x*10000+a.y*100+a.z<b.x*10000+b.y*100+b.z;
}
int main()
{
        int t,i;cin>>t;
        for(i=0;i<t;i++){
                int k,n;cin>>n>>k;
                int j,index=0;
                if(k-n<0||2*n-k<0){
                        cout<<"case #"<<i<<":\n";
                        cout<<-1<<endl;
                        continue;
                }
                for(j=k-2*n;j<=(k-n)/2;j++){
                        if(j>=0&&k-n-2*j>=0&&2*n-k+j>=0){
                                stu[index].x=j;
                                stu[index].y=k-n-2*j;
                                stu[index++].z=2*n-k+j;
                        }
                }
                sort(stu,stu+index,cmp);
                cout<<"case #"<<i<<":\n";
                for(j=0;j<index;j++){
                        cout<<stu[j].x<<" "<<stu[j].y<<" "<<stu[j].z<<endl;
                }
        }
}

#include <iostream>
using namespace std;
struct distribution
{
    int m;
    int w;
    int c;
};
int cmp(const void *a, const void *b)
{
    distribution *p1 = (distribution *)a;
    distribution *p2 = (distribution *)b;
    return (p1->m * 10000 + p1->w * 100 + p1->c) - (p2->m * 10000 + p2->w * 100 + p2->c);
}
int main()
{
    int t;
    cin >> t;
    for (int z = 0; z < t; z++)
    {
        int n, k;
        cin >> n >> k;
        distribution list[1000];
        int m, w, c;
        int cnt = 0;
        for (m = 0; (m <= k / 3) && m <= n; m++)
        {
            for (w = 0; (w <= k / 2) && (m + w <= n); w++)
            {
                for (c = 0; (c <= k) && (m + w + c <= n); c++)
                {
                    if ((3 * m + 2 * w + c == k) && (m + w + c == n))
                    {
                        list[cnt].m = m;
                        list[cnt].w = w;
                        list[cnt].c = c;
                        cnt++;
                    }
                }
            }
        }
        cout << "case #" << z << ":" << endl;
        if (cnt == 0)
        {
            cout << "-1" << endl;
            continue;
        }
        qsort(list, cnt, sizeof(distribution), cmp);
        for (auto i = 0; i < cnt; i++)
        {
            cout << list[i].m << ' ' << list[i].w << ' ' << list[i].c << endl;
        }
    }
    return 0;
}

 for (man=0;man<=N;man++)
    {

        for (woman=0;woman<=N;woman++)
         {

             for (children=0;children<=N;children++)
                 {

                     if((3*man+2*woman+children==K)&&(man+woman+children==N))
          {
            a[i]=man;b[i]=woman;c[i]=children;count=1;i++;
          } }}
    }

    printf("%d %d %d\n",a[j],b[j],c[j]);

#include <bits/stdc++.h>
using namespace std;

int T, cnt, m, w, c;
struct data
{
    int m;
    int w;
    int c;
    int ans;
}d[1000];

bool cmp(data x, data y)
{
    return x.ans<y.ans;
}

void solve(int n, int k)
{
    int max_=(3*n-k)/2, min_=2*n-k;
    int l=0;
    if(max_<0||max_<min_) cout<<"-1"<<endl;
    else if(min_<0){
        for(c=0;c<=max_;++c){
            d[l].m=k-2*n+c;
            d[l].w=3*n-k-2*c;
            d[l].c=c;
            d[l].ans=10000*m+100*w+c;
            l++;
        }
    }
    else {
        for(c=min_;c<=max_;++c){
            d[l].m=k-2*n+c;
            d[l].w=3*n-k-2*c;
            d[l].c=c;
            d[l].ans=10000*m+100*w+c;
            l++;
        }
    }
    sort(d,d+l,cmp);
    for(int i=0;i<l;++i)
        printf("%d %d %d\n",d[i].m, d[i].w, d[i].c);
}
int main()
{
    cin>>T;
    while(T--){
        int n, k;
        cin>>n>>k;
        printf("case #%d:\n",cnt++);
        solve(n,k);
    }
    return 0;
}