oj.uz

답안 #23064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23064 2017-05-02T14:46:20 Z model_code Prosjecni (COCI16_prosjecni) C++11
120 / 120
 0 ms 2068 KB 
#include <cstdio>
#include <iostream>
#include <cstring>

using namespace std;

const int MAXN = 110;

int n, a[MAXN][MAXN];

int main(void) {
  scanf("%d",&n);

  if (n == 2) {
    printf("-1\n");
    return 0;
  }

  for (int j = 0; j < n - 1; ++j) {
    a[0][j] = j + 1;
  }
  a[0][n - 1] = n * (n - 1) / 2;

  int jump = a[0][n - 1];
  for (int i = 1; i < n; ++i) {
    for (int j = 0; j < n; ++j)
      a[i][j] = a[i - 1][j] + jump;
  }

  for (int j = 0; j < n; ++j) {
    a[n - 1][j] = n * a[n - 2][j];
    for (int i = 0; i < n - 1; ++i)
      a[n - 1][j] -= a[i][j];
  }

  
  for (int i = 0; i < n; ++i, printf("\n"))
    for (int j = 0; j < n; ++j)
      printf("%d ",a[i][j]);
  
  return 0;
}

Compilation message

prosjecni.cpp: In function 'int main()':
prosjecni.cpp:12:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
                 ^

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2068 KB Output is correct
2 Correct 0 ms 2068 KB Output is correct
3 Correct 0 ms 2068 KB Output is correct
4 Correct 0 ms 2068 KB Output is correct
5 Correct 0 ms 2068 KB Output is correct
6 Correct 0 ms 2068 KB Output is correct
7 Correct 0 ms 2068 KB Output is correct
8 Correct 0 ms 2068 KB Output is correct
9 Correct 0 ms 2068 KB Output is correct
10 Correct 0 ms 2068 KB Output is correct