Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

How to solve SPOJ problem YAPP?

Revision en1, by dush1729, 2015-12-23 14:15:14

Problem link

Why is the answer 2 ^ ( n — 1 ) ?

Tags spoj, permutations, modular arithmetic

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English dush1729 2015-12-23 14:15:14 124 Initial revision (published)