c code to python code converter online

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>
2using namespace std;
3void main()
4{
5  for (int i=1, i<=5, i++)
6  {
7    for(int j=1, j<=i,j++)
8    {
9      printf("%c",64+j)
10    }
11    printf("\n")
12  }
13}

1#include<iostream>
2 using namespace std;
3 #include<bits/stdc++.h>
4 int has1[26],has2[26];
5  int main()
6   {
7    int n;
8      cin>>n;
9        char ff[n+10],ss[n+10];
10          for(int i=0;i<n/2;i++)
11          {
12              cin>>ff[i];
13               has1[ff[i]-'a']++;
14          }
15            for(int i=0;i<n/2;i++)
16            {
17
18                  cin>>ss[i];
19                  has2[ss[i]-'a']++;
20            }
21            sort(ff,ff+n/2);
22              sort(ss,ss+n/2);
23              //case 1
24               int ans1=0,ans2=0,ans3=0;
25              for(int i=0;i<26;i++)
26              {
27                  ans1+=abs(has1[i]-has2[i]);
28                //    cout<<"i " <<i<<" " <<has1[i]<<" " <<has2[i]<<endl;
29
30              }
31              int i=0,j=0;
32               while(i!=n/2  && j!=n/2)
33               {
34                   if(ff[i]<ss[j])
35                   {
36
37                        i++;
38                         j++;
39                   }
40                   else
41                    j++;
42
43               }
44               ans2=abs(j-i);
45
46
47               i=0,j=0;
48               while(i!=n/2  && j!=n/2)
49               {
50                   if(ss[i]<ff[j])
51                   {
52
53                        i++;
54                         j++;
55                   }
56                   else
57                    j++;
58
59               }
60
61            ans3=abs(j-i);
62             // cout<<ans1<<" "<<ans2<<" "<<ans3<<endl;
63            cout<<min(min(ans1/2,ans2),ans3);
64        return 0;
65      }
66

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