913A - Modular Exponentiation

-
  1. #include<iostream>
  2. #include<math.h>
  3. using namespace std;
  4. int main(){
  5. long n,m;
  6. cin>>n>>m;
  7. long p= pow(2,n);
  8. long ans = m%p;
  9. cout<<ans;
  10.  
  11.  

Comments

Post a Comment

Popular posts from this blog

Codeforce Problem 1703A. YES or YES?

-
A. YES or YES?   There is a string  s �  of length  3 3 , consisting of uppercase and lowercase English letters. Check if it is equal to " YES " (without quotes), where each letter can be in any case. For example, " yES ", " Yes ", " yes " are all allowable. Input The first line of the input contains an integer  t �  ( 1 ≤ t ≤ 10 3 1 ≤ � ≤ 10 3 ) — the number of testcases. The description of each test consists of one line containing one string  s �  consisting of three characters. Each character of  s �  is either an uppercase or lowercase English letter. Output For each test case, output " YES " (without quotes) if  s �  satisfies the condition, and " NO " (without quotes) otherwise. You can output " YES " and " NO " in any case (for example, strings " yES ", " yes " and " Yes " will be recognized as a positive response). Example input Copy 10 YES yES yes Yes YeS Noo orZ yEz Y...
Read more

1535A. Fair Playoff

-
  A. Fair Playoff time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Four players participate in the playoff tournament. The tournament is held according to the following scheme: the first player will play with the second, and the third player with the fourth, then the winners of the pairs will play in the finals of the tournament. It is known that in a match between two players, the one whose skill is greater will win. The skill of the  i i -th player is equal to  s i s i  and all skill levels are pairwise different (i. e. there are no two identical values in the array  s s ). The tournament is called  fair  if the two players with the highest skills meet in the finals. Determine whether the given tournament is  fair . Input The first line contains a single integer  t t  ( 1 ≤ t ≤ 10 4 1 ≤ t ≤ 10 4 ) — the number of test cases. A single line of test case contains four integ...
Read more

262A - Roma and Lucky Numbers

-
262A - Roma and Lucky Numbers #include < bits / stdc ++. h > using namespace std ; int main () { int n , k , c = 0 , ans = 0 ; cin >> n >> k ; while ( n --) { c = 0 ; string s ; cin >> s ; for ( int i = 0 ; i < s . length (); i ++){ if ( s [ i ]== '4' or s [ i ]== '7' ) c ++;   } if ( c <= k ) ans ++;     } cout << ans ; return 0 ; }
Read more