codeforces.com Open in urlscan Pro
2606:4700:20::681a:7a4  Public Scan

Form analysis
2 forms found in the DOM

POST /search

<form method="post" action="/search"><input type="hidden" name="csrf_token" value="294e57bade9bf13cffa4990db2db395e">
  <input class="search" name="query" data-isplaceholder="true" value="">
  <input type="hidden" name="_tta" value="633">
</form>

POST

<form class="handleForm" method="post" autocomplete="off"><input type="hidden" name="csrf_token" value="294e57bade9bf13cffa4990db2db395e">
  <div style="padding:1em;text-align:right;">
    <label style="padding-right:1em;">Handle: <input style="width:12em;" type="text" class="handleBox ac_input" autocomplete="off">
    </label>
  </div>
  <div style="padding: 0 1em 1em 1em;text-align:right;">
    <input style="height:1.65em;padding:0 0.75em;" type="submit" value="Find">
  </div>
  <input type="hidden" name="_tta" value="633">
</form>

Text Content

 





Enter | Register

 * Home
 * Top
 * Catalog
 * Contests
 * Gym
 * Problemset
 * Groups
 * Rating
 * Edu
 * API
 * Calendar
 * Help
 * ICPC Challenge



  Please subscribe to the official Codeforces channel in Telegram via the link
https://t.me/codeforces_official. ×

→ Pay attention

Before contest
2023-2024 ICPC, Asia Jakarta Regional Contest (Online Mirror, Unrated, ICPC
Rules, Teams Preferred)
2 days
Register now »
Before contest
Educational Codeforces Round 159 (Rated for Div. 2)
3 days
Register now »
→ Streams


Learning Kotlin by solving old Advent of Code problems

By kostka
Before stream 05:29:19

View all →

→ Top rated


# User Rating 1 Radewoosh 3759 2 orzdevinwang 3697 3 jiangly 3662 4 Benq 3644 5
-0.5 3545 6 ecnerwala 3505 7 tourist 3486 8 inaFSTream 3478 9 maroonrk 3454 10
Rebelz 3415

Countries | Cities | Organizations View all →

→ Top contributors


# User Contrib. 1 adamant 172 2 awoo 167 3 SecondThread 163 4 BledDest 162 4
Um_nik 162 6 maroonrk 161 7 nor 160 8 -is-this-fft- 150 9 Geothermal 146 10
TheScrasse 143

View all →

→ Find user

Handle:

→ Recent actions

 * Theo830 → Codeforces Round #912 (Div. 2)   
 * mondayguy → Problem from Yandex Weekly Offer   
 * 18o3 → Indian ICPC 2023-24 Regionals — Qualifier Rounds   
 * molney → Разбор Codeforces Round 909 (Div. 3)   
 * intrusiv → Problem of the Year 2023   
 * zwezdinv → Codeforces Round #909 (Div. 3)   
 * Datapas → I'm blue.   
 * Radewoosh → I've completed Project Euler   
 * MKasirloo → Rating Formula   
 * SleepyShashwat → Codeforces Round #682 (Div. 2) Editorial   
 * _MUSAFIR_ → CP Books Collection( U Can Ignore it )   
 * NemanjaSo2005 → Codeforces Round 911 (Div. 2) Editorial   
 * ShapeBlaze → Is it a NP-hard problem?   
 * Susie.Rain → wo shi acm de shen(恶搞)   
 * maomao90 → CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!)   
 * mahmoudbadawy → IOI 2024 Call for Tasks   
 * aliasadiiii → Internship Positions at ISTA   
 * vito1036 → Croatian Open Competition in Informatics (COCI) 2023/2024 — Round
   #2   
 * nor → A practical (maybe theoretically) faster variant of the Euclidean GCD
   algorithm   
 * mahmoud13 → TLE on Test 6, I don't know why is this happening   
 * SashaT9 → Codeforces Round 891 (Div. 3) Editorial   
 * atcoder_official → HACK TO THE FUTURE 2024 (AtCoder Heuristic Contest 027)
   Announcement   
 * prabowo → Online mirror of The 2023 ICPC Asia Jakarta Regional Contest   
 * xX_I_Have_Esbat_Xx → Reaching my birthyear!   
 * n0sk1ll → Editorial for Codeforces Round #910 (Div. 2)   

