I noticed that there existed a method to solve Codeforces 827A/828C like this:[Submission](http://mirror.codeforces.com/contest/827/submission/28473482)↵
↵
It ran really fast that it became one of the quickest solutions to this problem.However,when I opened the code,I found it was just a naive implemention only with some optimizations.↵
↵
But if I gave the following data:↵
↵
N=1000,↵
↵
all the 1000 queries have the same string with length 1000 and k=1000,↵
↵
the following numbers are 1,1001,....,999001,1000000, ↵
↵
the sum of all ki is 10^6 and the sum of string length is 10^6,which satisfies the data range.↵
↵
In this condition,the code will have up to 10^9 times of calculation and I don't think it can pass within 2 seconds.↵
↵
↵
So can anyone please if it's the expected solution to the problem? Thanks!
↵
It ran really fast that it became one of the quickest solutions to this problem.However,when I opened the code,I found it was just a naive implemention only with some optimizations.↵
↵
But if I gave the following data:↵
↵
N=1000,↵
↵
all the 1000 queries have the same string with length 1000 and k=1000,↵
↵
the following numbers are 1,1001,....,999001,1000000, ↵
↵
the sum of all ki is 10^6 and the sum of string length is 10^6,which satisfies the data range.↵
↵
In this condition,the code will have up to 10^9 times of calculation and I don't think it can pass within 2 seconds.↵
↵
↵
So can anyone please if it's the expected solution to the problem? Thanks!
