Submission #3421829


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
long long int Inv(long long int a, long long int m) {
  int c[50];
  long long int e[50];  
  c[0] = (m-2) % 2, e[0] = (m-2) / 2; 
  for (int i = 0; i < 50; ++i){
     c[i+1] = e[i] % 2;
     e[i+1] = e[i] / 2;  
  }
  long long int d[50]; 
  d[0] = a; 
  for (int j = 0; j < 50; ++j){
     d[j+1] = (d[j] * d[j]) % m; 
  }
  long long int Q; 
  Q = 1; 
  for(int k = 0; k < 50; ++k){
  if (c[k] == 0) Q = Q; 
  if (c[k] == 1) Q = (Q * d[k]) % m; 
  }
 return Q;
}
int main() {
long long int N, K;
long long int P = 1000000007;
cin >> N >> K; 
long long int Fac[314159] = {}; 
Fac[0] = 1; 
for(int i = 1; i < 200010; i++){
Fac[i] = (Fac[i-1] * i) % P; 
}
cout << (((Fac[N + K - 1] * Inv(Fac[N - 1], P)) % P) * Inv(Fac[K], P)) % P << endl; 
}

Submission Info

Submission Time
Task D - 多重ループ
User zundamochi_1117
Language C++14 (GCC 5.4.1)
Score 100
Code Size 820 Byte
Status AC
Exec Time 3 ms
Memory 2688 KB

Compile Error

./Main.cpp: In function ‘long long int Inv(long long int, long long int)’:
./Main.cpp:14:32: warning: iteration 49u invokes undefined behavior [-Waggressive-loop-optimizations]
      d[j+1] = (d[j] * d[j]) % m; 
                                ^
./Main.cpp:13:21: note: containing loop
   for (int j = 0; j < 50; ++j){
                     ^
./Main.cpp:8:23: warning: iteration 49u invokes undefined behavior [-Waggressive-loop-optimizations]
      c[i+1] = e[i] % 2;
                       ^
./Main.cpp:7:21: note: containing loop
   for (int i = 0; i < 50; ++i){
                     ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 99 / 99 1 / 1
Status
AC × 5
AC × 23
AC × 33
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt
Subtask1 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.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
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.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, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 3 ms 2688 KB
subtask0_sample_02.txt AC 3 ms 2688 KB
subtask0_sample_03.txt AC 3 ms 2688 KB
subtask0_sample_04.txt AC 3 ms 2688 KB
subtask0_sample_05.txt AC 3 ms 2688 KB
subtask1_01.txt AC 3 ms 2688 KB
subtask1_02.txt AC 3 ms 2688 KB
subtask1_03.txt AC 3 ms 2688 KB
subtask1_04.txt AC 3 ms 2688 KB
subtask1_05.txt AC 3 ms 2688 KB
subtask1_06.txt AC 3 ms 2688 KB
subtask1_07.txt AC 3 ms 2688 KB
subtask1_08.txt AC 3 ms 2688 KB
subtask1_09.txt AC 3 ms 2688 KB
subtask1_10.txt AC 3 ms 2688 KB
subtask1_11.txt AC 3 ms 2688 KB
subtask1_12.txt AC 3 ms 2688 KB
subtask1_13.txt AC 3 ms 2688 KB
subtask1_14.txt AC 3 ms 2688 KB
subtask1_15.txt AC 3 ms 2688 KB
subtask1_16.txt AC 3 ms 2688 KB
subtask1_17.txt AC 3 ms 2688 KB
subtask1_18.txt AC 3 ms 2688 KB
subtask1_19.txt AC 3 ms 2688 KB
subtask2_02.txt AC 3 ms 2688 KB
subtask2_03.txt AC 3 ms 2688 KB
subtask2_04.txt AC 3 ms 2688 KB
subtask2_05.txt AC 3 ms 2688 KB
subtask2_06.txt AC 3 ms 2688 KB
subtask2_07.txt AC 3 ms 2688 KB
subtask2_08.txt AC 3 ms 2688 KB
subtask2_09.txt AC 3 ms 2688 KB
subtask2_10.txt AC 3 ms 2688 KB