838D - Airplane Arrangements - CodeForces Solution


math number theory *2700

Please click on ads to support us..

Python Code:

n,m=[int(i) for i in input().split()]
print(pow(2*n+2,m-1,1000000007)*2*(n+1-m)%1000000007)

C++ Code:

#include <bits/stdc++.h>

using namespace std;

inline int read()
{
	int x=0;bool f=0;char ch=getchar();
	while(ch<'0' || ch>'9') {if(ch=='-') f=1;ch=getchar();}
	while(ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}

#define x first
#define y second

typedef pair<int,int> PII;
typedef long long LL;
const int N=1e6+10,MOD=1e9+7;

int n,m;

int qmi(int x,int k)
{
	int res=1;
	while(k){
		if(k&1) res=res*1ll*x%MOD;
		x=x*1ll*x%MOD,k>>=1;
	}
	return res;
}

int main()
{
	n=read(),m=read();
	printf("%d\n",qmi(2,m)*1ll*(n-m+1)%MOD*qmi(n+1,m-1)%MOD);
	
	return 0;
}

     	   		      		     					 	


Comments

Submit
0 Comments
More Questions

497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change