#61 from priyanshisharma/master

Author: codewithdev

ONLINE JUDGE/CodeChef Challenges/FFL_LTIME83B.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	int T,N,S,minz,mino;
+	cin>>T;
+	
+	while(T--)
+	{
+	    minz=100;
+	    mino=100;
+	    cin>>N>>S;
+	    int A1[N],A2[N];
+	    for(int i=0;i<N;++i)
+	        cin>>A1[i];
+	   for(int i=0;i<N;++i)
+	        cin>>A2[i];
+	   for(int i=0;i<N;i++)
+	   {
+	       if(A2[i]==0)
+	       {
+	           minz=minz<A1[i]?minz:A1[i];
+	       }
+	       if(A2[i]==1)
+	       {
+	           mino=mino<A1[i]?mino:A1[i];
+	       }
+	   }
+	   if((S+minz+mino)<=100)
+	        cout<<"yes"<<endl;
+	   else
+	    cout<<"no"<<endl;
+	}
+	return 0;
+}

ONLINE JUDGE/CodeChef Challenges/LECANDY.cpp

@@ -0,0 +1,30 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	int T;
+	cin>>T;
+	int i;
+	for(i=0;i<T;++i)
+	{
+	    int N ;
+	    long C;
+	    cin>>N>>C;
+	    long sum=0;
+	    int j,k;
+	    for(j=0;j<N;++j)
+	    {
+	        int k;
+	        cin>>k;
+	        sum+=k;
+	        //cout<<endl<<k<<' '<<sum<<endl;
+	    }
+	    if(sum<=C)
+	    {
+	        cout<<"Yes"<<endl;
+	    }
+	    else
+	    cout<<"No"<<endl;
+	}
+	return 0;
+}

ONLINE JUDGE/CodeChef Challenges/PMLU_DEC19B.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int t,i,j , tc,n, arr[40000],ctr=0;
+    cin>>tc;
+    for(t=0;t<tc;++t)
+    {
+        cin>>n;
+        for(i=0;i<n;++i)
+        {
+            cin>>arr[i];
+        }
+        for(i=0;i<n;++i)
+        {
+            for(j=i+1;j<n;++j)
+            {
+                if((arr[i]+arr[j])==(arr[i]*arr[j]))
+                {
+                    ctr++;
+                    //cout<<endl<<i<<"\t"<<j<<"\t"<<ctr<<endl;
+                }
+            }
+        }
+        cout<<ctr<<endl;
+        ctr=0;
+        
+    }
+    return 0;
+}

ONLINE JUDGE/CodeChef Challenges/WATSCORE_DEC19B.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int t,i , tc,n,s[8]={0,0,0,0,0,0,0,0},p[1000],sc[1000],sum;
+    cin>>tc;
+    for(t=0;t<tc;++t)
+    {
+        cin>>n;
+        for(i=0;i<n;++i)
+        {
+            cin>>p[i]>>sc[i];
+            if((sc[i]>s[p[i]-1])&&p[i]<9&&p[i]>0)
+            {
+                s[p[i]-1]=sc[i];
+            }
+        }
+        sum=0;
+        for(i=0;i<8;++i)
+        {
+            sum+=s[i];
+            s[i]=0;
+        }
+        cout<<sum<<endl;
+        
+    }
+    return 0;
+}