first commit

Author: oeddyo

cf/107/WinOrFreeze.cpp

@@ -0,0 +1,83 @@
+#include <iostream>
+#include <cmath>
+#define MAXN 3200000
+using namespace std;
+long long int q;
+
+int prime[MAXN];
+int dp[MAXN];
+void Prime(){
+    int i, j;
+        for (i=0; i<MAXN; i++) prime[i] = 1;
+            prime[0] = prime[1] = 0;
+            for (i=2; i<MAXN; i++)
+            {
+                if (!prime[i]) continue;
+                for (j=i*2; j<MAXN; j+=i) prime[j] = 0;
+            }
+}
+long long int first_move = -1;
+
+int get_v(long long int value){
+    if(value<MAXN){
+        if(dp[value]!=-1){
+            return dp[value];
+        }
+        if(prime[value]==1){
+            dp[value]=1;
+            return 1;
+        }
+    }
+    int b = (int)sqrt(value)+1;
+    int ok=0;
+    for(int i=2; i<=b; i++){
+        if(value%i==0){
+            ok=1;
+            int t = get_v(i);
+            int t2 = get_v(value/i);
+            if(t==0 || t2==0){
+                if(value<MAXN)dp[value] = 1;
+                if(first_move==-1){
+                    if(t==0){
+                        first_move = i;
+                        //cout<<"first movie is i "<<i<<endl;
+                    }
+                    if(t2==0){
+                        //cout<<"first movie is value/ i "<<value/i<<endl;
+                        first_move = value/i;
+                    }
+                }
+                return 1;
+            }
+        }
+    }
+    if(ok==0){
+        return 1;
+    }
+    if(value<MAXN)
+        dp[value]=0;
+    return 0;
+}
+
+
+int main(){
+    for(int i=0; i<MAXN;i++){
+    	dp[i]=-1;
+	}
+    cin>>q;
+    Prime();
+    prime[1]=1;
+    int ans = get_v(q);
+    if(ans==1){
+        cout<<1<<endl;
+        if(first_move!=-1){
+            cout<<first_move<<endl;
+        }else{
+            cout<<0<<endl;
+        }
+    }
+    else{
+        cout<<2<<endl;
+    }
+    return 0;
+}

cf/107/a.out

@@ -0,0 +1,118 @@
+#include <iostream>
+#include <stdio.h>
+#include <string>
+#define MAX_SIZE 400
+using namespace std;
+
+int n;
+int n_phonenumber;
+string friends[MAX_SIZE];
+string phone_number;
+
+int girls[MAX_SIZE];
+int pizza[MAX_SIZE];
+int taxi[MAX_SIZE];
+
+int judge(string phone){
+    string t = "";
+    for(int i=0; i<phone.size();i++){
+        if(phone[i]<='9' && phone[i]>='0'){
+            t+=phone[i];
+        }
+    }
+    if(t.size()==6){
+        int eq = 1;
+        for(int i=1; i<6; i++){
+            if(t[i]!=t[i-1]){
+                eq = 0;
+                break;
+            }
+        }
+        if(eq==1){
+            return 1;
+        }
+        
+        int sm = 1;
+        for(int i=1; i<6; i++){
+            if(t[i]<t[i-1]){
+                continue;
+            }else{
+                sm = 0;
+            }
+        }
+        if(sm==1){
+            return 2;
+        }
+    }
+    return 3;
+}
+
+
+int main(){
+    for(int i=0; i<MAX_SIZE; i++){
+        taxi[i]=0;
+        pizza[i]=0;
+        girls[i]=0;
+    }
+    cin>>n;
+    int max_taxi=-1, max_girl=-1, max_pizza = -1;
+    for(int i=0; i<n; i++){
+        cin>>n_phonenumber>>friends[i]; 
+        for(int j = 0; j<n_phonenumber; j++){
+            cin>>phone_number;
+            int t = judge(phone_number);
+            if(t==1){
+                taxi[i]++;
+            }else if(t==2){
+                pizza[i]++;
+            }else{
+                girls[i]++;
+            }
+        }
+        if(taxi[i]>max_taxi){
+            max_taxi = taxi[i];
+        }
+        if(pizza[i]> max_pizza){
+            max_pizza = pizza[i];
+        }
+        if(girls[i] > max_girl){
+            max_girl = girls[i];
+        }
+    }
+    int there_are = 0;
+    cout<<"If you want to call a taxi, you should call:";
+    for(int i=0; i<n; i++){
+        if(taxi[i]==max_taxi){
+            if(there_are){
+                cout<<",";
+            }
+            there_are = 1;
+            cout<<" "<<friends[i];
+        }
+    }cout<<"."<<endl;
+
+    there_are = 0;
+    cout<<"If you want to order a pizza, you should call:";
+    for(int i=0; i<n; i++){
+        if(pizza[i]==max_pizza){
+            if(there_are){
+                cout<<",";
+            }
+            there_are = 1;
+            cout<<" "<<friends[i];
+        }
+    }cout<<"."<<endl;
+
+    there_are = 0;
+    cout<<"If you want to go to a cafe with a wonderful girl, you should call:";
+    for(int i=0; i<n; i++){
+        if(girls[i]==max_girl){
+            if(there_are){
+                cout<<",";
+            }
+            there_are = 1;
+            cout<<" "<<friends[i];
+        }
+    }cout<<"."<<endl;
+    return 0;
+}

