Merge branch 'master' of github.com:aggarwaldeepak/competitive-programming

Author: ivorynoise

AndrewAndCity-h.cpp

@@ -0,0 +1,28 @@
+#include<iostream>
+using namespace std;
+#define mod 1000000007
+
+int main(){
+	int t;
+	cin>>t;
+	while(t--){
+		int n,i;
+		long long int arr[100010],left[100010],right[100010],ans=0;
+		cin>>n;
+		for(i=0;i<n;i++)
+			cin>>arr[i];
+		left[0]=arr[0];
+		for(i=1;i<n;i++)
+			left[i]=max(left[i-1],arr[i]);
+		right[n-1]=arr[n-1];
+		for(i=n-2;i>=0;i--){
+			right[i]=max(right[i+1],arr[i]);
+		}	
+		for(i=0;i<n;i++){
+			int f=min(left[i],right[i]);
+			ans+= (f-arr[i] + mod)%mod;
+			ans%=mod;
+		}
+		cout<<ans<<"\n";
+	}
+}

CRT-h.cpp

@@ -0,0 +1,44 @@
+#include<iostream>
+using namespace std;
+
+int gcdExtended(int a, int b, int *x, int *y)
+{
+    if (a == 0)
+    {
+        *x = 0;
+        *y = 1;
+        return b;
+    }
+ 
+    int x1, y1; 
+    int gcd = gcdExtended(b%a, a, &x1, &y1);
+    *x = y1 - (b/a) * x1;
+    *y = x1;
+ 
+    return gcd;
+}
+
+int FindModInverse(int remain,int num){
+    int x,y;
+    gcdExtended(remain,num,&x,&y);
+    return x;
+}
+
+int main(){
+    int remainders[100010]={},numbers[100010]={},n;
+    long long int product=1,ans=0;
+    cin>>n;
+    for(int i=0;i<n;i++){
+        cin>>numbers[i]>>remainders[i];
+        product*=numbers[i];
+    }
+    for(int i=0;i<n;i++){
+        int invAnswer=FindModInverse(product/numbers[i],numbers[i]);
+        if(invAnswer<0)
+           invAnswer+=numbers[i];
+        // cout<<invAnswer<<" ";
+        ans+=(product/numbers[i])*remainders[i]*invAnswer;
+    }
+     cout<<ans%product;
+    return 0;
+}

MAIN74-h.cpp

@@ -0,0 +1,65 @@
+#include<iostream>
+using namespace std;
+
+#define mod 1000000007
+int size=2;
+
+
+void multiply(long long int a[][3],long long int b[][3]){
+    int i,j,k;
+    long long int ans[3][3]={};
+    for(i=0;i<size;i++){
+        for(j=0;j<size;j++){
+            for(k=0;k<size;k++){
+                ans[i][j]=(ans[i][j] + a[i][k]*b[k][j])%mod;
+                ans[i][j]=ans[i][j]%mod;
+            }
+        }
+    }
+    for(i=0;i<size;i++){
+        for(j=0;j<size;j++){
+         a[i][j]=ans[i][j];   
+        }
+    }
+    
+}
+
+void power(long long int second[][3],long long int n){
+    long long int current[3][3]={},i,j;
+    for(i=0;i<size;i++){
+        for(j=0;j<size;j++)
+            current[i][j]=second[i][j];
+    }
+    if(n<=1){
+        return;
+    }
+    if(n&1){
+         power(second,n-1);
+        multiply(second ,current);
+    }
+    else{
+        power(second,n/2);
+    multiply(second,second);
+    }
+}
+
+
+int main(){
+    int t;
+    cin>>t;
+    while(t--){
+        long long int n;
+        cin>>n;
+        if(n==0)
+            {cout<<"0\n";continue;}
+        if(n==1)
+            {cout<<"2\n";continue;}
+        else{
+            long long int myArray[3][3];
+              myArray[0][0]=1;myArray[0][1]=1;myArray[1][0]=1;myArray[1][1]=0;
+            power(myArray,n+2);
+            cout<<myArray[0][0]%mod<<"\n";
+        }
+    }
+    return 0;
+}