CSES - Datatähti 2026 alku

Submission details
Task:	Lukujono
Sender:	alli
Submission time:	2025-10-29 21:58:17 +0200
Language:	text
Status:	READY
Result:	0
Feedback
group	verdict	score
#1	ACCEPTED	0
Test results
test	verdict	time	score
#1	ACCEPTED	0.00 s	0	details
Code

INCREASE U
REPEAT X TIMES ( # Sets Q to 1 if we should print anything after. if its zero, we dont do anything
    INCREASE V
	REPEAT O TIMES ( # Runs on second ( V > 1 ), sets Q = 1
		CLEAR O
		INCREASE Q
	)
	REPEAT U TIMES ( # Runs on first
		CLEAR Q
		INCREASE O
		CLEAR U
	)
)
PRINT X
CLEAR X
INCREASE E # Later should be replaced with 1000 or similar
INCREASE E
INCREASE E
INCREASE E
INCREASE E
INCREASE E
INCREASE E
INCREASE E
INCREASE E
INCREASE E
REPEAT E TIMES (
    INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
)
REPEAT E TIMES (
    INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
	INCREASE E
)
INCREASE L
INCREASE A
REPEAT E TIMES (
    REPEAT Q TIMES (
        # Check for divisible by 2, output to C, A AND J
		REPEAT L TIMES ( # L tarkoittaa, että tarvitsee tarkistaa parillisuus
			CLEAR J
			CLEAR A
			INCREASE A
			CLEAR B
			CLEAR C
			
			CLEAR I
			CLEAR K
			CLEAR H
			INCREASE I
			REPEAT V TIMES (
				REPEAT A TIMES (
					CLEAR A
					INCREASE B
					INCREASE J
					
					REPEAT I TIMES (
						CLEAR I
						INCREASE H
					)
					REPEAT K TIMES (
						CLEAR K
						INCREASE I
					)
					REPEAT H TIMES (
						CLEAR H
						INCREASE K
					)
				)
				REPEAT C TIMES (
					CLEAR C
					INCREASE A
				)
				REPEAT B TIMES (
					CLEAR B
					INCREASE C
				)
			)
			CLEAR L
		)
		INCREASE L
		#PRINT A
		#PRINT B
		#PRINT C
		#PRINT V
		# Ennen C:tä, sillä C voi asettaa A = 1
		REPEAT A TIMES ( # parillinen, V = V / 2
		
			CLEAR V
			CLEAR O
			CLEAR U
			INCREASE U
            REPEAT J TIMES (
			    INCREASE V
				# Määritetään, että täytyykö jatkaa tulostamista (onko V = 1)
				REPEAT U TIMES ( # Runs on first
					REPEAT O TIMES ( # Runs on second ( V > 1 ), sets Q = 1
						INCREASE Q
						CLEAR U
					)
					REPEAT U TIMES (
						CLEAR Q
						INCREASE O
					)
				)
            )
			# Emme tiedä onko parillinen vai ei, joten asetetaan seuraava kierros laskemaan parillisuus
			# INCREASE L # Ei tarvitse tehdä mitään
        )
        REPEAT C TIMES ( # pariton, V = 3*V
		
			# Tässä laskemme seuraavan arvon, tulostamme sen, jonka jälkeen lasketaaan myös toisiksi seuraavan arvon ja asetetaan se V:ksi
			CLEAR N
			REPEAT V TIMES (
				INCREASE N
				INCREASE N
				INCREASE N
			)
			INCREASE N
			# Nyt N on yhtä suuri kuin nykyinen tarvittava elementti
			PRINT N
			
			PRINT E
			PRINT V
			PRINT I
			PRINT K
			
			# Tässä tapauksessa, V on aina pariton. Jos I = 1, on silloin seuraava luku pariton. Jos K = 1, on silloin kyseessä parillinen luku.
			
			
			REPEAT J TIMES ( # Lisätään siihen J niin saadaan sitä seuraava arvo, J on tässä vaiheessa puolet arvosta (ensimmäisestä aloittaen)
                INCREASE V # Tiedetään jo, että onko V jaollinen. Nyt tarvitsee tarkistaa vain uudet lisäykset
				REPEAT A TIMES (
					CLEAR A
					INCREASE B
					INCREASE J
					
					REPEAT I TIMES (
						CLEAR I
						INCREASE H
					)
					REPEAT K TIMES (
						CLEAR K
						INCREASE I
					)
					REPEAT H TIMES (
						CLEAR H
						INCREASE K
					)
				)
				REPEAT C TIMES (
					CLEAR C
					INCREASE A
				)
				REPEAT B TIMES (
					CLEAR B
					INCREASE C
					INCREASE M
				)
            )
			
			PRINT V
			
			
			
			# Jos V ei ole jaollinen kahdella, silloin vanha numero 
			
			CLEAR L # Ei tarvite tarkistaa parillisuutta
        )
        PRINT V
    )
)
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
PRINT E
Test details

Test 1 (public)

Verdict: ACCEPTED
input
(empty)
correct output
(empty)
user output
`INCREASE U REPEAT X TIMES ( # Sets Q to 1...` view save
Feedback: 0 tests processed (invalid output)
Datatähti 2026 alku

Lukujono

Code

Test details

Test 1 (public)

Tasks

Submissions (alli)
