├── 1030AInSearchOfAnEasyProblem.cpp ├── 110ANearlyLuckyNumber.cpp ├── 112APetyaAndStrings.cpp ├── 116ATram.cpp ├── 1328ADivisibillityProblem.cpp ├── 136APresents.cpp ├── 144AArrivalOfThegeneral.cpp ├── 148AInsomniaCure.cpp ├── 200BDrinks.cpp ├── 228AIsYourHorseshoeOnTheOtherHoof.cpp ├── 231ATeam.cpp ├── 236ABoyOrGirl.cpp ├── 263ABeautifulMatrix.cpp ├── 266AStonesOnTheTable.cpp ├── 271ABeautifulYear.cpp ├── 281AWordCapitalization ├── 282ABit++.cpp ├── 339AHelpfulMaths.cpp ├── 344AMagnets.cpp ├── 443AAntonAndLetters.cpp ├── 467AGeorgeAndAccommodation.cpp ├── 469AIWannaBeTheGuy.cpp ├── 486ACalculatingFunction.cpp ├── 4A-Watermelon.cpp ├── 50ADominoPiling.cpp ├── 520APangram.cpp ├── 546ASoldierAndBananas.cpp ├── 59AWord.cpp ├── 617AElephant.cpp ├── 61AUltraFastMathematiciam.cpp ├── 677AVanyaAndFence.cpp ├── 705AHulk.cpp ├── 71AWayTooLongWords.cpp ├── 734AAntonAndDanik.cpp ├── 791ABearAndBigBrother.cpp ├── 977AWrongSubtraction.cpp ├── QueueAtTheSchool.cpp ├── README.md └── Translation.cpp /1030AInSearchOfAnEasyProblem.cpp: -------------------------------------------------------------------------------- 1 | #include // 1030AInSearchOfAnEasyProblem 2 | #include 3 | int main() 4 | { 5 | int n, opinion; 6 | std::string result = "EASY"; 7 | std::cin >> n; 8 | for(int i = 0; i < n; i++) 9 | { 10 | std::cin >> opinion; 11 | if(opinion == 1) 12 | { 13 | result = "HARD"; 14 | } 15 | } 16 | std::cout << result; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /110ANearlyLuckyNumber.cpp: -------------------------------------------------------------------------------- 1 | #include // 110ANearlyLuckyNumber 2 | 3 | 4 | int main() 5 | { 6 | long long int n; 7 | int count = 0; 8 | std::cin >> n; 9 | while(n > 0) 10 | { 11 | if(n % 10 == 4 || n % 10 == 7) 12 | { 13 | count++; 14 | } 15 | n /= 10; 16 | } 17 | if(count == 4 || count == 7) 18 | { 19 | std::cout << "YES"; 20 | } 21 | else 22 | { 23 | std::cout << "NO"; 24 | } 25 | } -------------------------------------------------------------------------------- /112APetyaAndStrings.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | std::string str1, str2; 7 | std::cin >> str1 >> str2; 8 | for(int i=0; i // 116ATram 2 | 3 | 4 | int main() 5 | { 6 | int n, minCap = 0, a, b, maximumSeats = 0; 7 | std::cin >> n; 8 | for(int i = 0; i < n; i++) 9 | { 10 | 11 | std::cin >> a >> b; 12 | minCap = minCap - a; 13 | minCap = minCap + b; 14 | if(minCap > maximumSeats) 15 | { 16 | maximumSeats = minCap; 17 | } 18 | } 19 | std::cout << maximumSeats; 20 | } -------------------------------------------------------------------------------- /1328ADivisibillityProblem.cpp: -------------------------------------------------------------------------------- 1 | #include //1328ADivisibillityProblem 2 | 3 | int main() 4 | { 5 | int t, a, b; 6 | std::cin >> t; 7 | for(int i = 0; i < t; i++) 8 | { 9 | std::cin >> a >> b; 10 | if(a % b == 0) 11 | { 12 | std::cout << 0 << std::endl; 13 | } 14 | else 15 | { 16 | std::cout << b - (a%b) << std::endl; 17 | } 18 | } 19 | } -------------------------------------------------------------------------------- /136APresents.cpp: -------------------------------------------------------------------------------- 1 | #include //136APresents 2 | 3 | int main() 4 | { 5 | int n, k; 6 | std::cin >> n; 7 | int arr[n]; 8 | for(int i = 1; i <= n; i++) 9 | { 10 | std::cin >> k; 11 | arr[k - 1] = i; 12 | } 13 | for(int i = 0; i < n; i++) 14 | { 15 | std::cout << arr[i] << " "; 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /144AArrivalOfThegeneral.cpp: -------------------------------------------------------------------------------- 1 | #include //144AArrivalOfTheGeneral 2 | 3 | int main() 4 | { 5 | int n, max, min, res, iMax = 0, iMin = 0; 6 | std::cin >> n; 7 | int arr[200]; 8 | std::cin >> arr[0]; 9 | max = arr[0]; 10 | min = arr[0]; 11 | 12 | for(int i = 1; i < n ; i++) 13 | { 14 | std::cin >> arr[i]; 15 | if(arr[i] > max) 16 | { 17 | max = arr[i]; 18 | iMax = i; 19 | } 20 | else if(arr[i] <= min) 21 | { 22 | min = arr[i]; 23 | iMin = i; 24 | } 25 | } 26 | std::cout << iMax + (n - 1 - iMin) - (iMin < iMax ? 1 : 0) << std::endl; 27 | } -------------------------------------------------------------------------------- /148AInsomniaCure.cpp: -------------------------------------------------------------------------------- 1 | #include //148AInsomniaCure 2 | 3 | int main() 4 | { 5 | int k, l, m, n, d, res = 0; 6 | std::cin >> k >> l >> m >> n >> d; 7 | for(int i = 1; i <= d; i++) 8 | { 9 | if(i % k == 0 || i % l == 0 || i % m == 0 || i % n == 0) 10 | { 11 | res++; 12 | } 13 | } 14 | std::cout << res << std::endl; 15 | } -------------------------------------------------------------------------------- /200BDrinks.cpp: -------------------------------------------------------------------------------- 1 | #include //200BDrinks 2 | 3 | int main() 4 | { 5 | int n; 6 | double p, res = 0; 7 | std::cin >> n; 8 | for(int i = 0; i < n; i++) 9 | { 10 | std::cin >> p; 11 | res += p / 100; 12 | } 13 | std::cout <<(res / n) * 100<< std::endl; 14 | return 0; 15 | } -------------------------------------------------------------------------------- /228AIsYourHorseshoeOnTheOtherHoof.cpp: -------------------------------------------------------------------------------- 1 | #include //228AIsYourHorseshoeOnTheOtherHoof 2 | 3 | int main() 4 | { 5 | int n1, n2, n3, n4, res = 0; 6 | std::cin >> n1 >> n2 >> n3 >> n4; 7 | if(n1 == n2) 8 | { 9 | res++; 10 | if(n2 == n3) 11 | { 12 | res++; 13 | if(n3 == n4) 14 | { 15 | res++; 16 | } 17 | } 18 | else if(n3 == n4) 19 | { 20 | res++; 21 | } 22 | } 23 | else if(n1 == n3) // 1 2 4 1 24 | { 25 | res++; 26 | if(n3 == n4) 27 | { 28 | res++; 29 | } 30 | else if(n2 == n4) 31 | { 32 | res++; 33 | } 34 | } 35 | else if(n1 == n4) 36 | { 37 | res++; 38 | if(n2 == n3) 39 | { 40 | res++; 41 | } 42 | } 43 | else if(n2 == n3) // 1 2 4 2 44 | { 45 | res++; 46 | if(n3 == n4) 47 | { 48 | res++; 49 | } 50 | } 51 | else if(n2 == n4) 52 | { 53 | res++; 54 | } 55 | else if(n3 == n4) 56 | { 57 | res++; 58 | } 59 | std::cout << res << std::endl; 60 | return 0; 61 | } -------------------------------------------------------------------------------- /231ATeam.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int n; 7 | int num1, num2, num3, result = 0; 8 | std::cin >> n; 9 | for(int i = 0; i < n; i++) 10 | { 11 | std:: cin >> num1 >> num2 >> num3; 12 | if(num1 + num2 + num3 >= 2) 13 | { 14 | result++; 15 | } 16 | } 17 | std::cout << result; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /236ABoyOrGirl.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | 6 | int main() 7 | { 8 | std::string userName; 9 | std::cin >> userName; 10 | int disChar = 0; 11 | sort(userName.begin(), userName.end()); 12 | for(int i = 1; i < userName.size(); i++) 13 | { 14 | if(userName[i] != userName[i - 1]) 15 | { 16 | disChar++; 17 | } 18 | } 19 | if(disChar % 2 == 0) 20 | { 21 | std::cout << "IGNORE HIM!"; 22 | } 23 | else 24 | { 25 | std::cout << "CHAT WITH HER!"; 26 | } 27 | return 0; 28 | } -------------------------------------------------------------------------------- /263ABeautifulMatrix.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int n, n1, n2, n3, n4, result = 0; 7 | for(int i = 0; i < 5; i++) 8 | { 9 | std::cin >> n >> n1 >> n2 >> n3 >> n4; 10 | if(n == 1 || n1 == 1 || n2 == 1 || n3 == 1 || n4 == 1) 11 | { 12 | if(n == 1) 13 | { 14 | result = abs(2 - i) + 2; 15 | } 16 | else if(n1 == 1) 17 | { 18 | result = abs(2 - i) + 1; 19 | } 20 | else if(n2 == 1) 21 | { 22 | result = abs(2 - i); 23 | } 24 | else if(n3 == 1) 25 | { 26 | result = abs(2 - i) + 1; 27 | } 28 | else 29 | { 30 | result = abs(2 - i) + 2; 31 | } 32 | } 33 | 34 | } 35 | std::cout << result; 36 | return 0; 37 | } -------------------------------------------------------------------------------- /266AStonesOnTheTable.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | 5 | 6 | int main() 7 | { 8 | int n, count = 0; 9 | std::cin >> n; 10 | std::string s; 11 | std:: cin >> s; 12 | for(int i = 1; i < n; i++) 13 | { 14 | if(s[i] == s[i - 1]) 15 | { 16 | count++; 17 | } 18 | } 19 | std::cout << count; 20 | return 0; 21 | } -------------------------------------------------------------------------------- /271ABeautifulYear.cpp: -------------------------------------------------------------------------------- 1 | #include // 271ABeautifulYear 2 | 3 | int main() 4 | { 5 | int y; 6 | std::cin >> y; 7 | 8 | while(true) 9 | { 10 | y += 1; 11 | int a = y / 1000; 12 | int b = (y / 100) % 10; 13 | int c = (y / 10) % 10; 14 | int d = y % 10; 15 | if( a != b && a != c && a != d && b != c && b != d && c != d) 16 | { 17 | break; 18 | } 19 | } 20 | std::cout << y; 21 | return 0; 22 | } -------------------------------------------------------------------------------- /281AWordCapitalization: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | 5 | int main() 6 | { 7 | std::string word; 8 | std::cin >> word; 9 | word[0] = toupper(word[0]); 10 | std::cout << word; 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /282ABit++.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int n, result = 0; 7 | std::string temp; 8 | std::cin >> n; 9 | for(int i = 0; i < n; i++) 10 | { 11 | std::cin >> temp; 12 | if(temp[0] == '+' || temp[1] == '+') 13 | { 14 | result++; 15 | } 16 | else 17 | { 18 | result--; 19 | } 20 | } 21 | std::cout << result; 22 | return 0; 23 | } -------------------------------------------------------------------------------- /339AHelpfulMaths.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | std::string s1, s2; 8 | std::cin >> s1; 9 | for(int i=0; i //344AMagnets 2 | #include 3 | 4 | int main() 5 | { 6 | int n, res = 1, lastDigit, lastDigit1; 7 | std::cin >> n; 8 | std::string str; 9 | std::cin >> str; 10 | for(int i = 0; i < n; i++) 11 | { 12 | lastDigit = str[1]; 13 | std::cin >> str; 14 | lastDigit1 = str[1]; 15 | if(lastDigit != lastDigit1) 16 | { 17 | res++; 18 | } 19 | } 20 | std::cout << res << std::endl; 21 | return 0; 22 | } -------------------------------------------------------------------------------- /443AAntonAndLetters.cpp: -------------------------------------------------------------------------------- 1 | #include //443AAntonAndLetters 2 | 3 | int main() 4 | { 5 | int res = 0, index; 6 | std::string str; 7 | std::vector mark(26,false); 8 | std::getline (std::cin, str); 9 | for(int i = 0; i < str.size(); i++) 10 | { 11 | if('A' <= str[i] && str[i] <= 'Z') 12 | { 13 | index = str[i] - 'A'; 14 | mark[index] = true; 15 | } 16 | else if( 'a' <= str[i] && str[i] <= 'z') 17 | { 18 | index = str[i] - 'a'; 19 | mark[index] = true; 20 | } 21 | } 22 | for(int i = 0; i < 26; i++) 23 | { 24 | if(mark[i] == true) 25 | { 26 | res++; 27 | } 28 | } 29 | std::cout << res << std::endl; 30 | } -------------------------------------------------------------------------------- /467AGeorgeAndAccommodation.cpp: -------------------------------------------------------------------------------- 1 | #include // 467AGeorgeAndAccommodation 2 | 3 | 4 | int main() 5 | { 6 | int n, p, q, result = 0; 7 | std::cin >> n; 8 | for(int i = 0; i < n; i++) 9 | { 10 | std::cin >> p >> q; 11 | if(p + 1 < q) 12 | { 13 | result++; 14 | } 15 | } 16 | std::cout << result; 17 | return 0; 18 | } -------------------------------------------------------------------------------- /469AIWannaBeTheGuy.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n; 6 | std::cin >> n; 7 | int need[n]; 8 | for(int i = 0;i> x; 14 | for(int i= 0 ;i> a; 18 | a--; 19 | need[a] = 0; 20 | } 21 | std::cin >> x; 22 | for(int i= 0;i> a; 26 | a--; 27 | need[a] = 0; 28 | } 29 | for(int i = 0;i //486ACalculatingFunction 2 | #include 3 | 4 | int main() 5 | { 6 | long long n, a; 7 | std::cin >> n; 8 | if(n % 2 == 0) a = n / 2; 9 | else a = ((n + 1) / 2) * (-1); 10 | std::cout << a << std::endl; 11 | return 0; 12 | } 13 | -------------------------------------------------------------------------------- /4A-Watermelon.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int w; 8 | scanf("%d", &w); 9 | if(w > 2 && w % 2 == 0) 10 | { 11 | printf("YES"); 12 | } 13 | else 14 | { 15 | printf("NO"); 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /50ADominoPiling.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int M, N, result; 7 | std::cin >> M >> N; 8 | result = M * N / 2; 9 | std::cout << floor(result); 10 | return 0; 11 | } -------------------------------------------------------------------------------- /520APangram.cpp: -------------------------------------------------------------------------------- 1 | #include //520APangram 2 | 3 | int main() 4 | { 5 | int n, index, res = 1; 6 | std::string str; 7 | std::vector mark(26, false); 8 | std::cin >> n; 9 | std::cin >> str; 10 | if(n < 26) 11 | { 12 | std::cout << "NO" << std::endl; 13 | } 14 | else 15 | { 16 | for(int i = 0; i < n; i++) 17 | { 18 | if('A' <= str[i] && str[i] <= 'Z') 19 | { 20 | index = str[i] - 'A'; 21 | } 22 | else if( 'a' <= str[i] && str[i] <= 'z') 23 | { 24 | index = str[i] - 'a'; 25 | } 26 | mark[index] = true; 27 | } 28 | for(int i = 0; i < 26; i++) 29 | { 30 | if(mark[i] == false) 31 | { 32 | res = 0; 33 | } 34 | } 35 | if(res == 0) 36 | { 37 | std::cout << "NO" << std::endl; 38 | } 39 | else 40 | { 41 | std::cout << "YES" << std::endl; 42 | } 43 | } 44 | } -------------------------------------------------------------------------------- /546ASoldierAndBananas.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int k, n, w; 6 | std::cin >> k >> n >> w; 7 | int CostOfBananas = ((k + k + (w-1)*k)*w) / 2; 8 | int result = CostOfBananas - n; 9 | if(result <= 0) 10 | { 11 | std::cout << 0; 12 | } 13 | else 14 | { 15 | std::cout << result; 16 | } 17 | return 0; 18 | } -------------------------------------------------------------------------------- /59AWord.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | std::string s; 7 | std::cin >> s; 8 | int num_low = 0, num_upper = 0; 9 | for(int i = 0; i < s.size(); i++) 10 | { 11 | if(isupper(s[i])) 12 | { 13 | num_upper++; 14 | } 15 | else 16 | { 17 | num_low++; 18 | } 19 | } 20 | if(num_upper > num_low) 21 | { 22 | for(int i = 0; i < s.size(); i++) 23 | { 24 | s[i] = toupper(s[i]); 25 | } 26 | } 27 | else 28 | { 29 | for(int i = 0; i < s.size(); i++) 30 | { 31 | s[i] = tolower(s[i]); 32 | } 33 | } 34 | std::cout << s; 35 | } -------------------------------------------------------------------------------- /617AElephant.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int x, minSteps; 6 | std::cin >> x; 7 | if(x > 5 && x % 5 == 0) 8 | { 9 | minSteps = x / 5; 10 | } 11 | else if(x > 5) 12 | { 13 | minSteps = x / 5 + 1; 14 | } 15 | else 16 | { 17 | minSteps =1; 18 | } 19 | std::cout << minSteps; 20 | } -------------------------------------------------------------------------------- /61AUltraFastMathematiciam.cpp: -------------------------------------------------------------------------------- 1 | #include //61AUltraFastMathematician 2 | #include 3 | 4 | int main() 5 | { 6 | std::string s1, s2; 7 | std::cin >> s1 >> s2; 8 | for (int i = 0; i < s1.length(); i++) 9 | { 10 | if (s1[i] == s2[i]) 11 | { 12 | s1[i] = '0'; 13 | } 14 | else 15 | { 16 | s1[i] = '1'; 17 | } 18 | } 19 | std::cout << s1 << std::endl; 20 | return 0; 21 | } -------------------------------------------------------------------------------- /677AVanyaAndFence.cpp: -------------------------------------------------------------------------------- 1 | #include // 677AVanyaAndFence 2 | 3 | int main() 4 | { 5 | int n, h, a; 6 | int result = 0; 7 | std::cin >> n >> h; 8 | for(int i = 0; i < n; i++) 9 | { 10 | result++; 11 | std::cin >> a; 12 | if(a > h) 13 | { 14 | result++; 15 | } 16 | } 17 | std::cout << result; 18 | return 0; 19 | } -------------------------------------------------------------------------------- /705AHulk.cpp: -------------------------------------------------------------------------------- 1 | #include //705AHulk 2 | #include 3 | 4 | int main() 5 | { 6 | int n; 7 | std::string res; 8 | std::cin >> n; 9 | if(n == 1) 10 | { 11 | res = "I hate it"; 12 | } 13 | else 14 | { 15 | res = "I hate that"; 16 | } 17 | for (int i = 2; i <= n; i++) 18 | { 19 | if(i == n) 20 | { 21 | if( i % 2 != 0) 22 | { 23 | res += " I hate it"; 24 | } 25 | else 26 | { 27 | res += " I love it"; 28 | } 29 | } 30 | else 31 | { 32 | if( i % 2 != 0) 33 | { 34 | res += " I hate that"; 35 | } 36 | else 37 | { 38 | res += " I love that"; 39 | } 40 | } 41 | } 42 | std::cout << res << std::endl; 43 | return 0; 44 | } -------------------------------------------------------------------------------- /71AWayTooLongWords.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int n; 7 | std::cin >> n; 8 | std::string result = ""; 9 | for(int i = 0; i < n; i++) 10 | { 11 | std::string temp; 12 | std::cin >> temp; 13 | if( temp.size() > 10) 14 | { 15 | result += temp[0] + std::to_string(temp.size() - 2) + temp[temp.size() - 1] + "\n"; 16 | } 17 | else 18 | { 19 | result += temp + "\n"; 20 | } 21 | } 22 | std::cout << result << std::endl; 23 | return 0; 24 | } -------------------------------------------------------------------------------- /734AAntonAndDanik.cpp: -------------------------------------------------------------------------------- 1 | #include // 734AAntonAndDanik 2 | #include 3 | 4 | int main() 5 | { 6 | int n, anton = 0, danik = 0; 7 | std::string s; 8 | std::cin >> n >> s; 9 | for(int i = 0; i < s.size(); i++) 10 | { 11 | if(s[i] == 'A') 12 | { 13 | anton++; 14 | } 15 | else 16 | { 17 | danik++; 18 | } 19 | } 20 | if(anton > danik) 21 | { 22 | std::cout << "Anton"; 23 | } 24 | else if(anton < danik) 25 | { 26 | std::cout << "Danik"; 27 | } 28 | else 29 | { 30 | std::cout << "Friendship"; 31 | } 32 | } -------------------------------------------------------------------------------- /791ABearAndBigBrother.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | int a, b; 7 | std::cin >> a >> b; 8 | double num_year = (std::log(b) - std::log(a)) / log(1.5); 9 | if(num_year == 0) 10 | { 11 | std::cout << 1; 12 | } 13 | else if(num_year == 1) 14 | { 15 | std::cout << 2; 16 | } 17 | else 18 | { 19 | std::cout << std::ceil(num_year ); 20 | } 21 | return 0; 22 | } -------------------------------------------------------------------------------- /977AWrongSubtraction.cpp: -------------------------------------------------------------------------------- 1 | #include // 977AWrongSubtraction 2 | 3 | 4 | int main() 5 | { 6 | int k, n; 7 | std::cin >> n >> k; 8 | for(int i = 0; i < k; i++) 9 | { 10 | 11 | if(n % 10 != 0) 12 | { 13 | n = n -1; 14 | } 15 | else 16 | { 17 | n = n / 10; 18 | } 19 | } 20 | std::cout << n; 21 | } -------------------------------------------------------------------------------- /QueueAtTheSchool.cpp: -------------------------------------------------------------------------------- 1 | #include // 266BQueueAtTheSchool 2 | #include 3 | 4 | int main() 5 | { 6 | int n, t; 7 | std::string s; 8 | std::cin >> n >> t >> s; 9 | for(int i = 0; i < t; i++) 10 | { 11 | for(int j = 1; j < n; ++j) 12 | { 13 | if(s[j] == 'G' && s[j - 1] == 'B') 14 | { 15 | s[j] = 'B'; 16 | s[j-1] = 'G'; 17 | ++j; 18 | } 19 | } 20 | } 21 | std::cout << s; 22 | } -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 |

