0% found this document useful (0 votes)
197 views2 pages

Problem - 1766A - Codeforces

Uploaded by

RITESH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
197 views2 pages

Problem - 1766A - Codeforces

Uploaded by

RITESH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

4/2/24, 9:00 AM Problem - 1766A - Codeforces

|
riteshnub | Logout
You have +385! Wow!

HOME TOP CATALOG CONTESTS GYM PROBLEMSET GROUPS RATING EDU API CALENDAR HELP

PROBLEMS SUBMIT STATUS STANDINGS CUSTOM TEST

[Link]

Educational Codeforces Round


139 (Rated for Div. 2)
A. Extremely Round Finished
time limit per test: 3 seconds
Practice
memory limit per test: 512 megabytes
input: standard input
output: standard output

Let's call a positive integer extremely round if it has only one non-zero digit. For example, → Virtual participation 
5000 , 4, 1, 10 , 200 are extremely round integers; 42 , 13 , 666, 77 , 101 are not.
Virtual contest is a way to take part in past
contest, as close as possible to participation
You are given an integer n. You have to calculate the number of extremely round integers x on time. It is supported only ICPC mode for
such that 1 ≤ x ≤ n. virtual contests. If you've seen these
problems, a virtual contest is not for you -
solve these problems in the archive. If you
Input just want to solve some problem from a
contest, a virtual contest is not for you -
The first line contains one integer t (1 ≤ t ≤ 10
4
) — the number of test cases. solve this problem in the archive. Never use
someone else's code, read the tutorials or
Then, t lines follow. The i -th of them contains one integer n (1 ≤ n ≤ 999999 ) — the communicate with other person during a
virtual contest.
description of the i -th test case.
Start virtual contest
Output
For each test case, print one integer — the number of extremely round integers x such that
1 ≤ x ≤ n.
→ Clone Contest to Mashup 
Example You can clone this contest to a mashup.
input Copy
Clone Contest
5
9
42
13 → Submit?
100
111 Language: GNU G++17 7.3.0
output Copy
Choose
Choose File No file chosen
9 file:
13
10 Submit
19
19

→ Problem tags

brute force implementation *800


No tag edit access

→ Contest materials

Announcement

Tutorial

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov


The only programming contests Web 2.0 platform
Server time: Apr/02/2024 [Link]UTC+5.5 (g1).
Desktop version, switch to mobile version.
Privacy Policy

Supported by

[Link] 1/2
4/2/24, 9:00 AM Problem - 1766A - Codeforces

[Link] 2/2

You might also like