#include <stdio.h>

int main() {
printf("Welcome to your new start 🙌🏻\n") ;

printf("%d . DEC .%d 🗓️\n", 30, 2023);

return 0;
}

#Coming_Soon🥁
#Juniors

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main (){
int i = pow (4,6) ;
printf ("%d",i) ;
}

#include <stdio.h>
#include <stdlib.h>

int main (){
double f,t;
do{
printf("enter the base number: ");
scanf("%lf",&f);
printf("enter an exponet number: ");
scanf("%lf",&t);
}while(t==0);

if(f==0){
printf("answer %d",1);
}else{
double i, result=1;
if (t>0) i=t;
else i= -t;
while(i>0){

result=result*f;
i--;
}
if(t>0) printf("answer: %lf" ,result);
else printf("answer: %lf", 1/result);

}
}

#include <stdio.h>
#include <stdlib.h>


int main (){

char Calculation;
double A,B;
printf(" enter the 0peration: ");
scanf("%c",&Calculation);
printf("enter A: ");
scanf("%lf",&A);
printf("enter B: ");
scanf("%lf",&B);
switch(Calculation){
case '+':
printf("%lf + %lf = %lf ",A,B,A+B);
break;
case '-':
printf("%lf - %lf = %lf ",A,B,A-B);
break;
case '/':
printf("%lf / %lf = %lf ",A,B,A/B);
break;
case '*':
printf("%lf * %lf = %lf ",A,B,A*B);
break;
default:
printf("error404");
break;

}

}

#include <stdio.h>
#include <stdlib.h>

int main()
{

int T[100],R;
printf("the size of Table: ");
scanf("%d",&R);
for(int i=0; i<10; i++){
printf(" the valu is %d = ",i+1);
scanf("%d",&T[i]);
}
int sum=0,L=0;
do{
sum=sum+T[L];
L++;
}while(L<10);
double avg=0,K=0;
do{
avg=sum/10;
K++;
}while(L<K);





for(int j=0; j<R; j++){
printf(" the valu is %d = %d\n",j+1,T[j]);

}
printf("sum = %d\n",sum);
printf("avg = %f",avg);


}

#include <stdio.h>

void main ()
{
int i , array [20] , sum = 0 ;
float avg = 0;
for (i=0 ; i<15 ; i++)
{
printf ("Enter a number %d: ",i+1);
scanf ("%d",&array[i]);
sum = sum + array[i] ;
}
avg = sum / 15.0;
printf ("\nSum of the numbers =%d \n\nand their average =%.2f\n",sum,avg);
}

#include <stdio.h>
#include <stdlib.h>

int main(){

int R;
printf("the size of array: ");
scanf("%d",&R);

int A[R],B[R],sum[R];
printf(" enter the alemant \n");
for(int i=0; i<R; i++){
printf("enter the element the first array %d: \t",i+1);
scanf("%d",&A[i]);
}
printf("enter the element \n");
for(int i=0; i<R; i++){
printf("\nenter the element the second array %d: \t",i+1);
scanf("%d",&B[i]);}

printf("the sum = ");
for(int i=0; 1<R; i++){
sum[i]=A[i]+B[i];
printf("%d\t ",sum[i]);
}


}

#include <stdio.h>
#include <stdlib.h>
#define N 8
void get_pieces(int m[], int target);



int main(){

int m[N] = {1,2,4,10,20,30,50,100};
int target;
printf("enter the Target : ");
scanf("%d",&target);
get_pieces(m,target);
return 0;

}
void get_pieces(int m[], int target){
int i = N-1 , how;
while(target > 0){
if(target >= m[i]){
how = target / m[i];
target = target % m[i];
printf("given %d pieces from %d$ \n ",how,m[i]);


}
i--;
}

}

طريقة اسهل


#include<stdio.h>
main(){
int n;
printf("دخل رقم الصفوف : ");
scanf("%d", &n);
int i,j;
for(i=1 ; i<=n ;i++){
for(j=1 ; j<=(n-i) ; j++){
printf(" ");
}
for(j=1 ; j<=(2*i)-1 ; j++){
printf("*");
}printf("\n");
}

#include <iostream>

using namespace std;
int* rotation(int arr[], int steps);
int main()
{
int a[] = {1,2,3,4,5,6};
rotation(a,2);
}

int* rotation(int arr[], int steps){
int newArr[6];
int count1 = 0, count2 = 6 - steps;

for(;count1<steps;){
newArr[count2++] = arr[count1++];
}

count2 = 0;
for(;count1<6;){
newArr[count2++] = arr[count1++];
}

for(int i = 0; i<6; i++){
cout<< newArr[i];
}
return newArr;
};

برنامج لتعداد مرات حصول زيادة لسلسلة أرقام

#include <iostream>


using namespace std;

int main()
{
int arr[] = {30, 15, 36, 21, 48, 60};
int len = sizeof(arr) / sizeof(arr[0]);
int counter = 0;
int prev = 0;

for(int i = 0; i < len; i++){
if(arr[i] > prev){
counter++;
prev = arr[i];
}
}

cout<< counter;
}

كود ال bubble sort
#include <stdio.h>

// perform the bubble sort
void bubbleSort(int array[], int size) {

  // loop to access each array element
  for (int step = 0; step < size - 1; ++step) {

    // loop to compare array elements
    for (int i = 0; i < size - step - 1; ++i) {

      // compare two adjacent elements
      // change > to < to sort in descending order
      if (array[i] > array[i + 1]) {

        // swapping occurs if elements
        // are not in the intended order
        int temp = array[i];
        array[i] = array[i + 1];
        array[i + 1] = temp;
      }
    }
  }
}

// print array
void printArray(int array[], int size) {
  for (int i = 0; i < size; ++i) {
    printf("%d  ", array[i]);
  }
  printf("\n");
}

int main() {
  int data[] = {-2, 45, 0, 11, -9};

  // find the array's length
  int size = sizeof(data) / sizeof(data[0]);

  bubbleSort(data, size);

  printf("Sorted Array in Ascending Order:\n");
  printArray(data, size);
}

#include<stdio.h>
#include<stdlib.h>
int main(int argc, char *argv[] ){
int a = atoi(argv[1]);
int b = atoi(argv[2]);
int c = atoi(argv[3]);
if(a>b){
if(a>c){
printf("%d",a);
}
else{
printf("%d",c);
}
}
else{
if (b>c){
printf("%d",b);
}
else{
printf("%d", c);
}
}
}

فيديو يوضح طريقة تنزيل الgcc الخاص بمعمل الداتا
https://youtu.be/k6juv3mIr9o?si=Gw9cTadV2pAQYWQE