My issue
i want a girlfrriend
My code
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
//------------------------------------------------------------------
int isprime(ll a)
{
if(a==1)return 0;
if(a==2||a==3)return 1;
else if(a%2==0||a%3==0)return 0;
else
{
for(ll i=5;i*i<=a;i+=2)
{
if(a%i==0)return 0;
}
return 1;
}
}
ll power(ll a,ll b)
{
ll ans=1;
while(b)
{
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b=b/2;
}
return ans;
}
ll fact(ll f)
{
return (f <= 1) ? 1 : f * fact(f - 1);
}
bool sortbysec(const pair<int,int> &a,const pair<int,int> &b)
{
return (a.second < b.second);
}
int main()
{
cin.tie(NULL);
cout.tie(NULL);
ll t;
cin>>t;
while(t--)
{
cout<<endl;
}
}
Problem Link: One Stone or Two Stones Practice Coding Problem - CodeChef