Advertisement
Ahmed_Negm

Untitled

Mar 24th, 2023
766
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.56 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #include <ext/pb_ds/assoc_container.hpp>
  3. #include <ext/pb_ds/tree_policy.hpp>
  4. using namespace std;
  5. using namespace __gnu_pbds;
  6. #define ll long long
  7. #define OO 2'000'000'000
  8. #define ull unsigned long long
  9. #define nl '\n'
  10. #define sz(x) (ll)(x.size())
  11. #define all(x) x.begin(),x.end()
  12. #define rall(s)  s.rbegin(), s.rend()
  13. #define getline(s) getline(cin>>ws,s)
  14. #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  15. #define pi  3.141592653589793
  16. #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
  17. #define multi_ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
  18.  
  19.  
  20. void Fast_IO(){
  21. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  22. // freopen("filename.in", "r", stdin);
  23. // freopen("filename.txt", "w", stdout);
  24. #ifndef ONLINE_JUDGE
  25. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  26. #endif
  27. }
  28.  
  29.  
  30.  
  31.  
  32. int dx[] = { 2, 1, -1, -2, -2, -1, 1, 2 };
  33. int dy[] = { 1, 2, 2, 1, -1, -2, -2, -1 };
  34.  
  35.  
  36. ll fast_pow(ll a,ll b,ll mod){
  37.     ll res = 1;
  38.     while(b){
  39.         if(b&1)res = (res*a)%mod;
  40.         a = (a*a)%mod;
  41.         b>>=1;
  42.     }
  43.     return res;
  44. }
  45.  
  46.  
  47. void solve(){
  48.   ll n; cin>>n;
  49.     for(int i=0;i<10;i++){
  50.         ll x = rand()%(n-1)+1;
  51.         ll y = fast_pow(x,n-1,n);
  52.         if(y!=1){
  53.             cout<<"Ramadan Kareem"<<nl;
  54.             return;
  55.         }
  56.     }
  57. cout<<"3id sa3eed"<<nl;
  58.  
  59. }
  60.  
  61. int main(){
  62.     Fast_IO();
  63. int t =1;
  64. //cin>>t;
  65. while(t--){
  66. solve();
  67. }
  68. return 0;
  69. }  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement