Codeforces #107 DIV2 ABCD

A

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
int n,k,l, c,d,p,nl,np;
int main()
{
        while (cin >> n >> k >> l >> c >> d >> p >> nl >> np)
        {
                int a1 = k * l / nl;
                int a2 = p / np;
                int a3 = c * d;
                cout << min(a1,min(a2,a3)) / n << endl;
        }
        return ;
}

B

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
struct node
{
        int girl;
        int pizza;
        int taxi;
        int s;
}src[];
char name[][];
int main()
{
       // freopen("sample.txt","r",stdin);
        int N;
        while (scanf("%d",&N) != EOF)
        {
                for (int i =  ; i < N ; i++)
                {
                        scanf("%d%s",&src[i].s,name[i]);
                        src[i].girl = src[i].pizza = src[i].taxi = ;
                        for (int j =  ; j < src[i].s; j++)
                        {
                                char tmp[];
                                scanf("%s",tmp);
                                bool flag =true;
                                int cnt[];memset(cnt,,sizeof(cnt));
                                cnt[tmp[] - ''] ++; cnt[tmp[] -''] ++;cnt[tmp[] -'']++;
                                cnt[tmp[] - ''] ++; cnt[tmp[] - ''] ++;cnt[tmp[]  - '']++;
                                for (int j =  ; j < ;j++) if (cnt[j]  >= ) flag = false;
                               // printf("%d %d %d\n",a,b,c);
                                if (!flag) src[i].taxi++;
                                else if (tmp[] - '' > tmp[] - '' && tmp[] -'' > tmp[] - '' && tmp[] -'' > tmp[] - '' && tmp[] - '' > tmp[] -'' &&
                                         tmp[] - '' > tmp[] - '') src[i].pizza++;
                                else src[i].girl++;
                        }
                }
                int anstaxi = -,st[],casst = ;
                int anspizza = -,sp[],cassp = ;
                int ansgirl = -,sg[],cassg = ;;
                for (int i =  ; i < N; i++)
                {
                        if (anstaxi < src[i].taxi) {anstaxi = src[i].taxi; casst = ; st[casst++] = i;}
                        else if (anstaxi == src[i].taxi) {st[casst++]= i;}
                        if (anspizza  < src[i].pizza)  {anspizza = src[i].pizza ; cassp = ; sp[cassp++] = i;}
                        else if (anspizza == src[i].pizza) {sp[cassp++]= i;}
                        if (ansgirl < src[i].girl) {ansgirl = src[i].girl; cassg = ; sg[cassg++] = i;}
                        else if (ansgirl == src[i].girl) {sg[cassg++]= i;}
                }
                printf("If you want to call a taxi, you should call: ");
                for (int i =  ; i < casst ; i++)
                {
                        if (i == casst - ) printf("%s.\n",name[st[i]]);
                        else printf("%s, ",name[st[i]]);
                }
                printf("If you want to order a pizza, you should call: ");
                for (int i =  ; i < cassp; i++)
                {
                        if (i == cassp  - ) printf("%s.\n",name[sp[i]]);
                        else printf("%s, ",name[sp[i]]);
                }
                printf("If you want to go to a cafe with a wonderful girl, you should call: ");
                for (int i =  ; i < cassg; i++)
                {
                        if (i == cassg - ) printf("%s.\n",name[sg[i]]);
                        else printf("%s, ",name[sg[i]]);
                }
        }
        return ;
}

C

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
vector <LL>G;
int main()
{
        LL N;
        while (cin >> N)
        {
                G.clear();
                for (LL  i =  ; i * i <= N; i++)
                        while (N % i == )
                {
                        G.push_back(i);
                        N /= i;
                }
                if (N > ) G.push_back(N);
                if (G.size() < ) cout <<  << endl <<  <<endl;
                else if (G.size() == ) cout <<  <<endl;
                else cout << << endl << G[] * G[] <<endl;
        }
        return ;
}

D

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}
#define MOD 1000000007
LL n,m,k;
LL mypow(LL a,LL b)
{
        LL ans = ;
        for (LL i =  ; i <= b; i++)
        ans = (ans * a) % MOD;
        return ans;
}
int main()
{
        while (cin >> n >> m >> k)
        {
                LL ans;
                if(k > n || k == ) ans = mypow(m,n);
                else if (k == n) ans = mypow(m,(k + )/);
                else
                {
                        if (k % ) ans = m * m;
                        else ans = m;
                }
                cout << ans <<endl;
        }
        return ;
}