Learn DSADSAContests
coding75 logo
LeetCode POTDPOTDSheets
coding75 Pro
coding75 logo
Dashboard
Learn DSA
Course RoadmapFlow
DSA Topic TreeNew πŸš€
Contest SolutionsPractice
Practice Sheets
MasterclassesLive πŸ‘¨πŸ»β€πŸ’»

coding75 ProPRO

Live Classes & Placement Guidance

coding75 logo

The premier developer platform for mastering Data Structures & Algorithms, exploring contest editorials, building ATS-ready resumes, and accelerating your tech career.

Connect & Community

DSA & Contests

  • Learn DSA
  • Contest Solutions
  • LeetCode POTDDaily
  • Practice Sheets
  • MasterclassesSoon

Interview Prep

  • Portfolio Projects
  • CS Fundamentals
  • System DesignSoon
  • Interview ExperiencesSoon
  • Mock InterviewsSoon

Career & Pro

  • Jobs & Internships
  • Resume BuilderATS
  • coding75 Pro
  • Submit Feedback
Β© 2026coding75β€’crackDSAβ„’β€’Maa Lalita Edtech Private Limited. All Rights Reserved.
Privacy PolicyTerms & ConditionsContact Support
Registered Office: Kanpur 208021β€’Regional Office: Indiranagar, Bangalore, 560008
Maa Lalita Edtech Private Limited
Contests/Codeforces/Codeforces Round 943/C. Assembly via Remainders
PrevNext
CodeforcesCodeforces
Pupil
Codeforces Round 943

C. Assembly via Remainders

ArrayMath
Loading...
Solve on Codeforces

Problem Statement

Official algorithmic problem description and constraints.

Open on Codeforces

You are given an array π‘₯2,π‘₯3,…,π‘₯𝑛. Your task is to find any array 

π‘Ž1,…,π‘Žπ‘›, where:

  • 1β‰€π‘Žπ‘–β‰€10^9 for all 1≀𝑖≀𝑛
  • π‘₯𝑖=π‘Žπ‘–modπ‘Žπ‘–βˆ’1 for all 2≀𝑖≀𝑛

Here π‘mod𝑑 denotes the remainder of the division of the integer π‘ by the integer π‘‘. For example 5mod2=1, 72mod3=0, 143mod14=3

Note that if there is more than one π‘Ž which satisfies the statement, you are allowed to find any.

Solutions & Walkthrough

Detailed video explanations, mathematical intuition, and clean C++ implementation code.

Connecting secure classroom stream...
Back to Codeforces Round 943
Previous ProblemNext Problem