Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Flare Up Like A Flame */
- // Start Time:
- #include<bits/stdc++.h>
- using namespace std;
- #define ff first
- #define ss second
- #define MX 1000000
- #define ll long long
- #define pb push_back
- #define pi acos(-1.0)
- #define PQ priority_queue
- #define mod 1000000007
- #define eps 1/1000000000
- #define pii pair<int,int>
- #define pll pair<ll,ll>
- #define endl "\n"
- #define Fast ios::sync_with_stdio(0); //cin.tie(0); cout.tie(0)
- #define bug(a) cout<<#a<<":"<<a<<endl
- #define TC(tc) cout<<"Case "<<tc++<<": "
- #define all(x) (x).begin(),(x).end()
- #define allr(x) (x).rbegin(),(x).rend()
- #define Mul(a,b) (a%mod * b%mod)%mod;
- #define Add(a,b) (a%mod + b%mod)%mod;
- #define mem(a,b) memset(a, b, sizeof(a))
- #define double_print(x,a) cout<<fixed<<setprecision(x)<<a<<endl
- ll tc=1;
- ll phi[MX];
- void euler_totient() {
- for(int i=0; i<MX; i++) phi[i]=i;
- for(int i=2; i<MX; i++) {
- if(phi[i]==i) {
- for(int j=i; j<MX; j+=i)
- phi[j]-=(phi[j]/i);
- }
- }
- }
- int main()
- {
- Fast;
- //euler_totient();
- ll t;
- cin>>t;
- while(t--)
- {
- ll a,b,m;
- cin>>a>>b>>m;
- ll z=m/(b-a);
- for(int i=0; i<=z; i++)
- {
- ll x=a+i;
- ll y=b+i;
- cout<<x<<" "<<y<<" = "<<__gcd(x,y)<<endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement