USACO: Dual Palindromes

Problem Link : http://train.usaco.org/usacoprob2?a=zjRHnl47W6f&S=dualpal


/*
User ID: tanmoyt1
PROG: dualpal
LANG: C++
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define CIN ios_base::sync_with_stdio(0)
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define getint2(a,b) scanf("%d%d",&a,&b)
#define getint3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define loop(i,n) for(int i=0;i<n;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

string convert(int n, int base)
{
    string str;
    int x;
    char ch;
    while(n)
    {
        x=n%base;
        if(x>9)
            ch='A'+x-10;
        else
            ch='0'+x;
        str+=ch;
        n/=base;
    }
    reverse(all(str));
    return str;
}

bool ispal(string str)
{
    int l=SZ(str);
    if(str[0]=='0' || str[l-1]=='0')
        return false;

    for(int i=0; i<l/2; i++)
        if(str[i]!=str[l-1-i])
            return false;
    return true;
}

int main()

{

    freopen("dualpal.in","r",stdin);
    freopen("dualpal.out","w",stdout);

    int n,s;
    getint2(n,s);
    int cnt=0;
    int temp=0;
    for(int i=s+1; cnt<n; i++)
    {
        temp=0;
        for(int j=2; j<11; j++)
        {
            if(ispal(convert(i,j)))
                temp++;
            if(temp==2)
            {
                cout<<i<<endl;
                cnt++;
                break;
            }
        }
    }
    return 0;
}

Advertisements

USACO : Palindromic Squares

Problem Link : http://train.usaco.org/usacoprob2?a=zjRHnl47W6f&S=palsquare


/*
User ID: tanmoyt1
PROG: palsquare
LANG: C++
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define CIN ios_base::sync_with_stdio(0)
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define getint2(a,b) scanf("%d%d",&a,&b)
#define getint3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define loop(i,n) for(int i=0;i<n;i++)
#define TEST_CASE(t) for(int z=1;z<=t;z++)
#define PRINT_CASE printf("Case %d: ",z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

/* Bits operation */
int Set(int n,int pos)  { return n = n | 1<<pos;}
bool check(int n,int pos) { return n & 1<<pos;}
int Reset(int n, int pos) { return n=n & ~(1<<pos);}
/*---------------*/

string convert(int n, int base)
{
    string str;
    int x;
    char ch;
    while(n)
    {
        x=n%base;
        if(x>9)
            ch='A'+x-10;
        else
            ch='0'+x;
        str+=ch;
        n/=base;
    }
    reverse(all(str));
    return str;
}

bool ispal(string str)
{
    int l=SZ(str);
    for(int i=0;i<l/2;i++)
        if(str[i]!=str[l-1-i])
        return false;
    return true;
}

int main()
{
    freopen("palsquare.in","r",stdin);
    freopen("palsquare.out","w",stdout);
    int b;
    sc("%d",&b);
    for(int i=1;i<=300;i++)
    {
        string str=convert(i*i,b);
        if(ispal(str))
            cout<<convert(i,b)<<" "<<str<<endl;
    }
    return 0;
}

USACO : Name That Number

2

/*
User ID: tanmoyt1
Link : http://train.usaco.org/usacoprob2?a=z9TmPNj3S8H&S=namenum
*/

/*
PROG: namenum
LANG: C++
*/

#include <iostream>
#include <fstream>
#include <string>

using namespace std;

string serializeName(const string &in)
{
    string ret = "";
    for(int i = 0; i < in.length(); ++i)
    {
        if(in[i] == 'Q' || in[i] == 'Z')
            return "1";
        if(in[i] < 'Q')
            ret += ((in[i] - 'A') / 3) + '2';
        else
            ret += ((in[i] - 'Q') / 3) + '7';
    }
    return ret;
}

int main()
{
     freopen("namenum.in","r",stdin);
     freopen("namenum.out","w",stdout);
    ifstream fdict ("dict.txt");

    string serial;
    cin >> serial;

    bool found = false;
    string entry;
    while(fdict >> entry)
        if(entry.length() == serial.length() && serializeName(entry) == serial)
        {
            found = true;
            cout << entry << endl;
        }

    if(!found)
        cout << "NONE" << endl;

    return 0;
}