Skip to content

Latest commit

 

History

History
85 lines (70 loc) · 4.03 KB

Home.md

File metadata and controls

85 lines (70 loc) · 4.03 KB

Problem Solving by Programming

This page is about problem solving by C programming. C is just a vehicle to program. It could be any other language instead.

Unit 1

Basic Programming Constructs

Worked out Examples

Problems for which solutions are worked out in an incremental fashion

  1. Frog Jumping
  2. The Rank
  3. Romaji
  4. Ehab and Another Construction
  5. Repeating Cipher

Problems from Code Forces

Start solving these problems in the lines demonstrated above.

  1. Golden Plate (1031A)
  2. In search of Easy problem (1030A)
  3. Integer sequence dividing (1102A)
  4. Find Divisible (1096A)
  5. Dice Rolling (1093A)
  6. Definite Game (1081A)
  7. Vova and Train (1066A)
  8. Gennady and Card Game (1097A)
  9. Uniform String (1092A)
  10. Petya and Origami (1080A)
  11. The King's Race (1075A)
  12. Vasya and Chocolate (1065A)
  13. Make a Triangle (1064A)
  14. Coins (1061A)
  15. Sum of digits (FLOW006)
  16. Bear and Big Brother (791A)

A recap

Unit 2

Intermediate Programming constructs

Problems from Code Forces

Arrays

  1. Array Stabilization (1095B)
  2. Good Number (365A)
  3. Mishka and Contest (999A)
  4. Ehab and Subtraction (1088B)
  5. Polycorp's Pockets (1003A)
  6. Less or Equal (977C)
  7. Songs Compression (1015C)
  8. Planning Expedition (1011B)
  9. Unimodal Array (831A)

Strings

  1. Mike and Palindrome (798A)
  2. Superhero Transformation (1111A)
  3. Right-Left Cipher (1085A)
  4. Minimize the String (1076A)
  5. Palindromic Twist (1027A)
  6. Letters Rearranging (1093B)
  7. Delete from Left (1005B)
  8. Antipalindrome (981A)
  9. File Name (978B)
  10. Two-gram (977B)

Bitwise operators

  1. Get kth bit
  2. Is negative
  3. Set Kth bit 1
  4. Set Kth bit 0
  5. Count ones
  6. Left circular shift
  7. Right circular shift

Unit 3

Advanced Programming Constructs