Two factors#5
допоможіть з цією задачею
Editorial :there are few observation my initial thoughts to compare some factors power with k! cs of unique factors but thats totally wrong later i realised k = ceil(d(n) / 2)where d(n) is number of divisor of n and hopefully we know the formula for calculating which is product of prime (p1+1)*(p2+1)... now we perform DFS(backtracking) over prime exponents.
Can someone make an editorial for this problem it is really hard i want to figure out the actual code without any specific n condition and cout number
The tests are weak. My code (#n1mqn3lf993bh4qhloigdsri9s) is 100/100, but for example if k = 32 my output is 9240, however the correct one is 7560. Please add more testcases. (k <= 50, so I don't think it is hard to do)
Why does it show an error every time I just try to use input() ??
Julka_jul the error message is "EOF when reading a line", EOF here stands for End-Of-File. This error means you are trying to read input, but there is nothing to read. Check "Input" tab and make sure there is enough data to read.
Moreover, keep in mind, your program should only output the answer, so the message "Enter quantity of methods:" will be part of the answer.
Julka_jul you should not print anything while reading input. just keep it as int(input())
Julka_jul Just write int(input()). You're making a mistake by writing the string inside it.
Julka_jul remove "Enter a quantity of methods:"
Julka_jul you're using int, which expects integers. Even though you will enter an integer, the text: "Enter a quantity of methods:" is not an integer(that is counted in the command line too)