Gklogicmaster's pull request

December 01/c_Gklogicmaster.c

@@ -0,0 +1,30 @@
+#include <stdio.h>
+
+int main() {
+    int n;
+    printf("enter the numberof particapants :");
+    scanf("%d",&n);
+    int a[n-1],m;
+    printf("enter the bib numbers :");
+    for(m=0;m<n;m++){
+        scanf("%d",&a[m]);
+    }
+    printf("the bib numbers present is :");
+    printf("{");
+    for(m=0;m<n;m++){
+        printf("%d ",a[m]);
+    }
+    printf("}");
+    int u=0;
+    for(m=0;m<n;m++){
+        u=u+a[m];
+    }
+    u=u+1;
+    int y=0;
+    for(m=1;m<=n;m++){
+        y=y+m;
+    }
+    printf("\nthe bib number absent is :{%d}",u-y);
+
+return 0;
+}

December 02/c_Gklogicmaster.c

@@ -0,0 +1,45 @@
+#include<stdio.h>
+void swap(int *a,int *b){
+    int temp;
+    temp=*a;
+    *a=*b;
+    *b=temp;
+}
+
+
+void wave_sort(int arr[],int n){
+    for(int i=0;i<n;i+=2){
+        if(arr[i]<arr[i+1]){
+            swap(&arr[i],&arr[i+1]);
+        }
+        if(i>0 && arr[i]<arr[i-1]){
+            swap(&arr[i-1],&arr[i]);
+        }
+    }
+
+}
+int main(){
+    int n,i;
+    printf("enter the no of elements :");
+    scanf("%d",&n);
+    int arr[n];
+    printf("enter the elements to wave sort :");
+    for(i=0;i<n;i++){
+        scanf("%d",&arr[i]);
+    }
+    printf("the unsorted array is : ");
+     printf("{");
+    for(i=0;i<n;i++){
+    printf("%d,",arr[i]);
+    }
+    printf("}");
+    wave_sort(arr,n);
+     printf("\nthe wave sorted array is : ");
+     printf("{");
+    for(i=0;i<n;i++){
+    printf("%d,",arr[i]);
+    }
+    printf("}");
+
+    return 0;
+}

December 03/c_Gklogicmaster.c

@@ -0,0 +1,35 @@
+#include<stdio.h>
+int main (){
+    int R,B,i,j;
+    printf("enter the number of red squares:");
+    scanf("%d",&R);
+    printf("enter the number of blue squares:");
+    scanf("%d",&B);
+    if(R-B == 1 || B-R ==1){
+       while(B>0 || R>0){
+           if(B>R){
+               if(B>0){
+                   printf("B");
+                   B--;
+
+               }
+               if(R>0){
+               printf("R");
+               R--;}}
+            if(R>B){
+                if(R>0){
+                    printf("R");
+                    R--;
+                }
+                if(B>0){
+                    printf("B");
+                    B--;
+                }
+            }
+    }}
+    else{
+        printf("NOT POSSIBLE");
+    }
+    return 0;
+
+}

December 04/c_Gklogicmaster.c

@@ -0,0 +1,28 @@
+#include <stdio.h>
+int calculatePlants(int month) {
+    if (month == 1 || month == 2) {
+        return 1;
+    }
+    int p1 = 1, p2 = 1, current = 0;
+    for (int i = 3; i <= month; i++) {
+        current = p1 + p2;
+        p2 = p1;
+        p1 = current;
+    }
+
+    return current;
+}
+
+int main() {
+    int month;
+    printf("Enter the month number: ");
+    scanf("%d", &month);
+    if (month <= 0) {
+        printf("Please enter a valid month number greater than 0.\n");
+    } else {
+        int plants = calculatePlants(month);
+        printf("Number of plants in month %d: %d\n", month, plants);
+    }
+
+    return 0;
+}

December 05/c_Gklogicmaster.c

@@ -0,0 +1,25 @@
+#include <stdio.h>
+int position(int n, int k) {
+    int result = 0;
+    for (int i = 2; i <= n; i++) {
+        result = (result + k) % i;
+    }
+    return result + 1;
+}
+
+int main() {
+    int n, k;
+    printf("Enter the number of people in the circle: ");
+    scanf("%d", &n);
+
+    printf("Enter the step count (k): ");
+    scanf("%d", &k);
+    if (n <= 0 || k <= 0) {
+        printf("Invalid input. Both n and k must be greater than 0.\n");
+        return 1;
+    }
+    int survivor = position(n, k);
+    printf("The last person remaining is at position: %d\n", survivor);
+
+    return 0;
+}

December 06/python_Gklogicmaster.py

@@ -0,0 +1,21 @@
+def find_unique_pairs(numbers, target):
+    unique_pairs = []
+    for i in range(len(numbers)):
+        for j in range(i + 1, len(numbers)):  
+            if numbers[i] + numbers[j] == target:
+                unique_pairs.append((numbers[i], numbers[j]))
+
+    return unique_pairs
+
+def get_input():
+    numbers = input("Enter a list of integers separated by spaces: ")
+    numbers = [int(num) for num in numbers.split()]
+    target = int(input("Enter the target sum: "))
+    return numbers, target
+if _name_ == "_main_":
+    numbers, target = get_input()
+    result = find_unique_pairs(numbers, target)
+    if result:
+        print("Unique pairs are:", result)
+    else:
+        print("No unique pairs found that sum to", target)

December 07/python_Gklogicmaster.py