Detailed →

Codeforces Round #912 (Div. 2)

By Theo830, 5 days ago,


Γεια σου (Hello), Codeforces once again!

Adam_GS and I are glad to invite you to participate in Codeforces Round #912
(Div. 2) which will take place on Thursday, November 30, 2023 at 17:35UTC+1.
Note the unusual start time of the round. As usual, this round will be rated for
participants with rating lower than 2100.

Problems were created and prepared by Adam_GS and me. We tried to make them
interesting, with short and clear statements. We hope that you will enjoy them!

I would like to thank:

 * ScarletS for amazing coordination of this round.

 * Adam_GS for joining as an author after testing the contest.

 * fishy15, Andreasyan, phattd, Murinh0, irkstepanov, wuhudsm, Ari, satyam343,
   Qualified, nyaruhodo, Trumling, Earlyamazon, freedommo33, jeroenodb, Nafis,
   czauderna, m.szeliga, Piokemon, Marky, jerzyk, jamjanek, t.kwiatkowski,
   AverageDiv1Enjoyer, revanth2002, htetgm, purp4ever, nor for testing the
   problems and providing useful feedback.

 * MikeMirzayanov for Codeforces and Polygon platforms.

You will be given 66 problems (and one subtask) and 22 hours and 1515 minutes to
solve them.

The score distribution will also be announced shortly.

Good luck and have fun!

UPD1:

Score Distribution:
500−1000−1500−(1500−2500)−2250−3500500−1000−1500−(1500−2500)−2250−3500

Full text and comments »

Announcement of Codeforces Round 912 (Div. 2)
 * 
 * +297
 * 


 * Theo830
 * 5 days ago
 * 145


Codeforces Round 911 (Div. 2)

By NemanjaSo2005, history, 5 days ago,


Hello, Codeforces!

Riblji_Keksic and I are glad to invite you to Codeforces Round 911 (Div. 2),
which will start on Sunday, November 26, 2023 at 15:35UTC+1. You will be given 6
problems and 2 hours to solve them.

The round will be rated for participants of Division 2 with a rating lower than
2100. Division 1 participants can participate unofficially.

All problems are invented and prepared by Riblji_Keksic and me.

Special thanks go to n0sk1ll and TimDee for their great work during the testing
process of the round.

And of course, I would love to thank the people who made this round possible:

 * pashka for his great coordination of the round!

 * IgorI for helping host the round!

 * Alexdat2000 for helping translate the round!

 * prvocislo, wxhtzdy, valeriu, satyam343, n0sk1ll, TimDee, wuhudsm,
   AlphaMale06, Blagoj, priyanshu.p, Acanikolic73, gubica, ognjentesic,
   VeljkoGalovic and repmann for testing the round and providing valuable
   feedback!

 * KAN for his contribution towards the round!

 * MikeMirzayanov and the team for the codeforces and polygon platforms!

 * You for participating!

We hope that you will participate and enjoy the round!

Update 1: The score distribution is 500 — 1000 — 1250 — 2000 — 2250 — 3000

Update 2: Congratulations to the winners:

Div. 2:

 1.  TransFeftAutoV

 2.  vflower

 3.  eloge

 4.  Illumina

 5.  Im_dik

 6.  Gold_Record

 7.  Haaland

 8.  mban259

 9.  hazzler

 10. 111445

All participants:

 1.  fallleaves07

 2.  turmax

 3.  A_G

 4.  ppavic

 5.  minato

 6.  Yuu

 7.  potato167

 8.  Rubikun

 9.  Heltion

 10. emthrm

First solvers:

A. people_plus_plus in 0:01

B. A_G in 0:04

C. WLZ in 0:04

D. A_G in 0:12

E. Superposition in 0:17

F. turmax in 0:26

Update 3: Editorial

Full text and comments »

Announcement of Codeforces Round 911 (Div. 2)
 * 
 * +333
 * 


 * NemanjaSo2005
 * 5 days ago
 * 240


2024 New Year ICPC Challenge powered by Huawei

By ICPCNews, 37 hours ago,


