The software tool is a repository of files, often the files for the source code of computer programs, with monitored access. Every change made to the source is tracked, along with who made the change, why they made it, and references to problems fixed, or enhancements introduced, by the change.Software tools are essential for any form of distributed, collaborative development. Whether it is the history of a wiki page or large software development project, the ability to track each change as it was made, and to reverse changes when necessary can make all the difference between a well managed and controlled process and an uncontrolled ‘first come, first served’ system. It can also serve as a mechanism for due diligence for software projects.In this problem we'll consider a simplified model of a development project. Let's suppose, that there are N source files in the project. All the source files are distinct and numbered from 1 to N.The tool, that is used for maintaining the project, contains two sequences of source files. The first sequence contains the source files, that are ignored by the tool. If a source file is not in the first sequence, then it's considered to be unignored. The second sequence contains the source files, that are tracked by the tool. If a source file is not in the second sequence, then it's considered to be untracked. A source file can either be or not be in any of these two sequences.

 #include <stdio.h>

int main() {

int t,i;

scanf("%d",&t);

while(t--){

    int num[3];

    int f[100]={0};

    for(i=0;i<3;i++){

        scanf("%d ",&num[i]);   }

    int m=num[1], k=num[1];

    int a[m],b[k];

    for(i=0;i<num[1];i++){

        scanf("%d ",&a[i]);

        f[a[i]-1]++; }

    for(i=0;i<num[2];i++){

        scanf("%d ",&b[i]);

        f[b[i]-1]++;  }

    int tracigno=0;

    int untracinigno=0;

    for(i=0;i<num[0];i++){

        if(f[i]==0){

            untracinigno++;   }

        else if(f[i]==2){

            tracigno++;

        }  }

    printf("%d %d\n",tracigno,untracinigno);

} return 0;

    

}

Comments

Popular posts from this blog

Akash the die heart fan of AR Rahman went to the live concert happened in Bangalore with his family members.The event management firm responsible for the event arranged the seats for the audience in descending order of maximum number of tickets booked for single family.

Elavenil has a chessboard with N rows and M columns. In one step, he can choose two cells of the chessboard which share a common edge (that has not been cut yet) and cut this edge. Formally, the chessboard is split into two or more pieces if it is possible to partition its cells into two non-empty subsets S1 and S2 (S1∩S2=∅, |S1|+|S2|=NM) such that there is no pair of cells c1,c2 (c1∈S1,c2∈S2) which share a common edge that has not been cut.Elavenil does not want the board to split into two or more pieces. Compute the maximum number of steps he can perform while satisfying this condition.

Mahesh has given a two-dimensional 3*3 array starting from A [0][0]. You should add the alternate elements of the array and print its sum. It should print two different numbers the first being sum of A 0 0, A 0 2, A 1 1, A 2 0, A 2 2 and A 0 1, A 1 0, A 1 2, A 2 1.