@@ -0,0 +1,15 @@
+def pascal_tower(n):
+    if n <= 0:
+        print("Please enter a positive number for the floors.")
+        return
+    tower = []
+
+    for i in range(n):
+        floor = [1] * (i + 1)
+        for j in range(1, i):
+            floor[j] = tower[i - 1][j - 1] + tower[i - 1][j]
+        tower.append(floor)
+    print("Magical Tower with", n, "floors:")
+    print(tower)
+n = int(input("Enter the number of floors for the Magical Tower: "))
+pascal_tower(n)

December 08/c_Gklogicmaster.c

@@ -0,0 +1,22 @@
+#include <stdio.h>
+int main() {
+    int  n,sum=0;
+    printf("enter a positive integer till which to find its digit square sum :");
+    scanf("%d",&n);
+    for(int i=1;i<=n;i++){
+        int num =i;
+        if(num<10){
+            sum=sum+(num*num);
+        }
+        if(num>=10){
+            int temp;
+            while(num!=0){
+            temp=num%10;
+            sum=sum+(temp*temp);
+            num=num/10;
+            }
+        }
+    }
+    printf("the total digit square sum of %d numbers is :%d",n,sum);
+    return 0;
+}

December 09/python_Gklogicmaster.py

@@ -0,0 +1,6 @@
+def product_returns(l):
+    count1=l.count(1)
+    print("Result:",count1)
+print("enter the list of details of the coustomer return frequency")
+l=list(eval(input("Returns:")))
+product_returns(l)

December 10/python_Gklogicmaster.py

@@ -0,0 +1,55 @@
+rom collections import defaultdict, deque
+
+def determine_execution_order(tasks):
+    graph = defaultdict(list)
+    in_degree = defaultdict(int)
+
+    for task_id, dependencies in tasks:
+        if task_id not in in_degree:
+            in_degree[task_id] = 0
+        for dep in dependencies:
+            graph[dep].append(task_id)
+            in_degree[task_id] += 1
+    queue = deque([task for task in in_degree if in_degree[task] == 0])
+    if not queue:
+        return "Error: Cyclic dependency detected"
+
+    result = []
+    while queue:
+        level = []
+        for _ in range(len(queue)):
+            task = queue.popleft()
+            level.append(task)
+
+            for neighbor in graph[task]:
+                in_degree[neighbor] -= 1
+                if in_degree[neighbor] == 0:
+                    queue.append(neighbor)
+
+        result.append(level)
+    if any(in_degree[task] > 0 for task in in_degree):
+        return "Error: Cyclic dependency detected"
+
+    return result
+
+def get_user_tasks():
+    tasks = []
+    print("Enter tasks and their dependencies in the format 'Task:Dep1,Dep2,...'. Type 'done' to finish.")
+    while True:
+        user_input = input("Enter task: ").strip()
+        if user_input.lower() == 'done':
+            break
+        if ":" in user_input:
+            task_id, dependencies = user_input.split(":")
+            dependencies = dependencies.split(",") if dependencies else []
+        else:
+            task_id = user_input
+            dependencies = []
+        tasks.append((task_id.strip(), [dep.strip() for dep in dependencies]))
+    return tasks
+
+if _name_ == "_main_":
+    print("Provide the list of tasks and dependencies:")
+    tasks = get_user_tasks()
+    output = determine_execution_order(tasks)
+    print(output)

December 11/c_Gklogicmaster.c

@@ -0,0 +1,35 @@
+#include<stdio.h>
+#include<string.h>
+int main(){
+    int x=0,y=0;
+    int i,size;
+    char moves[20];
+    printf("enter the moves to move ('U,D,R,L'):");
+    scanf("%s",moves);
+    size=strlen(moves);
+    for(i=0;i<size;i++){
+        if(moves[i]=='R'){
+            x+=1;
+        }
+        else if(moves[i]=='L'){
+            x-=1;
+        }
+        else if(moves[i]=='U'){
+            y+=1;
+        }
+        else if(moves[i]=='D'){
+            y-=1;
+        }
+        else{
+            printf("enter valid moves\n");
+        }
+
+    }
+    if(x==0 && y==0){
+        printf("true");
+    }
+    else{
+        printf("false");
+    }
+    return 0;
+}

December 12/python_Gklogicmaster.py

@@ -0,0 +1,45 @@
+from collections import deque
+
+def smart_ticket(requests, total_tickets):
+    vip_queue = deque()
+    regular_queue = deque()
+
+    # Separate VIP and regular requests
+    for req in requests:
+        parts = req.split()
+        name, tickets = parts[0], int(parts[1])
+        if len(parts) > 2 and parts[2].upper() == 'VIP':
+            vip_queue.append((name, tickets))
+        else:
+            regular_queue.append((name, tickets))
+
+    results = []
+
+    # Process ticket requests
+    while total_tickets > 0 and (vip_queue or regular_queue):
+        queue = vip_queue if vip_queue else regular_queue
+        name, tickets = queue.popleft()
+
+        if tickets <= total_tickets:
+            total_tickets -= tickets
+            results.append(f"{name} received {tickets} tickets.")
+        else:
+            results.append(f"{name} received {total_tickets} tickets (not fully satisfied).")
+            total_tickets = 0
+
+    if total_tickets == 0:
+        results.append("Tickets sold out.")
+    return results
+
+# Input
+N = int(input("Enter the total tickets available: "))
+print("Enter a list of requests (e.g., 'raja 3 VIP') enter 'end' to stop:")
+l = []
+while True:
+    req = input()
+    if req.lower() == "end":  # Type 'end' to finish input
+        break
+    l.append(req)
+
+b=smart_ticket(l, N)
+print(b)