Codeforces Beta Round #107(Div2) 补题

#include<bits/stdc++.h>
using namespace std;
int main(){
    //20 19 30
    int n,k,l,c,d,p,nl,np;
    cin>>n>>k>>l>>c>>d>>p>>nl>>np;
    int xx,yy,zz,kk;
    xx=(k*l)/nl;
    yy=c*d;
    zz=p/np;
    kk=min(xx,min(yy,zz));
//    cout<<kk<<endl;
    cout<<kk/n<<endl;
} 

#include<bits/stdc++.h>
#include<vector>
using namespace std;
const int maxn =1e2+7;
vector<string>v1;
vector<string>v2;
vector<string>v3;
vector<string>::iterator it;
struct person{
    string nm;
    int g;
    int ti=0;
    int pa=0;
    int gl=0;
}w[maxn];
bool pdt(int x,int y,int z){
    int aa=x/10;int bb=x%10;int cc=y/10;
    int dd=y%10;int ee=z/10;int ff=z%10;
    if(aa==bb&&bb==cc&&cc==dd&&dd==ee&&ee==ff){
        return true; 
    }
    else{
        return false;
    }
}
bool pdp(int x,int y,int z){
    int aa=x/10;int bb=x%10;int cc=y/10;
    int dd=y%10;int ee=z/10;int ff=z%10;
    //cout<<aa<<bb<<cc<<dd<<ee<<ff<<endl; 
    if(aa>bb&&bb>cc&&cc>dd&&dd>ee&&ee>ff){
        return true;
    }
    else{
        return false;
    }
}
bool cmp1(person p,person q){
    if(p.ti==q.ti){
        return p.g<q.g;
    }
    return p.ti>q.ti;
}
bool cmp2(person p,person q){
    if(p.pa==q.pa){
        return p.g<q.g;
    }
    return p.pa>q.pa;
}
bool cmp3(person p,person q){
    if(p.gl==q.gl){
        return p.g<q.g;
    }
    return p.gl>q.gl;
}
int main(){
    int t,n;
    string name;
    cin>>t;
    for(int i=1;i<=t;i++){
        cin>>n>>name;
        w[i].nm=name;
        w[i].g=i;
        for(int j=1;j<=n;j++){
            int a,b,c;
            char d,e;
            cin>>a>>d>>b>>e>>c;
            if(pdt(a,b,c)==1){
                w[i].ti++;
                continue;
            }
            if(pdp(a,b,c)==1){
                w[i].pa++;
                continue;
            }
              w[i].gl++;
        }//cout<<w[i].nm<<" ";
    //    cout<<w[i].ti<<" "<<w[i].pa<<" "<<w[i].gl<<endl; 
    }
    sort(w+1,w+1+t,cmp1);
    for(int i=1;i<=t;i++){
        if(w[i].ti==w[1].ti){
            v1.push_back(w[i].nm);
        }
    }
    sort(w+1,w+1+t,cmp2);
    for(int i=1;i<=t;i++){
        if(w[i].pa==w[1].pa){
            v2.push_back(w[i].nm);
        }
    }
    sort(w+1,w+1+t,cmp3);
    for(int i=1;i<=t;i++){
        if(w[i].gl==w[1].gl){
            v3.push_back(w[i].nm);
        }
    }
    cout<<"If you want to call a taxi, you should call:";
    for(it=v1.begin();it!=v1.end();it++){
        if(it==v1.begin()){
            cout<<" "<<(*it);
        }
        else{
            cout<<", "<<(*it);
        }
    }
    cout<<"."<<endl;
    cout<<"If you want to order a pizza, you should call:";
    for(it=v2.begin();it!=v2.end();it++){
        if(it==v2.begin()){
            cout<<" "<<(*it);
        }
        else{
            cout<<", "<<(*it);
        }
    }
    cout<<"."<<endl;
    cout<<"If you want to go to a cafe with a wonderful girl, you should call:";
    for(it=v3.begin();it!=v3.end();it++){
        if(it==v3.begin()){
            cout<<" "<<(*it);
        }
        else{
            cout<<", "<<(*it);
        }
    }
    cout<<"."<<endl;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#define INF  1e5
using namespace std;
typedef long long LL;
const int maxn = 1000 + 100;
LL q = 0;
int solve(LL p){
    if(p == 1){
        return 0;
    }
    LL x = p,temp = 1;
    int num = 0;
    for(LL i = 2;i * i <= p;++i){
        while(x % i == 0){
            ++num;
            if(num <= 2){
                temp *= i;
                x /= i;
            }else{
                break;
            }
        }
        if(num > 2){
            break;
        }
    }
    if(x > 1){
        ++num;
    }
    if(num == 1){ 
        return 0;
    }else if(num == 2){
        return -1;
    }else{
        return temp;
    }

}
int main(){
    cin >> q;
    LL ans = solve(q);
    if(ans == -1){
        cout << "2" << endl;
    }else{
        cout << "1\n" << ans << endl;
    }
    return 0;
}