c to python code converter

1import sys
2
3def mergesort_2ndstep(l, r):
4	len_l = len(l)
5	len_r = len(r)
6	# initializing a list of length zero
7	sorted_array = []
8	i,j = 0,0
9	while i < len_l:
10		num1 = l[i]
11		for x in range(j,len_r):
12			num2 = r[x]
13			if num2 < num1 :
14				sorted_array.append(num2)
15				j += 1
16		
17		sorted_array.append(num1)
18		i += 1
19
20	if len(sorted_array) != len_l + len_r:
21		# Checking extreme conditions
22		sorted_array[i+j:] = r[j:]
23	return sorted_array
24
25
26def mergesort_1ststep(L,start,stop):
27	# a list can be divided into two 
28	# if length of list is atleast two
29	if stop - start > 1:
30		l = mergesort_1ststep(L,start,start + (stop-start)//2)
31		r = mergesort_1ststep(L,start + (stop-start)//2,stop)
32		# mergeing two lists(sorting the l and r parts)
33		L[start:stop] = mergesort_2ndstep(l,r)
34	return L[start:stop]
35
36# START
37List_of_nums = []
38file_to_open = "input1.txt"
39
40try:
41	read_file = open(file_to_open,"r")
42	write_file = open("sameeraz.txt","w")
43	if read_file != None:
44		# appending every num from file to list_of_nums
45		for line in read_file:
46			line = int(line)
47			List_of_nums.append(line)
48		# applying mergesort
49		mergesort_1ststep(List_of_nums,0, len(List_of_nums))
50		# writing to an output file
51		# excluding the last element 
52		k = List_of_nums.pop()
53		for num in List_of_nums:
54			write_file.write(f"{num}\n")
55		# writing last element without next line
56		write_file.write(f"{k}")
57	
58		read_file.close()
59		write_file.close()
60except:
61	print("file not found")

1#include<iostream>
2// Defining MAX size to 10
3#define MAX 10
4
5using namespace std;
6
7typedef struct Edge
8{
9  int source;
10  int destination;
11  int weight;
12}Edge;
13
14void bellman_ford_algo(int nodevertex,Edge edge[],int source_graph,int nodeedge)
15{
16  int u,v,weight,i,j=0;
17  int distance[MAX];
18
19  for(i=0;i<nodevertex;i++)
20  {
21    distance[i]=999;
22  }
23
24  // distance of source vertex
25  distance[source_graph]=0;
26
27  // free all the edges nodevertex - 1 times
28  for(i=0;i<nodevertex-1;i++)
29  {
30    for(j=0;j<nodeedge;j++)
31    {
32      u=edge[j].source;
33      v=edge[j].destination;
34      weight=edge[j].weight;
35
36
37      if(distance[u]!=999 && distance[u]+weight < distance[v])
38      {
39        distance[v]=distance[u]+weight;
40      }
41    }
42
43  }
44
45  // checking for negative cycle
46  for(j=0;j<nodeedge;j++)
47  {
48    u=edge[j].source;
49    v=edge[j].destination;
50    weight=edge[j].weight;
51
52    if(distance[u]+weight < distance[v])
53    {
54      cout<<"\n\nNegative Cycle present..!!\n";
55      return;
56    }
57  }
58
59  cout<<"\nVertex"<<"  Distance from source";
60  for(i=1;i<=nodevertex;i++)
61  {
62    cout<<"\n"<<i<<"\t"<<distance[i];
63  }
64
65}
66
67
68int main()
69{
70  int nodevertex,nodeedge,source_graph;
71  Edge edge[MAX];
72
73  cout<<"Enter the number of vertices you want : ";
74  cin>>nodevertex;
75
76
77  printf("Enter the source vertex of the graph: ");
78  cin>>source_graph;
79
80  cout<<"\nEnter no. of edges you want : ";
81  cin>>nodeedge;
82
83  for(int i=0;i<nodeedge;i++)
84  {
85    cout<<"\nEdge Number "<<i+1<<"=";
86    cout<<"\nEnter source vertex here :";
87    cin>>edge[i].source;
88    cout<<"Enter destination vertex here:";
89    cin>>edge[i].destination;
90    cout<<"Enter weight here :";
91    cin>>edge[i].weight;
92  }
93
94  bellman_ford_algo(nodevertex,edge,source_graph,nodeedge);
95
96  return 0;
97}

1#include <stdio.h>
2 
3int main()
4{
5
6	char name [20] = "Lakshmisprasad";
7	char email [40]="lakshmiprasad018@gmail.com";
8	char slack[10]="@lakshmip";
9	char twitter[20]="Lakshmip2798";
10	char biostack [20]="Functional Genomics";
11
12	printf("name:%s\nemail:%s\ntwitter:%s\nbiostack:%s\nslack:%s\n",name,email,twitter,biostack, slack	);
13	return 0;
14}
15 
16

1#include <stdio.h>
2
3
4int main()
5{
6    int n,np=0,i,j,flag=0;
7    scanf("%d",&n);
8        for(i=2;i<=n;i++)
9            {
10                for(j=1,flag=0;j<=i;j++)
11                {
12                 if(i%j==0)
13                 flag++;
14                }
15
16        if(flag==2)
17            np++;
18            }
19
20int total=n-2+1;
21
22 for(i=total/2;i>=1;i--)
23if(total%i==0&&np%i==0)
24   {
25       total/=i;
26        np/=i;
27   }
28   printf("%d/%d",np,total);
29    return 0;
30}

1def main():
2  # 4 x 4 csr matrix
3  #    [1, 0, 0, 0],
4  #    [2, 0, 3, 0],
5  #    [0, 0, 0, 0],
6  #    [0, 4, 0, 0],
7  csr_values = [2, 3, 1, 4,5]
8  col_idx    = [1, 2, 0, 1,1]
9  row_ptr    = [0, 2, 4,5]
10  csr_matrix = [
11      csr_values,
12      col_idx,
13      row_ptr
14      ]
15
16  dense_matrix = [
17      [0, 3, 0],
18      [1, 4, 5],
19      [2, 0, 0],
20      ]
21
22  res = [
23      [0, 0, 0],
24      [0, 0, 0],
25      [0, 0, 0],
26      ]
27
28  # matrix order, assumes both matrices are square
29  n = len(dense_matrix)
30
31  # res = dense X csr
32  csr_row = 0 # Current row in CSR matrix
33  for i in range(n):
34    start, end = row_ptr[i], row_ptr[i + 1]
35    for j in range(start, end):
36      col, csr_value = col_idx[j], csr_values[j]
37      for k in range(n):
38        dense_value = dense_matrix[k][csr_row]
39        res[k][col] += csr_value * dense_value
40    csr_row += 1
41
42  print(res) 
43
44
45if __name__ == '__main__':
46  main()
47

1np.linspace(0,1,11)