Time Complexity Variation

→ Pay attention

Before contest
2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
32:01:51
Register now »

→ Top rated

#	User	Rating
1	tourist	4009
2	jiangly	3823
3	Benq	3738
4	Radewoosh	3633
5	jqdai0815	3620
6	orzdevinwang	3529
7	ecnerwala	3446
8	Um_nik	3396
9	ksun48	3390
10	gamegame	3386

Countries | Cities | Organizations

View all →

→ Top contributors

#	User	Contrib.
1	cry	164
1	maomao90	164
3	Um_nik	163
4	atcoder_official	160
5	-is-this-fft-	158
6	adamant	157
6	awoo	157
8	TheScrasse	154
8	nor	154
10	djm03178	153

View all →

→ Find user

→ Recent actions

Detailed →

Time Complexity Variation

Revision en1, by xINFERNOx, 2021-12-17 22:40:08

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);
		}
	}
}

number theory, sieve of eratosthenes, #sieve, doubt

History

Revisions

	Rev.	Lang.	By	When	Δ	Comment
	en1		xINFERNOx	2021-12-17 22:40:08	709	Initial revision (published)