🤯 CodeForces 🤯

2 | Designed to help people save the exercises I solved in c++ and track my progress and learning in algorithms, data structures, and programming math puzzles. 3 | 4 | 5 |

6 | GitHub top language 7 | 8 | Repository size 9 | 10 | 11 | GitHub last commit 12 | 13 |

14 | 15 | 16 | 17 | # Sources for learning and practice 💪 18 | + https://github.com/lnishan/awesome-competitive-programming 19 | + https://cses.fi/book/book.pdf 20 | 21 | ![ReallyLowNeilDegrasseTysonGIF (2)](https://user-images.githubusercontent.com/91504420/213191844-6e278943-4a96-408a-b25d-4935186aacd4.gif) 22 | 23 | 24 | 25 |

26 |                                                                                                                  27 | 28 | 29 | -------------------------------------------------------------------------------- /Translation.cpp: -------------------------------------------------------------------------------- 1 | #include // 41ATranslation 2 | #include 3 | 4 | int main() 5 | { 6 | std::string s, t; 7 | std::cin >> s >> t; 8 | std::string s_rev; 9 | if(s.size() != t.size()) 10 | { 11 | std::cout << "NO"; 12 | } 13 | else 14 | { 15 | for(int i = s.size() - 1; i >= 0; i--) 16 | { 17 | s_rev += s[i]; 18 | } 19 | if(s_rev == t) 20 | { 21 | std::cout << "YES"; 22 | } 23 | else 24 | { 25 | std::cout << "NO"; 26 | } 27 | } 28 | } --------------------------------------------------------------------------------