همکاری_به چند نویسندگی زیر 15 سال برای وبلاگ نیاز داریم

چاپ بزرگترین کلمه در متن چاپ بزرگترین کلمه در لیست #786 #Author:Bisavad #@GameOverBlog #RetuBigWordinText defbig(list): b=list[0] forwordinlist: if(len(word)>le...

فلوچارت و برنامه عدد اول و ب.م.م و ک.م.م ...

gameover.blog.ir #سیشارپبرنامه چاپ کوچکترین عدد و بزرگترین عدد آرایه static void PrintSmallestLargest(int[] arr) { if (arr.Length > 0) { int small = arr[0]; int large = arr[0]; for (int i = 0; i < arr.Length; i++) { ...

gameover.blog.ir #include <iostream> #include <stdlib.h> using namespace std; int main(){ int i,n; float *data; cout << "Enter total number of elements(1 to 100): "; cin >> n; data=(float*)calloc(n,sizeof(float)); /* Allocates the memory for 'n' elements */ if(data==NULL) { cout << "Error!!! memory not allocated."; exit(0); } cout << endl; for(i=0;i<n;++i) /* Stores number entered by user. */ { cout << "Enter Number" << i+1 << ": "; cin >> data[i]; } for(i=1;i<n;++i) /* Loop to store largest number at address data */ { if(*data<...

gameover.blog.ir #include <iostream> using namespace std; int main(){ int i,n; float arr[100]; cout << "Enter total number of elements: "; cin >> n; cout << endl; while (n>100 || n<=0) { cout << "Error! number should in range of (1 to 100)." << endl; cout << "Enter the number again: "; cin >> n; } for(i=0;i<n;++i) /* Stores number entered by user. */ { cout << "Enter Number " << i+1 << " : "; cin >> arr[i]; } for(i=1;i<n;++i) /* Loop to store largest number to arr[0] */ { if(arr[0]<arr[i]) /* Change < to ...

gameover.blog.ir #include <iostream> using namespace std; int main() { int n1, n2; cout << "Enter two numbers: "; cin >> n1 >> n2; while(n1 != n2) { if(n1 > n2) n1 -= n2; else n2 -= n1; } cout << "HCF = " << n1; retu 0; } Output Enter two numbers: 78 52 HCF = 26 سورس کد HCF/GCD:#include <iostream> using namespace std; int main() { int n1, n2, hcf; cout << "Enter two numbers: "; cin >> n1 >> n2; // Swapping variables n1 and n2 if n2 is greater than n1. if ( n2 > n1) { int temp = n2; n2 = n1; n1 = temp; ...