HELLO, CODEFORCES!

We are happy to invite you to an exciting onsite event: 2024 New Year ICPC
Challenge powered by Huawei，which will start on January 12, 2024, 15:00 (UTC+8).

In this Challenge, you will have a unique chance:

 * to compete with top programmers globally
 * to solve 1 exciting problem prepared by Huawei
 * to win amazing prizes from Huawei!

It is an individual competition.

2024 NEW YEAR ICPC CHALLENGE POWERED BY HUAWEI:

Start: January 12, 2024, 15:00 (UTC+8)

Finish: January 26, 2024, 15:00 (UTC+8)

We hope you'll enjoy this complex yet very exciting Challenge!

PROBLEM

We are glad to propose to you an exciting challenge “Accuracy-preserving
summation algorithm”, which is prepared by Huawei Computing Product Line..

With this challenge, we focus on summation algorithms of floating point numbers
in different precisions with the goal to use the lowest possible precision
without losing too much of the accuracy of the end result. This problem arises
in high-performance computing as lower precision can be computed faster. At the
same time it also loses accuracy faster and can even lose it completely. Finding
the right balance between fast low precision calculations and higher precision
intermediate summations is a challenging task on modern architectures, and you
would have an opportunity to try addressing this challenge.

REGISTER

PRIZES FROM HUAWEI

Rank Prize Grand Prize (Rank 1) € 12 000 EUR + the travel trip to the 49th
Annual ICPC World Finals in a guest role First Prize (Rank 2-10) € 8,000 EUR
Second Prize (Rank 11-30) € 3,000 EUR Third Prize (Rank 31-60): € 800 EUR TOP
200 Participants Souvenir T-shirt * If for any reason, Huawei cannot deliver the
allocated prize to your region, the prize may be replaced by another prize (if
no legal restrictions), at the discretion of the Huawei..

CHALLENGE RULES AND CONDITIONS

By participating in this Challenge, you agree to the Challenge Rules and
Conditions of Participation

Good luck, we hope this will be fun!

Full text and comments »

challenge, icpc challenge, huawei
 * 
 * +38
 * 


 * ICPCNews
 * 37 hours ago
 * 0


CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!)

By maomao90, history, 9 days ago,


Hello Codeforces,

We are very glad to invite you to participate in CodeTON Round 7 (Div. 1 + Div.
2, Rated, Prizes!), which will start on Saturday, November 25, 2023 at
15:50UTC+1. You will be given 8 problems and 2.5 hours to solve them. The round
will be rated for everyone.

All the problems are written and prepared by lanhf, Mike4235, thenymphsofdelphi,
xuanquang1999 and me.

We would like to give our sincere thanks to:

 * errorgorn for his wonderful coordination!
 * Alexdat2000 for translating problem statements.
 * Um_nik and conqueror_of_tourist for Legendary Grandmaster testing.
 * jeroenodb, Kuroni, dario2994 and dreamoon_love_AA for International
   Grandmaster testing.
 * generic_placeholder_name, MofK, minhcool, dvdg6566 and magnus.hegdahl for
   Grandmaster testing.
 * dantoh for International Master testing.
 * apoorv_me, 18o3, beepbeepsheep, jamessngg, zengminghao, oolimry, iLoveIOI,
   pavement and jamielim for Master testing.
 * Kofta, Dewi, Nahian9696, bensonlzl and Myrcella for Candidate Master testing.
 * ABalobanov, AVdovin, Blagoj, teruel, xink and Antonn_114 for Expert testing.
 * BeezMinh, aureg109, Yoo_Jeongyeon, Sunnyyyy and SYY for Specialist testing.
 * NVGU for Pupil testing.
 * vszda, tibinyte and hminh for Newbie testing.
 * MikeMirzayanov for the great codeforces and polygon platform.
 * You for participating in the round.

The score distribution is
500−1000−1500−2000−2250−2750−3250−(4000+1000)500−1000−1500−2000−2250−2750−3250−(4000+1000).

Hope everyone can enjoy the round!

Congratulations to the winners!

 1.  Radewoosh
 2.  ksun48
 3.  ecnerwala
 4.  maroonrk
 5.  amiya
 6.  hos.lyric
 7.  zh0ukangyang
 8.  244mhq
 9.  Vercingetorix
 10. BigYellowDuck

