Solve Equations-001

-

 

C Code:

#include<stdio.h>
#include <stdlib.h>

int main()
{
    int a1,b1,c1,a2,b2,c2,temp,a,b,x,y,z;
    char x1,y1,x2,y2;
    scanf("%d%c%d%c=%d",&a1,&x1,&b1,&y1,&c1);
    scanf("%d%c%d%c=%d",&a2,&x2,&b2,&y2,&c2);
    if(x1!='x'&& x1!='X')
    {
        temp=a1;
        a1=b1;
        b1=temp;
    }
    if(x2!='x'&&x2!='X')
    {
        temp=a2;
        a2=b2;
        b2=temp;
    }
 
    a=((c1*b2)-(b1*c2))/((a1*b2)-(b1*a2));
    b=((a1*c2)-(c1*a2))/((a1*b2)-(b1*a2));
        printf("%d %d",a,b);
    
}

 


Comments

Post a Comment

Popular posts from this blog

Fisherman's Mantra

-
Image
  C Code: #include<stdio.h> #include <stdlib.h> int main() { int f,n,i; scanf("%d %d",&f,&n); for(i=1;i<=n;i++) f*=2; printf("%d",f); } Java code:  import java.util.*; public class Hello {     public static void main(String[] args) {         int f,n,i;         Scanner s=new Scanner(System.in);         f=s.nextInt();         n=s.nextInt();         for(i=0;i<n;i++)         f*=2;         System.out.print(f);     } }
Read more

First & Last X Digits

-
Java code: import java.util.*; public class Hello {     public static void main(String[] args) {         //Your Code Here Scanner s=new Scanner(System.in); String st; int x,l,m=0,f=0; st=s.next(); char ch[]=st.toCharArray(); x=s.nextInt(); l=ch.length-x; for(int i=0;i<ch.length;i++) {     if(ch[i]!='0'||f==1)     {         if(m<x)         {             f=1;             System.out.print(ch[i]);             m++;         }     } } System.out.println(); for(int i=l;i<ch.length;i++) System.out.print(ch[i]);     } }
Read more

N Integers – Sum S – All Combinations(Weekly Test)

-
A number S is passed as input. Also N positive unique integers are passed as input to the program. One or more numbers (out of these N integers) can be added to form the number S. Several such combinations are possible and the program must print the count C of such combinations. You need to optimize the code so that it executes within the given time (failing which Time exceeded Error will be obtained). Input Format: The first line will contain S and N separated by a space. The second line will contain the value of N positive integers, with the values separated by a space. Output Format: The first line will contain the the count C Boundary Conditions: 1 <= S <= 99999 2 <= N <= 50 Example Input/Output 1: Input: 10 5 1 2 3 4 5 Output: 3 Explanation: The three combinations which add up to 10 are 1 4 5 2 3 5 1 2 3 4  Code: #include<stdio.h> #include<string.h> short int subset[999][999],cnt=0; void print(int a[...
Read more