// URL:
/**
* @author WasitShafi
* @since 01-MAR-2023
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="UTF-8"> | |
<meta http-equiv="Content-Security-Policy" content="default-src 'self'; script-src 'self'"> | |
<meta http-equiv="X-Content-Security-Policy" content="default-src 'self'; script-src 'self'"> | |
<title>Hello World</title> | |
</head> | |
<body> | |
<h1>Hello World!</h1> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
const { app, BrowserWindow } = require('electron'); | |
const createWindow = () => { | |
const win = new BrowserWindow({ | |
width: 500, | |
height: 500, | |
fullscreenable: false, | |
}); | |
win.setAspectRatio(1); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
int isPrime(int n , int i) | |
{ | |
if(n < 2) return 0; | |
if(n == 2) return 1; | |
if(n % i == 0) return 0; | |
if(i * i > n) return 1; | |
isPrime(n, i + 1); | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
#include<math.h> | |
int main() | |
{ | |
int n, i, half, isPrime = 1, square_root; | |
printf("Enter Value of n... "); | |
scanf("%d", &n); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
int main() | |
{ | |
int n, i = 2, half, isPrime = 1; | |
printf("Enter Value of n... "); | |
scanf("%d", &n); | |
half = n / 2; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
int main() | |
{ | |
int n, i = 2 ; | |
printf("Enter Value of n... "); | |
scanf("%d", &n); | |
if(n > 1) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
int main() | |
{ | |
int *bookShelf[3]; // Array of pointer to int; | |
int shelf1[3] = {1, 2, 3}; // constains 3 books of total pages 1, 2 & 3. | |
int shelf2[4] = {4, 5, 6, 7}; | |
int shelf3[5] = {8, 9, 10, 11, 12}; | |
int shelvesSizes[3] = {3, 4, 5}; // It is stores no. of shelves |
Create a new repository, or reuse an existing one.
Generate a new SSH key:
ssh-keygen -t rsa -C "[email protected]"
Copy the contents of the file ~/.ssh/id_rsa.pub
to your SSH keys in your GitHub account settings.
Test SSH key: