moistx https://blog.hatena.ne.jp/moistx/ Logfiles https://logfiles.hatenablog.com/ UVa 解法 先に計算すべき配列の要素が、どれも i より小さくなるので、順に計算できる。 #include <cstdio> #include <cmath> using namespace std; #define MAX (1000001) #define MOD (1000000) int x[MAX]; int main() { x[0] = 1; for(int i=1; i<MAX; i++) { x[i] = ( (x[int(i-sqrt(i))] + x[(int)log(i)]) % MOD + x[(int)(i*sin(i)*sin(i))] ) % MOD; } int i… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140902%2F1409667023" title="UVa11703 sqrt log sin - Logfiles" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2014-09-02 23:10:23 rich https://logfiles.hatenablog.com/entry/20140902/1409667023 1.0 100%