JustPaste
HomeCategoriesAboutDonateContactTerms of UsePrivacy Policy
JustPaste

Free online notepad — write and share instantly

Navigate

  • Home
  • Timeline
  • Categories

Info

  • About
  • Donate
  • Contact

Legal

  • Terms of Use
  • Privacy Policy

© 2026 JustPaste.app. All rights reserved.

Made with ♥ by JustPaste

Untitled Page | JustPaste.app
6 months ago102 views
#include <stdio.h>
#include <string.h>
struct Book 
{
    char name[30], author[30], publisher[30];
    int quantity,id;
};
main() {
	int Max;
	char cg[5],t;
	printf("Enter number of book: ");
	printf("\t\t\t Add Book");
    scanf("%d",&Max);
    struct Book lib[Max];
    int count = 0;
    int choice, i, bid, found;
    for(i=0;i<Max;i++)
    {
		printf("Enter Book ID: ");
        scanf("%d", &lib[count].id);
        printf("Enter Book Name: ");
        scanf("%s", lib[count].name);
        printf("Enter Author Name: ");
        scanf("%s", lib[count].author);
        printf("Enter Publisher Name: ");
        scanf("%s", lib[count].publisher);
        printf("Enter Quantity: ");
        scanf("%d", &lib[count].quantity);
        printf("Book added successfully.\n");            
	}
      k:printf("\n====== Library Management ======\n");
        printf("1. View Books\n");
        printf("2. Return Book\n");
        printf("3. Issue Book\n");
        printf("Enter your choice: ");
        scanf("%d", &choice);
        switch (choice)
        {
        case 1:
            printf("Enter Book ID to return: ");
            scanf("%d", &bid);
            for (i = 0; i < Max; i++)
			 {
                if (lib[i].id == bid) {
                printf("\nID\tName\t\tAuthor\t\tPublisher\tQuantity\n");
                for (i = 0; i < count; i++) {
                    printf("%d\t%-12s\t%-12s\t%-12s\t%d\n",lib[i].id,lib[i].name,lib[i].author,lib[i].publisher,lib[i].quantity);
                    goto x;
                }
            }
            else
            	printf("\n\t\tnot found\n");
            x:break;
        case 2:
            printf("Enter Book ID to return: ");
            scanf("%d", &bid);
            found = 0;
            for (i = 0; i < count; i++) {
                if (lib[i].id == bid) {
                    lib[i].quantity++;
                    printf("Book returned successfully.\n");
                    found = 1;
                    break;
                }
            }
            if (!found)
                printf("Book ID not found.\n");
            break;
        case 3:
            printf("Enter Book ID to issue: ");
            scanf("%d", &bid);
            found = 0;
            for (i = 0; i < count; i++) {
                if (lib[i].id == bid)
				 {
                    if (lib[i].quantity > 0) {
                        lib[i].quantity--;
                        printf("Book issued successfully.\n");
                    } else {
                        printf("Book not available.\n");
                    }
                }
                    break;
                }
            }
            if (!found)
            {
                printf("Book ID not found.\n");
            break;
            }
            break;
        default:
            printf("Invalid choice! Try again.\n");
            
        }
        printf("if want to agin this proses Yes or No : ");
		scanf("%s",cg);
		scanf("%c",&t);
		if(cmp("yes",cg)==0||cmp("Yes",cg)==0||cmp("YES",cg)==0)
		{
			goto k;
		}
    }


#include <stdio.h>
struct
{
	char n[20];
	struct
	{
		int m[10],t;
		float a;
	}d;
}v[25];
main()
{
	int np,i,mc,j;
	char t;
	printf("\t\t\tBatting Avg\n\t\t\t======= ===\n\tInput\n\t=====\n");
	printf("\t\tEnter a player count :");
	scanf("%d",&np);
	printf("\t\tEnter a match count :");
	scanf("%d",&mc);
	for(i=0;i<np;i++)
	{
		printf("\t\tEnter %d player name :",i+1);
		scanf("%s",v[i].n);
		scanf("%c",&t);
		v[i].d.t=0;
		for(j=0;j<mc;j++)
		{
			printf("\t\tEnter %d player %d match score :",i+1,j+1);
			scanf("%d",&v[i].d.m[j]);
			v[i].d.t+=v[i].d.m[j];
		}
		v[i].d.a=v[i].d.t/3.0;
	}
	printf("\toutput\n\t======\n\t\t\tScore borde\n\t\t\t===== =====\n");
	printf("\t\tName\t");
	for(j=0;j<mc;j++)
	{
		printf("Match%d\t",j+1);
	}
	printf("Total\tAvg\t\n");
	for(i=0;i<np;i++)
	{
		
		printf("\t\t%s\t",v[i].n);
		for(j=0;j<mc;j++)
		{
			printf("%d\t",v[i].d.m[j]);
		}
		printf("%d\t%.2f\n",v[i].d.t,v[i].d.a);
	}
}

#include <stdio.h>
struct Complex 
{
    float r;
    float i;
};
struct Complex addComplex(struct Complex a, struct Complex b) {
    struct Complex result;
    result.r = a.r + b.r;
    result.i = a.i + b.i;
    return result;
}
struct Complex subComplex(struct Complex a, struct Complex b)
{
    struct Complex result;
    result.r = a.r - b.r;
    result.i = a.i - b.i;
    return result;
}
main() 
{
    struct Complex num1, num2, result;
    int choice;
    printf("\t\t\tcoplex\n\t\t\t======\n\tInput\n\t=====\n");
    printf("\t\tEnter real part of first complex number: ");
    scanf(" %f", &num1.r);
    printf("\t\tEnter image part of first complex number:");
    scanf("%f", &num1.i);
    printf("\t\tEnter real part of second complex number: ");
    scanf(" %f", &num2.r);
    printf("\t\tEnter image part of second complex number: ");
    scanf("%f", &num2.i);
    printf("\t\t1. Add\n\t\t2. Subtract\n\t\tEnter your choice: ");
    scanf("%d", &choice);
    printf("\toutput\n\t======\n");
	switch(choice)
	 {
        case 1:
            result = addComplex(num1, num2);
            printf("\t\tAddition = %.2f + %.2fi", result.r, result.i);
            break;
        case 2:
            result = subComplex(num1, num2);
            printf("\t\tSubtraction = %.2f + (%.2fi)", result.r, result.i);
            break;
        default:
            printf("\t\tInvalid Choice!");
    }
}

⚠️Content was pasted as plain text and auto-formatted as a code block. Use the Code Block button in the editor for proper formatting.

← Back to timeline