বৃহস্পতিবার, ৩০ আগস্ট, ২০১৮

UVA 300 - Maya Calendar

#include<stdio.h>
#include<string.h>
int main()
{
    long n,i1;
    char aa[20][10]={"pop","no","zip","zotz","tzec","xul","yoxkin","mol","chen","yax","zac","ceh","mac","kankin","muan","pax","koyab","cumhu","uayet"};
    char s[20][10]={"imix","ik","akbal","kan","chicchan","cimi","manik","lamat","muluk","ok","chuen","eb","ben","ix","mem","cib","caban","eznab","canac","ahau"};
    long a,b,a1,b1,c1,d,e,i;
    char c[1000];
    scanf("%ld",&n);
    printf("%ld\n",n);
    for(i1=0;i1<n;i1++)
    {
        scanf("%ld. %s %ld",&a,c,&b);
        a1=b*365;
        for(i=0;i<19;i++)
        {
            if(strcmp(aa[i],c)==0)
            break;
        }
        a1=a1+i*20+a+1;
        b1=(a1-1)/260;
        c1=a1-b1*260;
        d=(c1-1)%20;
        e=(c1-1)%13;
        printf("%ld %s %ld\n",++e,s[d],b1);
    }
    return 0;
}

কোন মন্তব্য নেই:

একটি মন্তব্য পোস্ট করুন

Factorization with prime Sieve

vector <int> prime; char sieve[1000009]; int N=1000009; void primeSieve ( ) { sieve[0] = sieve[1] = 1; prime.push_back(2); ...