Submission #1247085
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define int long long using ll=long long; using vi=vector<int>; using vl=vector<long long>; using pii=pair<int,int>; using pll=pair<long long,long long>; #define ITR(i,c) for(auto i=begin(c);i!=end(c);++i) #define FORE(x,c) for(auto &x:c) #define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i) #define REP(i,n) REPF(i,0,n) #define REPR(i,n) for(int i=(int)(n);i>=0;--i) #define REPW(i,n) for(i=0;i<(int)(n);++i) #define ALL(c) begin(c),end(c) #define RALL(c) rbegin(c),rend(c) // c++14 #define SZ(c) ((int)c.size()) #define EXIST(c,x) (c.find(x)!=end(c)) #define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w) #define dump(...) const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0}; #define INF (1001001001) #define INFLL (1001001001001001001ll) template<class T> ostream& operator << (ostream &os,const vector<T> &v) { ITR(i,v) os << *i << (i==end(v)-1 ? "" : "\n"); return os; } template<class T> istream& operator >> (istream &is,vector<T> &v) { ITR(i,v) is >> * i; return is; } template<class T> istream& operator >> (istream &is, pair<T,T> &p) { is >> p.first >> p.second; return is; } template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;} //------------------------------------------------------------------------------ struct before_main_function { before_main_function() { #ifdef int #undef INF #define INF INFLL #define stoi stoll #endif cin.tie(0);ios::sync_with_stdio(false); cout<<setprecision(15)<<fixed; } } before_main_function; //------------------------------------------------------------------------------ int x[3][3]; signed main() { cin>>x[0][0]>>x[0][1]>>x[1][1]; for(int k=0;;k++) { x[0][2]=(k-(x[0][0]+x[0][1])); x[2][2]=(k-(x[0][0]+x[1][1])); x[2][1]=(k-(x[0][1]+x[1][1])); x[1][2]=(k-(x[0][2]+x[2][2])); x[2][0]=(k-(x[2][1]+x[2][2])); x[1][0]=(k-(x[0][0]+x[2][0])); if(x[0][2]+x[1][1]+x[2][0]!=k) continue; if(x[1][0]+x[1][1]+x[1][2]!=k) continue; break; } REP(i,3) { REP(j,3) { cout<<x[i][j]; if(j!=3) cout<<" "; } cout<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Magic Square 2 |
User | algon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2440 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask1_43.txt, subtask1_44.txt, subtask1_45.txt, subtask1_46.txt, subtask1_47.txt, subtask1_48.txt, subtask1_49.txt, subtask1_50.txt, subtask1_51.txt, subtask1_52.txt, subtask1_53.txt, subtask1_54.txt, subtask1_55.txt, subtask1_56.txt, subtask1_57.txt, subtask1_58.txt, subtask1_59.txt, subtask1_60.txt, subtask1_61.txt, subtask1_62.txt, subtask1_63.txt, subtask1_64.txt, subtask1_65.txt, subtask1_66.txt, subtask1_67.txt, subtask1_68.txt, subtask1_69.txt, subtask1_70.txt, subtask1_71.txt, subtask1_72.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 256 KB |
subtask1_14.txt | AC | 1 ms | 256 KB |
subtask1_15.txt | AC | 1 ms | 256 KB |
subtask1_16.txt | AC | 1 ms | 256 KB |
subtask1_17.txt | AC | 1 ms | 256 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 1 ms | 256 KB |
subtask1_20.txt | AC | 1 ms | 256 KB |
subtask1_21.txt | AC | 1 ms | 256 KB |
subtask1_22.txt | AC | 1 ms | 256 KB |
subtask1_23.txt | AC | 1 ms | 256 KB |
subtask1_24.txt | AC | 1 ms | 256 KB |
subtask1_25.txt | AC | 1 ms | 256 KB |
subtask1_26.txt | AC | 1 ms | 256 KB |
subtask1_27.txt | AC | 1 ms | 256 KB |
subtask1_28.txt | AC | 1 ms | 256 KB |
subtask1_29.txt | AC | 1 ms | 256 KB |
subtask1_30.txt | AC | 1 ms | 256 KB |
subtask1_31.txt | AC | 1 ms | 256 KB |
subtask1_32.txt | AC | 1 ms | 256 KB |
subtask1_33.txt | AC | 1 ms | 256 KB |
subtask1_34.txt | AC | 1 ms | 256 KB |
subtask1_35.txt | AC | 1 ms | 256 KB |
subtask1_36.txt | AC | 1 ms | 256 KB |
subtask1_37.txt | AC | 1 ms | 256 KB |
subtask1_38.txt | AC | 1 ms | 256 KB |
subtask1_39.txt | AC | 1 ms | 256 KB |
subtask1_40.txt | AC | 1 ms | 256 KB |
subtask1_41.txt | AC | 1 ms | 256 KB |
subtask1_42.txt | AC | 1 ms | 256 KB |
subtask1_43.txt | AC | 1 ms | 256 KB |
subtask1_44.txt | AC | 1 ms | 256 KB |
subtask1_45.txt | AC | 1 ms | 256 KB |
subtask1_46.txt | AC | 1 ms | 256 KB |
subtask1_47.txt | AC | 1 ms | 256 KB |
subtask1_48.txt | AC | 1 ms | 256 KB |
subtask1_49.txt | AC | 1 ms | 256 KB |
subtask1_50.txt | AC | 1 ms | 256 KB |
subtask1_51.txt | AC | 1 ms | 256 KB |
subtask1_52.txt | AC | 1 ms | 256 KB |
subtask1_53.txt | AC | 1 ms | 256 KB |
subtask1_54.txt | AC | 1 ms | 256 KB |
subtask1_55.txt | AC | 1 ms | 256 KB |
subtask1_56.txt | AC | 1 ms | 256 KB |
subtask1_57.txt | AC | 1 ms | 256 KB |
subtask1_58.txt | AC | 1 ms | 256 KB |
subtask1_59.txt | AC | 1 ms | 256 KB |
subtask1_60.txt | AC | 1 ms | 256 KB |
subtask1_61.txt | AC | 1 ms | 256 KB |
subtask1_62.txt | AC | 1 ms | 256 KB |
subtask1_63.txt | AC | 1 ms | 256 KB |
subtask1_64.txt | AC | 1 ms | 256 KB |
subtask1_65.txt | AC | 1 ms | 256 KB |
subtask1_66.txt | AC | 1 ms | 256 KB |
subtask1_67.txt | AC | 1 ms | 256 KB |
subtask1_68.txt | AC | 1 ms | 256 KB |
subtask1_69.txt | AC | 1 ms | 256 KB |
subtask1_70.txt | AC | 1 ms | 256 KB |
subtask1_71.txt | AC | 1 ms | 256 KB |
subtask1_72.txt | AC | 1 ms | 256 KB |