python to c 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}

1import math
2x,y=input().split(),input().split()
3x,y=[int(i) for i in x],[int(i) for i in y]
4t,t1=abs(x[0]-y[0]),abs(x[1]-y[1])
5
6print("%.2f" %math.sqrt(t*t+t1*t1))

1def ReadMatrix():
2    matrix = []
3    for i in range(int(input())):
4        row = [int(j) for j in input().split()]
5        matrix.append(row) 
6    return matrix
7
8def RotateMatrix(matrix, degrees):
9    n = len(matrix[0])
10    rotations = (degrees // 90) % 4
11    for r in range(rotations):
12        temp_matrix = []
13        for i in range(n):
14            column = [row[i] for row in matrix]
15            column.reverse()
16            temp_matrix.append(column)
17        matrix = temp_matrix
18    return matrix
19
20matrix = ReadMatrix()
21rotation = 0
22
23while True:
24    line = input().split()
25    if line[0] == "-1":
26        break;
27    elif line[0] == "R":
28        rotation += int(line[1])
29        matrix = RotateMatrix(matrix, int(line[1]))
30    elif line[0] == "U":
31         matrix[int(line[1])][int(line[2])] = int(line[3])
32         matrix = RotateMatrix(matrix, rotation)
33    elif line[0] == "Q":
34        print(matrix[int(line[1])][int(line[2])]) 
35    else:
36        print(line[0])
37        exit(1)

1class Buffer:
2
3    def __init__(self,size_max):
4        self.max = size_max
5        self.data = []
6
7    class __Full:
8
9        def append(self, x):
10
11            self.data[self.cur] = x
12            self.cur = (self.cur+1) % self.max
13        def get(self):
14
15            return self.data[self.cur:]+self.data[:self.cur]
16
17    def append(self,x):
18
19        self.data.append(x)
20        if len(self.data) == self.max:
21            self.cur = 0
22
23            self.__class__ = self.__Full
24
25    def get(self):
26
27        return self.data
28
29
30if __name__=='__main__':
31    n=input('Enter the occupide size of the buffer : ')
32    x=Buffer(int(n))
33
34    x.append(1); x.append(2); x.append(3); x.append(4)
35
36    print (x.__class__, x.get(  ))
37    l=len(x.data)
38    print(f"The free buffer is :{l}")
39    print(f"The left size buffer is :{int(n)-int(l)}")
40
41    x.append(5)
42
43    print (x.__class__, x.get(  ))
44    x.append(6)
45    print (x.data, x.get(  ))
46    x.append(7); x.append(8); x.append(9); x.append(10)
47    print (x.data, x.get(  ))

1np.linspace(0,1,11)