convert python code to c code

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
2# Importing
3import sklearn
4from sklearn.datasets import load_boston
5import pandas as pd
6import matplotlib.pyplot as plt
7  
8# Load the dataset
9bos_hou = load_boston()
10  
11# Create the dataframe
12column_name = bos_hou.feature_names
13df_boston = pd.DataFrame(bos_hou.data)
14df_boston.columns = column_name
15df_boston.head()

1"""
2coronavirus
33
4abcde
5crnas
6onarous
7
8"""
9# Iterative Python program to check if a
10# string is a subsequence of another string
11
12# Returns true if str1 is a subsequence of str2
13
14def main(str1, str2):
15    m = len(str1)
16    n = len(str2)
17
18    j = 0 # Index of str1
19    i = 0 # Index of str2
20
21    # Traverse both str1 and str2
22    # Compare the current character of str2 with
23    # first unmatched character of str1
24    # If matched, then move ahead in str1
25
26    while j < m and i < n:
27        if str1[j] == str2[i]:
28            j = j+1
29        i = i + 1
30
31    # If all characters of str1 matched,
32    # then j is equal to m
33    return j == m
34
35# Driver Program
36str2 = str(input())
37N = int(input())
38
39for i in range(N):
40    str1 = str(input())
41    if main(str1, str2):
42        print("POSITIVE") 
43    else:
44        print( "NEGATIVE")

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(  ))

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