FOOLS18D-Editorial

PROBLEM LINK:

Practice

Contest

Author: Nikhil Gogate

Tester: Anuj Goyal

First To Solve: Ritik Verma

DIFFICULTY:

Special Problem : Easy-Medium

PROBLEM:

Subtract The Input.

link to Monogram image containing complete alphanumerics set

Look at the INPUT and image carefully. Print the number of permutation of remaining set, modulo SUM OF 10^9 and 7 (i.e 10^9+7).

HINTS:

You are given an image which is a monogram (searching the image was to be done). In this image you can make all possible alphabets and numbers. You can check how each alphabet and number can be formed using monogram in this gif. The problem required you to print number of all possible permutations of the characters which were not in the given string ( hint from the title of the question, “Subtract the Input”) modulo (10^9 + 7).

SOLUTION

here