2018ccpc_hn

A. Easy h-index

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <map>
 #include <cmath>
 #include <vector>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)
 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
 #define Close fclose(stdin),fclose(stdout)
 const int maxn = *1e5 + ;
 using namespace std;
 const int MOD = 1e9+;
 typedef long long ll;

 int a[maxn];

 int main(){
     Faster;
     int n;
     while(cin >> n){
         for(int i = ;i <= n;i++){
             cin >> a[i];
         }

         int sum = ;
         int h = n+;
         while(sum < h){
             sum += a[--h];
         }
         cout << h << endl;
     }
     return ;
 }

B. Higher h-index

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <map>
 #include <cmath>
 #include <vector>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)
 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
 #define Close fclose(stdin),fclose(stdout)
 const int maxn = *1e5 + ;
 using namespace std;
 const int MOD = 1e9+;
 typedef long long ll;

 int a[maxn];

 int main(){
     Faster;
     int n, a;
     while(cin >> n >> a){
         if(n < a)
             cout << n << endl;
         else{
             int h = a + (n-a)/;
             cout << h << endl;
         }
     }
     return ;
 }

F. Sorting

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <map>
 #include <cmath>
 #include <vector>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)
 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
 #define Close fclose(stdin),fclose(stdout)
 const int maxn = 1e3+;
 using namespace std;
 const int MOD = 1e9+;
 typedef long long ll;

 struct node
 {
     ll a,b,c;
     int id;
 }t[maxn];

 bool cmp(node x, node y){
     ll xx = x.a*y.c + x.b*y.c;
     ll yy = y.a*x.c + y.b*x.c;
     if(xx == yy)
         return x.id < y.id;
     return xx < yy;
 }

 int main(){
     Faster;
     int n;
     while(cin >> n){
         for(int i = ;i < n;i++){
             cin >> t[i].a >> t[i].b >> t[i].c;
             t[i].id = i+;
         }
         sort(t,t+n,cmp);
         for(int i = ;i < n;i++){
             if(i == )
                 cout << t[i].id;
             else
                 cout << " " << t[i].id;
         }
         cout << endl;
     }
     return ;
 }

G. String Transformation

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <map>
 #include <cmath>
 #include <vector>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)
 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
 #define Close fclose(stdin),fclose(stdout)
 const int maxn = 1e5 + ;
 using namespace std;
 const int MOD = 1e9+;
 typedef long long ll;

 int main(){
     Faster;
     string s;
     string t;
     while(cin >> s >> t){
         int sc, tc;
         sc = tc = ;
         for(char x:s){
             if(x == 'c'){
                 sc++;
             }
         }
         for(char x:t){
             if(x == 'c'){
                 tc++;
             }
         }
         if(sc != tc){
             cout << "No" << endl;
             continue;
         }
         int i, j, sa, sb, ta, tb;
         i = j = sa = sb = ta = tb = ;
         bool ok = true;
         s += "c";
         t += "c";
         while(i < s.size() && j < t.size()){
             while(s[i] != 'c' && i < s.size()){
                 if(s[i] == 'a')
                     sa++;
                 if(s[i] == 'b')
                     sb++;
                 i++;
             }
             while(t[j] != 'c' && j < t.size()){
                 if(t[j] == 'a')
                     ta++;
                 if(t[j] == 'b')
                     tb++;
                 j++;
             }
             if( sa% != ta% || sb% != tb%){
                 ok = false;
                 break;
             }
             if(s[i] == 'c'){
                 sa = sb = ;
                 i++;
             }
             if(t[j] == 'c'){
                 ta = tb = ;
                 j++;
             }
         }
         if(ok)
             cout << "Yes" << endl;
         else
             cout << "No" << endl;
     }
     return ;
 }

K. 2018

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <map>
 #include <cmath>
 #include <vector>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)
 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
 #define Close fclose(stdin),fclose(stdout)
 const int maxn = 1e4 + ;
 using namespace std;
 const int MOD = 1e9+;
 typedef long long ll;

 int main(){
     Faster;
     ll a, b, c, d;
     while(cin >> a >> b >> c >> d){
         ll sum = ;
         ll x = (b/ - (a-)/);
         ll y = (d/ - (c-)/);
         sum += x*(d-c+)+y*(b-a+)-x*y;            //减去重复的部分

         sum += (b/ - (a-)/ - x)*(d/ - (c-)/ - y);
         sum += (d/ - (c-)/ - y)*(b/ - (a-)/ - x);
         cout << sum << endl;
     }

     return ;
 }