Congratulations to the first solves as well!

 * A: dXqwq
 * B: tourist
 * C: tourist
 * D: tourist
 * E: tourist
 * F: ksun48
 * G: Radewoosh
 * H1: ksun48
 * H2: ecnerwala

UPD1: The contest is delayed by 15 minutes due to prior issues with the
registration system in order to make sure everyone is correctly registered.
Please double-check that you are registered.

UPD2: Editorial

And here is the information from our title sponsor:



Hello, Codeforces!

We, the TON Foundation team, are pleased to support CodeTON Round 7.

The Open Network (TON) is a fully decentralized layer-1 blockchain designed to
onboard billions of users to Web3.

Since July 2022, we have been supporting Codeforces as a title sponsor. This
round is another way for us to contribute to the development of the community.

The winners of CodeTON Round 7 will receive valuable prizes.

The first 1,023 participants will receive prizes in TON cryptocurrency:

 * 1st place: 1,024 TON
 * 2–3 places: 512 TON each
 * 4–7 places: 256 TON each
 * 8–15 places: 128 TON each
 * …
 * 512–1,023 places: 2 TON each

We wish you good luck at CodeTON Round 7 and hope you enjoy the contest!

Full text and comments »

Announcement of CodeTON Round 7 (Div. 1 + Div. 2, Rated, Prizes!)
 * 
 * +763
 * 

 * maomao90
 * 9 days ago
 * 173


Northwestern Europe Regional Contest 2023: live broadcast schedule

By ICPCNews, 6 days ago,


Hello, Codeforces!



We are glad to invite you to follow NWERC 2023! The 2023 Northwestern Europe
Regional Contest will be held from the 24th till 26th of November 2023. The
contest will be held on the campus of the Delft University of Technology,
Netherlands.

NWERC is an official regional contest of ICPC which draws students' teams from
colleges and universities throughout all over the Northwestern part of Europe.
The team that solves the most problems at the end of the contest qualifies for
the ICPC World Finals 2024, which is planned on September 2024, Kazakhstan.

There will also be an online spectator contest for you to solve the problems
alongside the contestants. The contest will start at 10:30 CET on Sunday,
November 26th. You can register at https://spectator.nwerc.eu/.

Please join us on the live broadcast on ICPCLive channel. All available events:

Opening Team interviews and test session Contest Award ceremony

List of useful links:

 * Live Scoreboard
 * NWERC Homepage
 * Schedule, November 24-26
 * List of competing teams
 * Spectator Contest

Main contest's broadcast starts on Sunday, November 26th at 10:00 (CET):

We wish good luck to all competing teams to have a great time spending!

Full text and comments »

icpc, nwerc, europe
 * 
 * +86
 * 


 * ICPCNews
 * 6 days ago
 * 1


Educational Codeforces Round 158 [Rated for Div. 2]

By awoo, history, 7 days ago, translation,


Hello Codeforces!

