Blog entries - Codeforces

→ Pay attention

Contest is running
2023 Post World Finals Online ICPC Challenge powered by Huawei
12 days
Register now »

→ Top rated

#	User	Rating
1	tourist	3690
2	jiangly	3647
3	Benq	3581
4	orzdevinwang	3570
5	Geothermal	3569
5	cnnfls_csy	3569
7	Radewoosh	3509
8	ecnerwala	3486
9	jqdai0815	3474
10	gyh20	3447

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	maomao90	174
2	awoo	164
3	adamant	162
4	TheScrasse	160
5	nor	158
6	maroonrk	156
7	-is-this-fft-	152
8	orz	146
9	pajenegod	145
9	SecondThread	145

View all →

→ Find user

→ Recent actions

Detailed →

xINFERNOx's blog

Time Complexity Variation

By xINFERNOx, history, 2 years ago, In English

Why the second code executes within 500ms whereas the first one gives TLE(2000ms) ?

1497E1 - Square-Free Division (easy version)

const int N = 1e7 + 5;
vector<int> maping(N);
int i,j;

Code 1

for (i = 1; i < N; i++) {
	maping[i] = i;
}
for (i = 2; i < N; i++) {
  for (j = 2; j * j <= i; j++) {
	 while (maping[i] % (j * j) == 0) maping[i] = maping[i] / (j * j);
	}
}

Code 2

for (i = 1 ; i < N ; i++) maping[i]  = i;
for (i = 2; i < N; i++) {
	for (j = i * i; j <= N; j += i * i) {
		while (maping[j] % (i * i) == 0) {
			maping[j] = maping[j] / (i * i);
		}
	}
}

Full text and comments »

number theory, sieve of eratosthenes, #sieve, doubt

-7

xINFERNOx
2 years ago
3