Masala #YNBIGV8PCU
Azimjonga yordam
Azimjon hozir 0 nuqtasida turibdi. U n
nuqtasiga borishi kerak.
U 1 yurishda n ta nuqtagacha sakray oladi. Yani x + 1, x + 2, x + 3, …, x + n nuqtalarga bora oladi (x bu uning turgan joyi). Azimjon n nuqtaga necha xil usulda bora olishini 1000000007 ga bo'lgandagi qoldig'ini toping.
1 ta son n
\((1 \le n \le 10^{18})\)
1 ta son k
- Azimjon n nuqtaga necha xil usulda bora olishini 1000000007 ga bo'lgandagi qoldig'i.
# | input.txt | output.txt |
---|---|---|
1 |
1 |
1 |
2 |
999999999999999965 |
1 |
3 |
1000000007 |
1 |