Submission #2694012

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define kd int
#define fors(i,a,b) for(int i=(a);i<=(b);++i)
int main(){
    ios::sync_with_stdio(0);
    register int a,wh[9],b,c,d,e,f,g,h,i;
    cin>>a>>b>>e;
    fors(c,0,500){
        wh[1]=a+b+c;
        if(wh[1]<a+e) continue;
        fors(i,0,500){
            wh[7]=a+e+i;
            if(wh[7]!=wh[1]) continue;
            fors(f,0,500)
            {
                wh[6]=c+f+i;
                if(wh[6]!=wh[7]) continue;
                fors(d,0,500){
                    wh[2]=d+e+f;
                    if(wh[2]!=wh[6]) continue;
                    fors(g,0,500)
                    {
                        wh[4]=g+d+a;
                        wh[8]=c+e+g;
                        if((wh[8]!=wh[4])) continue;
                        fors(h,0,500){
                            wh[3]=g+h+i;
                            wh[5]=b+e+h;
                            if((wh[3]!=wh[5]) || (wh[3]!=wh[4]) || (wh[3]!=wh[8])) continue;
                                printf("%d %d %d \n", a,b,c);
                                printf("%d %d %d \n", d,e,f);
                                printf("%d %d %d \n", g,h,i);
                                return 0;
                        }
                    }       
                }
            }
        }
    }
    return 0;
}

Submission Info

Judge Result