Problem_Solving/UVA 10843 - Anne's Game.cpp at master · assem2002/Problem_Solving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
//    std::ios_base::sync_with_stdio(false);   // (removes the interoperability that happens between C's stdio.h and iostream )
//    std::setvbuf(stdout, nullptr, _IOFBF, BUFSIZ);   //(will neglect the c's stdio.h property of doing inline flushing with every line of code)
#include <iostream>
//#include<numeric>
#include<vector>
#include<cmath>
//#include<stack>
//#include <iomanip>
//#include <vector>
#include<bits/stdc++.h>
//#include <bitset>
////#include<iomanip>
#include <algorithm>
//#include<queue>
////#include<deque>
////#include<numeric>
//#include<set>
//#include<unordered_set>
//#include<map>
////#include<fstream>
////#include<sstream>
////#include <thread>
////#include <chrono>
//#include<cstring>
//#include<string>
//#include <unordered_map>
////#include<memory>
////#include <iostream>
////#include <thread>
////#include<limits>


long long getmod(long long n,long long d,long long tree){
    long long base = 1 ;
    while(tree){
        if (tree&1) base*=n%d;
        base%=d;
        n =(n%d*(n%d))%d;
        tree/=2;
    }
    base%=d;
    return base;

}


int main(){
    int t;
    std::cin>>t;
    for (int i=0; i <t; ++i){
        long long temp;
        std::cin>>temp;
        std::cout<<"Case #"<<i+1<<": "<<getmod(temp,2000000011,temp-2)<<"\n";
    }
    return 0;


}