Codeforces Round #511 (Div. 2)

Codeforces Round #511 (Div. 2)

 #include <bits/stdc++.h>
 
 using namespace std;
 
 int n;
 
 int main()
 {
     cin>>n;
     )%) cout<<<<endl;
     <<endl;
 }

A. Little C Loves 3 I

 #include <bits/stdc++.h>
 
 using namespace std;
 
 int n;
 
 int main() {
     cin>>n;
     ;
     int a,b;
     ; i<=n; ++i) {
         cin>>a>>b;
         ans=max(ans,a+b);
     }
     cout<<ans<<endl;
 }

B - Cover Points

 #include <bits/stdc++.h>
 
 using namespace std;
 
 ;
 ;
 
 int n,g;
 int a[maxn];
 int cnt[N];
 int vis[N];
 
 int main() {
     std::ios::sync_with_stdio(false);
     cin.tie(NULL);
     while(cin>>n) {
         ; i<=n; ++i) {
             cin>>a[i];
             ) g=a[i];
             g=__gcd(g,a[i]);
         }
         memset(cnt,,sizeof(cnt));
         memset(vis,,sizeof(vis));
         ; i<=n; ++i) {
             ++cnt[a[i]/g];
         }
         ;
         ; i<=N; ++i) {
             ) {
                 ;
                 for(int j=i; j<N; j+=i) {
                     res+=cnt[j];
                     vis[j]=;
                 }
                 ans=max(ans,res);
             }
         }
         if(ans)
             cout<<n-ans<<endl;
         else cout<<"-1"<<endl;
     }
 }

C - Enlarge GCD

 #include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<map>
 #define lson i<<1
 #define rson i<<1|1
 #define LS l,mid,lson
 #define RS mid+1,r,rson
 #define mem(a,x) memset(a,x,sizeof(a))
 #define gcd(a,b) __gcd(a,b)
 #define ll long long
 #define ull unsigned long long
 #define lowbit(x) (x&-x)
 #define pb(x) push_back(x)
 #define enld endl
 #define mian main
 #define itn int
 #define prinft printf
 #pragma GCC optimize(2)
 //#pragma comment(linker, "/STACK:102400000,102400000")
 
 const double PI = acos (-1.0);
 const int INF = 0x3f3f3f3f;
 ;
 ;
 ;
 ;
 
 using namespace std;
 
 ll n,m;
 
 int main() {
     //std::ios::sync_with_stdio(false);
     //cin.tie(NULL);
 
     while(cin>>n>>m) {
         if(n>m) swap(n,m);
         ==) {
             n=n/;
             ) cout<<<<endl;
             ) cout<<n*<<endl;
             &&m!=) cout<<n**m<<endl;
             ) cout<<*n<<endl;
         } ) {
             n=n/-;
             ) cout<<<<endl;
             ) cout<<n*+<<endl;
             ==) cout<<n**m+*m<<endl;
             ) cout<<n**m+*m-<<endl;
             *n+<<endl;
         } ) {
             //if(m%6==0) cout<<m<<endl;
             <=) cout<<m/*<<endl;
             *+(m%)%*<<endl;
         }
     }
 }

D - Little C Loves 3 II