cf/107/phonenumber.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+int min(int a,int b){
+    return a<b?a:b;
+}
+
+int main(){
+    int n,k,l,c,d,p,nl,np;
+    cin>>n>>k>>l>>c>>d>>p>>nl>>np;
+    int drink = k*l/nl;
+    int lime = c*d;
+    int salt = p/np;
+    int toast = drink;
+    toast = min(toast, lime);
+    toast = min(toast, salt);
+    cout<<toast/n<<endl;
+    return 0;
+}
+

cf/107/softdrink.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+
+#define MAX_SIZE 200
+using namespace std;
+int n,m;
+int data[MAX_SIZE][MAX_SIZE];
+
+int get_max(int sub){
+    int t_max = -99999999;
+    for(int i=0; i<n; i++){
+        if(data[i][sub]>t_max){
+            t_max = data[i][sub];
+        }
+    }
+    return t_max;
+}
+
+
+void work(){
+    int stu=0;
+    for(int i=0; i<n; i++){
+        for(int j=0; j<m; j++){
+            //cout<<j<<" "<<get_max(j)<<endl;
+            if(get_max(j)==data[i][j]){
+                stu+=1;
+                break;
+            }
+        }
+    }
+    cout<<stu<<endl;
+
+}
+
+
+int main(){
+    cin>>n>>m;
+    for(int i=0; i<n; i++){
+        for(int j=0; j<m ;j++){
+            char c;
+            //scanf("%c",&c);
+            cin>>c;
+            data[i][j] = c-'0';
+            //cout<<data[i][j];
+        }
+        //cout<<endl;
+    }
+    work();
+
+
+
+    return 0;
+}
+

cf/108/Marks.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+
+#define MAX_SIZE 200
+using namespace std;
+
+char data[MAX_SIZE][MAX_SIZE];
+int n,m;
+void work(){
+    long long int sum=1;
+    for(int j=0; j<m; j++){
+        int tmp[MAX_SIZE];
+        for(int k =0; k<MAX_SIZE; k++)tmp[k]=0;
+        int num=0;
+        for(int i=0; i<n; i++){
+            if(tmp[data[i][j] -'A']==0){
+                tmp[data[i][j] - 'A']=1;
+                num++;
+            }else{
+                continue;
+            }
+        }
+        sum = sum*num % 1000000007;
+    }
+    cout<<sum<<endl;
+}
+
+
+int main(){
+    cin>>n>>m;
+    for(int i=0; i<n; i++){
+        for(int j=0; j<m ;j++){
+            char c;
+            cin>>c;
+            data[i][j] = c;
+        }
+    }
+    work();
+
+
+
+    return 0;
+}
+

cf/108/PocketBook.cpp

@@ -0,0 +1,68 @@
+#include <iostream>
+
+#define MAX_SIZE 20000
+#define INF 99999999999
+using namespace std;
+long long int n,m,k;
+long long int init_x, init_y;
+
+long long int data[MAX_SIZE][2];
+
+void work(){
+    long long int steps = 0;
+    long long int cur_x=init_x, cur_y=init_y;
+    long long int t1,t2,t;
+    for(int i=0; i<k; i++){
+        t1 = t2 = INF;
+        long long int d_x = data[i][0];
+        long long int d_y = data[i][1];
+        if(d_x==0 && d_y!=0){
+            if(d_y>0){
+                t2 = (m-cur_y)/d_y;
+            }else{
+                t2 = (1-cur_y)/d_y;
+            }
+        }else if(d_x!=0 && d_y==0){
+            if(d_x>0){
+                t1 = (n-cur_x)/d_x;
+            }else{
+                t1 = (1-cur_x)/d_x;
+            }
+        }else if(d_x>0&&d_y>0){
+            t1 = (n-cur_x)/d_x;
+            t2 = (m-cur_y)/d_y;
+        }
+        else if(d_x>0&&d_y<0){
+            t1 = (n-cur_x)/d_x;
+            t2 = (1-cur_y)/d_y;
+        }
+        else if(d_x<0&&d_y>0){
+            t1 = (1-cur_x)/d_x;
+            t2 = (m-cur_y)/d_y;
+        }
+        else if(d_x<0&&d_y<0){
+            t1 = (1-cur_x)/d_x;
+            t2 = (1-cur_y)/d_y;
+        }
+        
+        t = min(t1,t2);
+        steps+=t;
+        cur_x = cur_x+t*d_x;
+        cur_y = cur_y+t*d_y;
+    }
+    cout<<steps<<endl;
+}
+
+
+int main(){
+    cin>>n>>m;
+    cin>>init_x>>init_y;
+    cin>>k;
+    for(int i=0; i<k; i++){
+        cin>>data[i][0]>>data[i][1];
+    }
+    work();
+    
+    return 0;
+}
+