MPIMC August Challenge Problem

23766503.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+#include<algorithm>
+int main()
+{
+    int test;
+	long long int i,N,A,B,K,sum,gcd,lcm;
+	scanf("%d",&test);
+	for(i=1;i<=test;i++)
+	{   sum=0;
+	    scanf("%lld ",&N);
+	    scanf("%lld ",&A);
+	    scanf("%lld ",&B);
+	    scanf("%lld ",&K);
+	    gcd=__gcd(A,B);
+	    lcm=((A*B)/gcd);
+	    sum=(N/A)+(N/B)-2*(N/lcm);
+	    if(sum>=K)
+	       printf("Win\n");
+	    else
+	       printf("Lose\n");
+	}
+	return 0;
+}

MISSP Codechef

@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+    int A,T, N; 
+    int i,j,k;
+    cin>>T;
+    for(i=0;i<T;i++)
+    {    
+        cin>>N;
+       int f[1000001]={0};
+         for(j=0;j<N;j++)
+         {   cin>>A;
+             f[A]++;
+         }
+         for(k=0;k<1000001;k++)
+         {   
+             if(f[k]%2!=0)
+                cout<<k<<"\n"; 
+        }
+
+    }
+
+	return 0;
+}

MISSP.txt

@@ -0,0 +1,26 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+    int A,T, N; 
+    int i,j,k;
+    cin>>T;
+    for(i=0;i<T;i++)
+    {    
+        cin>>N;
+       int f[1000001]={0};
+         for(j=0;j<N;j++)
+         {   cin>>A;
+             f[A]++;
+         }
+         for(k=0;k<1000001;k++)
+         {   
+             if(f[k]%2!=0)
+                cout<<k<<"\n"; 
+        }
+
+    }
+
+	return 0;
+}
+