Submission #19290

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
19290	2016-02-24T06:39:36 Z	kaTkaHr	괄호 (kriii4_R)	C++14	8 / 100	21 ms	1084 KB

R

#include <stdio.h>
#include<vector>
#include <algorithm>
#include <map>

using namespace std;

typedef long long ll;

const int MX = 1005, MM = 1000000007;

template<typename T>
T pw(T A, ll B){
  T R = 1;
  while(B){
    if( B&1 ) R = R * A;
    A = A * A; B /= 2;
  }
  return R;
}

ll rv(ll A){ 
  ll R = 1, B = MM-2;
  while(B){
    if( B&1 ) R = R * A % MM;
    A = A * A % MM; B /= 2;
  }
  return R;
}
//*
struct frac{
  ll A, B;
		frac(ll A):A(A), B(1){}
  frac(ll a, ll b){
    A = (a%MM+MM) % MM;
    B = (b%MM+MM) % MM;
  }
  frac(){A = 0, B = 1;}
  frac operator+ (const frac &l)const{
    return frac((A * l.B + B * l.A) % MM, B * l.B % MM);
  }
  frac operator*(const frac &l)const{
    return frac(A*l.A % MM, B*l.B % MM);
  }
  frac operator/(const frac &l)const{
    return frac(A*l.B % MM, B*l.A % MM);
  }
  frac operator- (const frac &l)const{
    return frac((A*l.B - B*l.A%MM + MM) % MM, B*l.B % MM);
  }
  ll v(){ return A * rv(B) % MM; }
};// */
/*
struct frac{
  ll A;
		frac(ll A):A((A%MM+MM)%MM){}
  frac(ll a, ll b){
			a = (a%MM+MM)%MM;
			b = (b%MM+MM)%MM;
			A = rv(b) * a % MM;
  }
  frac(){A = 0;}
  frac operator+ (const frac &l)const{
			return l.A + A >= MM? l.A + A - MM: l.A + A;
  }
  frac operator*(const frac &l)const{
			return l.A * A % MM;
  }
  frac operator/(const frac &l)const{
			return A * rv(l.A) % MM;
  }
  frac operator- (const frac &l)const{
			return A >= l.A? A-l.A: A-l.A + MM;
  }
  ll v(){ return A; }
};// */

int main()
{
	int N;
	scanf("%d", &N);
	frac ans = 1;
	for(int i = 1; i <= N/2; i++){
		ans = ans * (N-i+1) / i;
	}
	printf("%lld\n", ans.v());
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	1084 KB	Output is correct
2	Correct	2 ms	1084 KB	Output is correct
3	Correct	15 ms	1084 KB	Output is correct
4	Correct	17 ms	1084 KB	Output is correct
5	Correct	17 ms	1084 KB	Output is correct
6	Correct	10 ms	1084 KB	Output is correct
7	Correct	11 ms	1084 KB	Output is correct
8	Correct	7 ms	1084 KB	Output is correct
9	Correct	3 ms	1084 KB	Output is correct
10	Correct	0 ms	1084 KB	Output is correct
11	Correct	0 ms	1084 KB	Output is correct
12	Correct	16 ms	1084 KB	Output is correct
13	Correct	15 ms	1084 KB	Output is correct
14	Correct	7 ms	1084 KB	Output is correct
15	Correct	7 ms	1084 KB	Output is correct
16	Correct	6 ms	1084 KB	Output is correct
17	Correct	19 ms	1084 KB	Output is correct
18	Correct	19 ms	1084 KB	Output is correct
19	Correct	21 ms	1084 KB	Output is correct
20	Correct	20 ms	1084 KB	Output is correct

Subtask #2

0.0 / 92.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	6 ms	1084 KB	Output isn't correct
2	Halted	0 ms	0 KB	-