1 solutions

  • 0
    @ 2025-11-5 15:12:12

    C :

    #include <stdio.h>
    int main()
    {
        int a;
        float b;
        while(scanf("%d",&a) != EOF)
     {if (a==1) 
       {
       printf("Y\\X| 0 1 2 3 4| p{Y=j}\n");
        printf("0| 0 0 1/21 4/63 1/126| 5/42\n");
        printf("1| 0 2/21 2/7 2/21 0| 10/21\n");
        printf("2| 1/42 4/21 1/7 0 0| 5/14\n");
        printf("3| 1/63 2/63 0 0 0| 1/21\n");
       printf("p{X=i}| 5/126 20/63 10/21 10/63 1/126| 1");
     }
     else 
     {b=1;    
       printf("%d\n",b);}
     }
        return 0;
    }
    

    C++ :

    #include <iostream>
    #include <string>
    
    using namespace std;
    
    int main()
    {
    	string b[5][6] =
    			{
    				"0","0","1/21","4/63","1/126","5/42",
    				"0","2/21","2/7","2/21","0","10/21",
    				"1/42","4/21","1/7","0","0","5/14",
    				"1/63","2/63","0","0","0","1/21",
    				"5/126","20/63","10/21","10/63","1/126","1"
    			};
        int a;
    	while(scanf("%d",&a) != EOF)
    	{
    		if(a==1)
    		{
    			cout<<"Y\\X| 0 1 2 3 4| p{Y=j}"<<endl;
              int i;
    			for(i=0 ;i<4;i++)
    				cout<<i<<"| "<<b[i][0]<<" "<<b[i][1]<<" "<<b[i][2]<<" "<<b[i][3]<<" "<<b[i][4]<<"| "<<b[i][5]<<endl;
    			cout<<"p{X=i}"<<"| "<<b[i][0]<<" "<<b[i][1]<<" "<<b[i][2]<<" "<<b[i][3]<<" "<<b[i][4]<<"| "<<b[i][5]<<endl;
    		}
    		else if(a==0)
    		{
    			cout<<1<<endl;
    		}
    	}
    	return 0;
    }
    

    Java :

    
    import java.util.*;
    public class Main {
    	public static void main(String args[]) {
    		Scanner cin = new Scanner(System.in);
    		int a;
    		int b;
    		 
    		while (cin.hasNext()) {
    			a = cin.nextInt(); 
    			if (a==1){
    				
    			int	c=1;
    			int	d=2;
    			int	e=4;
    			int	f=7;
    			int	g=21;
    			int	h=42;
    			int	i=63;
    			int	j=126;
    			int c1=5;
    			int c2=10;
    			int c3=14;
    			int c4=20;
    				System.out.printf("Y\\X| 0 1 2 3 4| p{Y=j}\n0| 0 0 "+c+"/"+g+" "+e+"/"+i+" "+c+"/"+j+"| "+c1+"/"+h+"\n1| 0"+" "+d+"/"+g+" "+d+"/"+f+" "+d+"/"+g+" 0| "+c2+"/"+g+"\n2| "+c+"/"+h+" "+e+"/"+g+" "+c+"/"+f +" 0 0| "+c1+"/"+c3+"\n3| "+c+"/"+i+" "+d+"/"+i+" 0 0 0| "+c+"/"+g+"\np{X=i}| "+c1+"/"+j+" "+c4+"/"+i+" "+c2+"/"+g+" "+c2+"/"+i+" "+c+"/"+j+"| 1\n");
      
       
    }
    else if (a==0){
      b=1; 
    System.out.printf("%d", b);}
    }
    		}
    	}
    
    					
    
    • 1

    Information

    ID
    16510
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By