제출 #47463

#제출 시각아이디문제언어결과실행 시간메모리
47463TalantAsceticism (JOI18_asceticism)C++17
4 / 100
56 ms788 KiB
#include <bits/stdc++.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define int long long

using namespace std;

const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;

int n,k;
int a[N];
int ans;

main() {
      cin >> n >> k;

      if (n <= 10) {
            for (int i = 1; i <= n; i ++)
                  a[i] = i;

            do {
                  int c = 0;
                  for (int i = 2; i <= n; i ++) {
                        if (a[i - 1] > a[i])
                              c ++;
                  }
                  if (c == k - 1)
                        ans ++;

            }while(next_permutation(a + 1,a + n + 1));
            cout << ans << endl;
      }
}

컴파일 시 표준 에러 (stderr) 메시지

asceticism.cpp:20:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...