DONE

Author: kumar80

.vscode/settings.json

@@ -1,5 +1,6 @@
 {
     "files.associations": {
         "iostream": "cpp"
-    }
+    },
+    "competitive-programming-helper.firstTime": false
 }

1323B.cpp

@@ -0,0 +1,50 @@
+//https://codeforces.com/contest/1323/problem/B
+#include<bits/stdc++.h>
+using namespace std;
+ 
+#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
+#define LL long long 
+#define mod 998244353 
+#define FOR(i, j, k) for (int i=j ; i<k ; i++)
+#define ROF(i, j, k) for (int i=j ; i>=k ; i--) 
+ 
+const long long INF = 1e18;
+const long long MAX = 1e5+10;
+
+int main()//https://codeforces.com/contest/1323/problem/B
+{
+    fastio;
+    int n,m,k; cin>>n>>m>>k;
+    LL a[n],b[m],r[n+1]={0},c[m+1]={0};
+    FOR(i,0,n) cin>>a[i]; 
+    FOR(i,0,m) cin>>b[i];
+    int i=0;
+    while(i<n){
+        int j=i;
+        while(j<n && a[j]==1) j++;
+        int len = j-i;
+        FOR(k,1,j-i+1){
+            r[k]+=len;
+            len--;
+        }
+        i=j+1;
+    }i=0;
+    while(i<m){
+        int j=i;
+        while(j<m && b[j]==1) j++;
+          int len = j-i;
+        FOR(k,1,j-i+1){
+            c[k]+=len;
+            len--;
+        }
+        i=j+1;
+    }LL ans = 0;
+
+    FOR(i,1,n+1){
+        if(k%i==0 && k/i<=m){
+            ans+= r[i]*c[k/i];
+        }
+    }
+//https://codeforces.com/contest/1323/problem/B
+    cout<<ans;
+}

1323B.cpp.tcs

@@ -0,0 +1 @@
+[{"input":"3 3 2\n1 0 1\n1 1 1","output":"4"},{"input":"3 5 4\n1 1 1\n1 1 1 1 1","output":"14"}]

1327C.cpp

@@ -14,16 +14,23 @@ int main(){
     fastio;
     int n,m,k; cin>>n>>m>>k;
     vector<pair<int,int>>s;
-    vector<vector<int>>v(k+1,vector<int>(2,0));
     FOR(i,0,k){
         int x,y; cin>>x>>y;
         s.push_back({x,y});
     }
-    FOR(i,0,k){
-        int x,y; cin>>x>>y;
-         v[i][0]+=x-s[i].first;
-         v[i][1]+=y-s[i].second;
+      string p="";
+    p.append(n-1,'L'); p.append(m-1,'U');
+    p.append(m-1,'R');
+    FOR(i,1,n){    
+        if(i&1){
+           p+='D';
+           p.append(m-1,'L');
+        }
+        else{
+            p+='D';
+            p.append(m-1,'R');
+        }
     }
-    string p="";
+    cout<<p; 
 
 }

1328A.cpp

@@ -0,0 +1,22 @@
+//https://codeforces.com/contest/1328/problem/A
+    #include<bits/stdc++.h>
+    using namespace std;
+     
+    #define fastio ios_base::sync_with_stdio(0); cin.tie(0)
+    #define LL long long 
+    #define mod 998244353 
+    #define FOR(i, j, k) for (int i=j ; i<k ; i++)
+    #define ROF(i, j, k) for (int i=j ; i>=k ; i--) 
+     
+    const long long INF = 1e18;
+    const long long MAX = 1e5+10;
+    
+    int main(){
+        fastio;
+        int t; cin>>t;
+        while(t--){
+            int a,b; cin>>a>>b;
+            if(a%b==0) cout<<0<<"\n";
+            else    cout<<b-a%b<<"\n";
+        }
+    }

1328A.cpp.tcs

@@ -0,0 +1 @@
+[{"input":"5\n10 4\n13 9\n100 13\n123 456\n92 46","output":"2\n5\n4\n333\n0"}]

1328B.cpp

@@ -0,0 +1,35 @@
+//https://codeforces.com/contest/1328/problem/B
+#include<bits/stdc++.h>
+using namespace std;
+ 
+#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
+#define LL long long 
+#define mod 998244353 
+#define FOR(i, j, k) for (int i=j ; i<k ; i++)
+#define ROF(i, j, k) for (int i=j ; i>=k ; i--) 
+ 
+const long long INF = 1e18;
+const long long MAX = 1e5+10;
+
+int main(){
+    fastio;
+    int t; cin>>t;
+    while(t--){
+        int n,k; cin>>n>>k;
+        string s;
+        FOR(i,0,n) s+='a';
+        int i=1;
+        while(i<n){
+        
+            if(i<=k) k-=i;
+            else break;
+            i++;
+        }
+
+        if(k!=0) i++;
+        else k=i-1;
+        s[n-i]='b';
+        s[n-k]='b';
+        cout<<s<<"\n";        
+    }
+}   

1328B.cpp.tcs

@@ -0,0 +1 @@
+[{"input":"7\n5 1\n5 2\n5 8\n5 10\n3 1\n3 2\n20 100","output":"aaabb\naabab\nbaaba\nbbaaa\nabb\nbab\naaaaabaaaaabaaaaaaaa"}]

1328C.cpp

@@ -0,0 +1,47 @@
+//https://codeforces.com/contest/1328/problem/C
+#include<bits/stdc++.h>
+using namespace std;
+ 
+#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
+#define LL long long 
+#define mod 998244353 
+#define FOR(i, j, k) for (int i=j ; i<k ; i++)
+#define ROF(i, j, k) for (int i=j ; i>=k ; i--) 
+ 
+const long long INF = 1e18;
+const long long MAX = 1e5+10;
+
+int main(){
+    fastio;
+    int t; cin>>t;
+    while (t--)
+    {
+        int n; string s; cin>>n; cin>>s;
+        int m = 1; string s1="1",s2="1"; 
+        for(int i=1;i<n;i++){
+            if(s[i]=='0'){
+                    s1+='0';
+                    s2+='0';
+            }
+            if(s[i]=='1'){   
+                if(m==1) {
+                    m=0;s1+='1';s2+='0';
+                    }
+                else {
+                    s1+='0';s2+='1';
+                 }
+            }
+            if(s[i]=='2'){
+                if(m==1){
+                    s1+='1';
+                    s2+='1';
+                }else {
+                    s1+='0';s2+='2';
+                }
+            }
+        }
+    
+        cout<<s1<<"\n"<<s2<<"\n";
+    }
+
+}

1328C.cpp.tcs

@@ -0,0 +1 @@
+[{"input":"4\n5\n22222\n5\n21211\n1\n2\n9\n220222021","output":"11111\n11111\n11000\n10211\n1\n1\n110111011\n110111010"}]