0% found this document useful (0 votes)
8 views

Loading

Screen

Uploaded by

amitslp678
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views

Loading

Screen

Uploaded by

amitslp678
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include <stdio.

h>
#include <unistd.h>

int heart(int n)
{
int i, j;

for (i = n / 2; i <= n; i += 2) {
for (j = 1; j < n - i; j += 2) {
printf(" ");
}

for (j = 1; j <= i; j++) {


printf(" *");
}

for (j = 1; j <= n - i; j++) {


printf(" ");
}

for (j = 1; j <= i; j++) {


printf(" *");
}

printf("\n");
}

for (i = n; i >= 1; i--) {


for (j = i; j < n; j++) {
printf(" ");
}

for (j = 1; j <= (i * 2) - 1; j++) {


printf(" *");
}

printf("\n");
}

return 0;
}
int my(int n)
{
n = n*2;
for(int i = 0; i <= n; i++)
{
for ( int j = 1; j <= n/3; j++)
{
printf(" ");
}
for ( int j = 1; j <= n/3; j++)
{
printf(" *");
}

printf("\n");
}

return 0;
}
int u(int n)
{
n = n*2;

for(int i = 0; i <= n; i++)


{
for ( int j = 1; j <= n/3; j++)
{
printf(" *");
}
for ( int j = 1; j <= n/3; j++)
{
printf(" ");
}
for ( int j = 1; j <= n/3; j++)
{
printf(" *");
}
printf("\n");
}

for(int i = 1; i <= n/3; i++)


{
if ( n % 3 == 0 )
{
for( int j = 1; j <= n; j++)
{
printf(" *");
}
}
else if ( n % 3 == 1)
{
for( int j = 1; j <= n-1; j++)
{
printf(" *");
}
}
else
{
for( int j = 1; j <= n-2; j++)
{
printf(" *");
}
}
printf("\n");
}

return 0;

int main() {

int n = 12;
// printf("Enter n: ");
// scanf("%d", &n);
// printf("\n");

int i;
int total = 100;
int delay = 100000;

printf("Loading: ");

for (i = 0; i <= total; ++i) {


printf("%d%c", i , '%');
fflush(stdout);

usleep(delay);
if (i<10)
printf("\b\b");
else if (i<100)
printf("\b\b\b");
else
printf("\b\b\b\b");
}

printf("\nLoading complete!\n");
usleep(1000000);
printf("\n\n\n");
my(n);
printf("\n\n\n");
usleep(1000000);
heart(n);
printf("\n\n\n");
usleep(1000000);
u(n);

return 0;
}

You might also like