UVa 13197 - Cuberoot This

#include<bits/stdc++.h>

using namespace std;

#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define pfn(x , k) printf(k , x)
#define nl puts("")
#define psb push_back
#define mset(c,v) memset(c , v , sizeof c)
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)
#define psb push_back
#define clr clear()

typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef vector<string>vs;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;

const int mod = 1000007;
const int high = 1000;

int main()
{
    LL i , p , a;
    LL ans = 0;
    while(~sf("%lld %lld" , &a , &p))
    {
        int flag = 1;

        for(i=0; i<high; i++)
        {
            LL cube = powl(i , 3);

            if((cube % p == a) && (a % p == a))
            {
                if(flag)
                {
                    if(i < p)
                    {
                        pf("%lld", i);
                        flag = 0;
                    }
                }

                else
                {
                    if(i < p)
                    {
                        pf(" %lld" , i);
                    }
                }
            }
        }

        pf("\n");
    }

    return 0;
}

Comments

Popular posts from this blog

SPOJ-CMG - Collecting Mango

LightOJ 1009 - Back to Underworld

LeetCode Palindrome Number