GitHub - HelmiB/Competitive-Programming: Competitive Programming Solutions.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 11 Commits
.vscode		.vscode
2_Dimensional_Range_Minimum_Query.cpp		2_Dimensional_Range_Minimum_Query.cpp
2_Dimensional_Range_Minimum_Query.py		2_Dimensional_Range_Minimum_Query.py
ACPC2019_L.cpp		ACPC2019_L.cpp
A_Best_Subsegment.cpp		A_Best_Subsegment.cpp
A_Binary_Protocol.cpp		A_Binary_Protocol.cpp
A_Book_Reading.cpp		A_Book_Reading.cpp
A_Buses_Between_Cities.cpp		A_Buses_Between_Cities.cpp
A_Candies.cpp		A_Candies.cpp
A_Chess_Tourney.cpp		A_Chess_Tourney.cpp
A_Chores.cpp		A_Chores.cpp
A_Cinema_Line.cpp		A_Cinema_Line.cpp
A_Co_prime_Array.cpp		A_Co_prime_Array.cpp
A_Collecting_Beats_is_Fun.cpp		A_Collecting_Beats_is_Fun.cpp
A_Comparing_Two_Long_Integers.cpp		A_Comparing_Two_Long_Integers.cpp
A_Curriculum_Vitae.cpp		A_Curriculum_Vitae.cpp
A_Dice_Rolling.cpp		A_Dice_Rolling.cpp
A_Diplomas_and_Certificates.cpp		A_Diplomas_and_Certificates.cpp
A_Divisibility_Problem.cpp		A_Divisibility_Problem.cpp
A_EhAb_AnD_gCd.cpp		A_EhAb_AnD_gCd.cpp
A_Environment_Friendly_Travel.cpp		A_Environment_Friendly_Travel.cpp
A_Extract_Numbers.cpp		A_Extract_Numbers.cpp
A_Fashion_in_Berland.cpp		A_Fashion_in_Berland.cpp
A_Fox_and_Number_Game.cpp		A_Fox_and_Number_Game.cpp
A_Gabriel_and_Caterpillar.cpp		A_Gabriel_and_Caterpillar.cpp
A_Grandma_Laura_and_Apples.cpp		A_Grandma_Laura_and_Apples.cpp
A_Heating.cpp		A_Heating.cpp
A_Hexadecimal_s_theorem.cpp		A_Hexadecimal_s_theorem.cpp
A_Infinite_Sequence.cpp		A_Infinite_Sequence.cpp
A_Johny_Likes_Numbers.cpp		A_Johny_Likes_Numbers.cpp
A_King_Moves.cpp		A_King_Moves.cpp
A_LCS_A_.cpp		A_LCS_A_.cpp
A_Level_Statistics.cpp		A_Level_Statistics.cpp
A_Linova_and_Kingdom.cpp		A_Linova_and_Kingdom.cpp
A_Local_Extrema.cpp		A_Local_Extrema.cpp
A_Lucky_Year.cpp		A_Lucky_Year.cpp
A_Maximal_Binary_Matrix.cpp		A_Maximal_Binary_Matrix.cpp
A_Maximum_Increase.cpp		A_Maximum_Increase.cpp
A_Meow.cpp		A_Meow.cpp
A_Minutes_Before_the_New_Year.cpp		A_Minutes_Before_the_New_Year.cpp
A_Needle_in_the_Haystack.cpp		A_Needle_in_the_Haystack.cpp
A_Prime_Subtraction.cpp		A_Prime_Subtraction.cpp
A_Professor_GukiZ_s_Robot.cpp		A_Professor_GukiZ_s_Robot.cpp
A_Quasi_palindrome.cpp		A_Quasi_palindrome.cpp
A_Remove_a_Progression.cpp		A_Remove_a_Progression.cpp
A_Tennis_Tournament.cpp		A_Tennis_Tournament.cpp
A_Text_Volume.cpp		A_Text_Volume.cpp
A_The_Contest.cpp		A_The_Contest.cpp
A_The_Text_Splitting.cpp		A_The_Text_Splitting.cpp
A_There_Are_Two_Types_Of_Burgers.cpp		A_There_Are_Two_Types_Of_Burgers.cpp
A_Treasure_Hunt.cpp		A_Treasure_Hunt.cpp
A_Tricky_Sum.cpp		A_Tricky_Sum.cpp
A_USB_Flash_Drives.cpp		A_USB_Flash_Drives.cpp
A_Yet_Another_Tetris_Problem.cpp		A_Yet_Another_Tetris_Problem.cpp
A_k_Factorization.cpp		A_k_Factorization.cpp
A_k_th_divisor.cpp		A_k_th_divisor.cpp
All_Numbers.cpp		All_Numbers.cpp
B_Alice_Bob_Two_Teams.cpp		B_Alice_Bob_Two_Teams.cpp
B_Average_Sleep_Time.cpp		B_Average_Sleep_Time.cpp
B_Balanced_Array.cpp		B_Balanced_Array.cpp
B_Balanced_Substring.cpp		B_Balanced_Substring.cpp
B_Buggy_Robot.cpp		B_Buggy_Robot.cpp
B_Candies_Division.cpp		B_Candies_Division.cpp
B_Cats_like_permutations.cpp		B_Cats_like_permutations.cpp
B_CopyCopyCopyCopyCopy.cpp		B_CopyCopyCopyCopyCopy.cpp
B_Dinner_with_Emma.cpp		B_Dinner_with_Emma.cpp
B_Distances_to_Zero.cpp		B_Distances_to_Zero.cpp
B_Emotes.cpp		B_Emotes.cpp
B_Five_In_a_Row.cpp		B_Five_In_a_Row.cpp
B_Flag_of_Berland.cpp		B_Flag_of_Berland.cpp
B_Fox_and_Cross.cpp		B_Fox_and_Cross.cpp
B_Grandfather_Dovlet_s_calculator.cpp		B_Grandfather_Dovlet_s_calculator.cpp
B_HDD_is_Outdated_Technology.cpp		B_HDD_is_Outdated_Technology.cpp
B_Japanese_Crosswords_Strike_Back.cpp		B_Japanese_Crosswords_Strike_Back.cpp
B_K_th_Beautiful_String.cpp		B_K_th_Beautiful_String.cpp
B_Kayaking.cpp		B_Kayaking.cpp
B_Kill_Em_All.cpp		B_Kill_Em_All.cpp
B_LCS_B_.cpp		B_LCS_B_.cpp
B_Letters_Rearranging.cpp		B_Letters_Rearranging.cpp
B_Luba_And_The_Ticket.cpp		B_Luba_And_The_Ticket.cpp
B_Makes_And_The_Product.cpp		B_Makes_And_The_Product.cpp
B_Making_Sequences_is_Fun.cpp		B_Making_Sequences_is_Fun.cpp
B_Math_Show.cpp		B_Math_Show.cpp
B_Middle_Class.cpp		B_Middle_Class.cpp
B_New_Skateboard.cpp		B_New_Skateboard.cpp
B_Obtain_Two_Zeroes.cpp		B_Obtain_Two_Zeroes.cpp
B_Odd_sum.cpp		B_Odd_sum.cpp
B_Optimal_Point_on_a_Line.cpp		B_Optimal_Point_on_a_Line.cpp
B_Permutation_Game.cpp		B_Permutation_Game.cpp
B_Powers_of_Two.cpp		B_Powers_of_Two.cpp
B_Queries_about_less_or_equal_elements.cpp		B_Queries_about_less_or_equal_elements.cpp
B_Queries_on_a_String.cpp		B_Queries_on_a_String.cpp
B_Seating_On_Bus.cpp		B_Seating_On_Bus.cpp
B_Shopping.cpp		B_Shopping.cpp
B_Square_Filling.cpp		B_Square_Filling.cpp
B_The_Best_Gift.cpp		B_The_Best_Gift.cpp
B_The_Golden_Age.cpp		B_The_Golden_Age.cpp
B_The_Same_Calendar.cpp		B_The_Same_Calendar.cpp
B_The_Time.cpp		B_The_Time.cpp
B_USB_vs_PS_2.cpp		B_USB_vs_PS_2.cpp

Repository files navigation

#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
const long double EPS = 1e-14;
const int maxn = 100500;
const int mod = 1e9 + 7;
int n;
string s;
int solve(int pos, char pr){
    if(pos == n) return 1;
    int ans = 0;
    if(s[pos] == 'd'){
        for(char c = '0'; c <= '9' ; ++c)
            if(c != pr)
                ans += solve(pos + 1, c);
    }else{
        for(char c = 'a'; c <= 'z' ; ++c)
            if(c != pr)
                ans += solve(pos + 1, c);
    }
    return ans;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> s;
    n = sz(s);
    cout << solve(0, '*') << '\n';
    return 0;
}