On Friday, November 24, 2023 at 15:35UTC+1 Educational Codeforces Round 158
(Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University
initiative! You can read the details about the cooperation between Harbour.Space
University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It
will be held on extended ICPC rules. The penalty for each incorrect submission
until the submission with a full solution is 10 minutes. After the end of the
contest, you will have 12 hours to hack any solution you want. You will have
access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Ivan
BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also,
huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and
Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Full text and comments »

Announcement of Educational Codeforces Round 158 (Rated for Div. 2)
 * 
 * +179
 * 

 * awoo
 * 7 days ago
 * 184


ICPC 2023 Online Challenge powered by Huawei

By ICPCNews, 2 months ago,


HELLO, CODEFORCES!

From the ICPC 2023 World Finals, we are happy to bring you an exciting online
event: The ICPC 2023 Online Challenge powered by Huawei，which will start on
November 20, 2023 15:00 UTC (UTC+8)

In this Challenge, you will have a unique chance:

 * to compete with top programmers globally
 * to solve 1 exciting problem prepared by Huawei
 * to win amazing prizes from Huawei!

It is an individual competition.

THE ICPC 2023 ONLINE CHALLENGE POWERED BY HUAWEI:

Start: November 20, 2023 15:00 (UTC+8)

Finish: December 4, 2023 15:00 (UTC+8)

We hope you'll enjoy this complex yet very exciting Challenge!

PROBLEM



We are glad to propose to you an exciting challenge “Deterministic Scheduling
for Extended Reality over 5G and Beyond”, which is prepared by Huawei Wireless
Product Line.

In this contest, we focus on a XR-service scheduling problem to maximize the
total number of successfully transformed XR-data frames under specific
transmission requirements. Extended reality (XR) is an umbrella term for
different types of realities such as virtual reality (VR), augmented reality
(AR), and mixed reality (MR), which can provide people with immersive
experience. To achieve better user-experience, scheduling algorithm should be
proposed to efficiently utilize the limited radio resources, e.g., time
resource, frequency resource, and power resource. Due to several practical
constraints, the scheduling task is a typical NP-hard problem.

REGISTER

PRIZES FROM HUAWEI

Rank Prize Grand Prize (Rank 1) € 12 000 EUR + the travel trip to the 48th
Annual ICPC World Finals in a guest role First Prize (Rank 2-10) € 6,000 EUR
Second Prize (Rank 11-30) € 3,000 EUR Third Prize (Rank 31-60): € 800 EUR TOP
200 Participants Souvenir T-shirt * If for any reason, Huawei cannot deliver the
allocated prize to your region, the prize may be replaced by another prize (if
no legal restrictions), at the discretion of the Huawei..

CHALLENGE RULES AND CONDITIONS

By participating in this Challenge, you agree to the Challenge Rules and
Conditions of Participation

Good luck, we hope this will be fun!

Full text and comments »

 * 
 * +377
 * 

 * ICPCNews
 * 2 months ago
 * 59


Codeforces Round #910 (Div. 2)

By n0sk1ll, history, 2 weeks ago,


Hello, Codeforces!

ELDRVD and I are glad to invite you to Codeforces Round 910 (Div. 2), which will
start on Sunday, November 19, 2023 at 15:35UTC+1. You will be given 6 problems
and 2 hours to solve them.

The round will be rated for participants of Division 2 with a rating lower than
2100. Division 1 participants can participate unofficially.

All problems are invented and prepared by ELDRVD and me. Special thanks go to
Sofija06 and NemanjaSo2005, our two most dedicated testers. We would also like
to honor:

 * prvocislo, wuhudsm, Marckess, MateoCV, Wibo, curly_braces, LucaLucaM,
   null0124, OAleksa, AlphaMale06, Firefrog418, and sahaun for testing this
   round and providing valuable feedback!
 * IgorI for coordinating the round well!
 * dario2994 for reviewing some of the problems as the coordinator of a previous
   round proposal.
 * KAN for his contribution towards hosting the round.
 * MikeMirzayanov for creating the Codeforces and Polygon platforms!

We are looking forward to your participation!

UPD1: The score distribution is
500—1250—1750—1750—2000—2500500—1250—1750—1750—2000—2500.

UPD2: Editorial

UPD3: Congratulations to the winners!

 1.  hitonanode
 2.  Rubikun
 3.  femboy-wannabe
 4.  potato167
 5.  Golovanov399
 6.  A_G
 7.  AmazingTalker_Frank
 8.  Geothermal
 9.  StarSilk
 10. Farhod_Farmon

UPD4: Also, congratulations to the Div. 2 winners!

 1.  femboy-wannabe
 2.  Top2Greece
 3.  hoiii
 4.  KaiAngel
 5.  Nguyen_Mai_Huong
 6.  lunchbox
 7.  bobbilyking
 8.  q_x_j
 9.  supercambrian
 10. MeGustaElArroz23

Full text and comments »

Announcement of Codeforces Round 910 (Div. 2)
 * 
 * +180
 * 

 * n0sk1ll
 * 2 weeks ago
 * 169


Codeforces Round #909 (Div. 3)

By zwezdinv, 2 weeks ago,


Hello, Codeforces! ☀️☀️☀️

We are glad to invite you to our second Div. 3 round, which will take place on
Friday, November 17, 2023 at 15:35UTC+1. The round will be rated for all
participants with rating less than 1600.

You will be given 7 tasks and 2 hours 15 minutes to solve it.

The tasks were prepared by zwezdinv, meowcneil, EJIC_B_KEDAX, Sokol080808 and
molney.

Remember, that only trusted Div. 3 participants will be included in official
standings. To qualify as trusted participant you need:

 1. Participate in at least five rounds (and solve at least one problem in each
    of them)
 2. Do not to have a point 1900 or greater in the rating

We would like to thank:

 * MikeMirzayanov for Polygon and Codeforces
 * Coordinators Vladosiya and Gornak40 for excellent coordination
 * ace5, pavlekn, 998batrr, EternalAlexander, Rubikun for red testing
 * Yar_sem, Be_dos, alex.kudryashov, makrav, qqq1n, 74TrAkToR, Turkhuuu,
   _LeMur_, beemax, sedev57, misorin for yellow testing
 * Illumina, Alex239, SashaT9, Pa_sha, goncharovmike for purple testing
 * _shakespeare_, OR_LOVe, TimVen74, ivan.alexeev, krigare, yaaarseny,
   dragonknight, Apachee, EzikBro, null0124, KoT_OsKaR, micho, keroru,
   dasha..zhilina for blue testing
 * wtf._., El_Gemmy for cyan testing
 * Flash70 for gray testing

Good luck everyone!

UPD: Editorial

Full text and comments »

Announcement of Codeforces Round 909 (Div. 3)
 * 
 * +281
 * 

 * zwezdinv
 * 2 weeks ago
 * 236


Codeforces Round 908 (Div. 1, Div. 2)

By sevlll777, history, 4 weeks ago,


Big greetings, Codeforces!

I am happy to invite you to Codeforces Round 908 (Div. 1), Codeforces Round 908
(Div. 2), which will be held on Tuesday, November 7, 2023 at 15:35UTC+1.

This round will be rated for everyone. In both divisions, you will be given 5
problems and 120 minutes to solve them. All problems were cooked by me
(sevlll777).

The traditional thanks-list to everyone who took part in the creation of the
round. Thanks,

 * 74TrAkToR for incredible coordination!

 * gzchenben, Gary2005, SomethingNew, Heltion, FairyWinx, EternalAlexander,
   RUSH_D_CAT, rsj, Kieray, CtrlAlt, Vladithur, nnv-nick, AndZhi, p_b_p_b,
   Adam_GS, tem_shett, 127.0.0.1, a.nasretdinov, Suiseiseki, Aokana, noimi,
   Psychotic_D for testing the round.

 * CtrlAlt for help with polishing the statements.

 * MikeMirzayanov for Polygon and Codeforces platforms.

I hope you will like the problemset and ideas hidden in the problems! It's
guaranteed that statements are understandable, short, and, of course, ✨ stylish
✨.

Have fun!

Score Distribution:

Div. 1: 500500 — 10001000 — 12501250 — 22502250 — 27502750

Div. 2: 500500 — 750750 — 15001500 — 20002000 — 22502250

UPD: Editorial

UPD2: Congrats to the chAAAmpions!

Div.1:

 1.  maroonrk

 2.  Ormlis

 3.  Um_nik

 4.  tourist

 5.  5sb

 6.  Swistakk

 7.  jiangly

 8.  Radewoosh

 9.  ethening

 10. hank55663

Div.2:

 1.  Redpo

 2.  shenzihan

 3.  latr

 4.  zookeeper780

 5.  omsincoconut

 6.  vishav_mehra

 7.  menezesd2

 8.  darling51707

 9.  kanao_enjoyer

 10. killmeray

Full text and comments »

Announcement of Codeforces Round 908 (Div. 1)
Announcement of Codeforces Round 908 (Div. 2)
 * 
 * +175
 * 

 * sevlll777
 * 4 weeks ago
 * 181


   ←
 * 1
 * 2
 * 3
 * ...
 * 223
 * 224
 * →


Codeforces (c) Copyright 2010-2023 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/30/2023 20:30:37UTC+1 (k2).
Desktop version, switch to mobile version.
Privacy Policy
Supported by

 
 
 
 
User lists

 
 

Name No items