# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
512655 | Jean7 | Prosjecni (COCI16_prosjecni) | C++14 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fio ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define int long long
using namespace std ;
signed main ()
{
fio ;
int n , sum = 1 ;
cin >> n ;
if ( n == 2 ) cout << -1 ;
else if ( n % 2 )
{
for ( int i = 0 ; i < n ; i++ )
{
for ( int k = 0 ; k < n ; k++ )
{
cout << sum << " " ;
sum++ ;
}
cout << "\n" ;
}
return 0 ;
}
else
{
int a[n][n] , sum = 1 ;
for ( int i = 0 ; i < n-1 ; i++ )
{
for ( int k = 0 ; k < n-1 ; k++ )
{
if ( k != n-1 )
{
a[i][k] = sum ;
sum++ ;
}
}
}
for ( int i = 0 ; i < n ; i++ )
{
int pref = 0 ;
for ( int k = 0 ; k < n-1 ; k++ ) pref += a[i][k] ;
a[i][n-1] = pref ;
}
for ( int k = 0 ; k < n ; k++ )
{
int pref = 0 , av = a[n-2][k] ;
for ( int i = 0 ; i < n-1 ; i++ ) pref += av - a[i][k] ;
a[n-1][k] = pref + a[n-2][k] ;
}
for ( int i = 0 ; i < n ; i++ )
{
for ( int k = 0 ; k < n ; k++ ) cout << a[i][k] << " " ;
cout << "\n" ;
}
}
return 0 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |