Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iomanip>
- #include <iostream>
- #include <cmath>
- using namespace std;
- int x[1000][1000];
- int holy(int y){
- int f = y % 2;
- y = y / 2;
- if (y == 0)return 1;
- return f + 10 * holy(y);
- }
- int main(){
- cout << "type the size of the array";
- int b;
- cin >> b;// ادخال مصفوفة
- for (int i = 0; i < b; i++){
- for (int j = 0; j < b; j++){
- cin >> x[i][j];
- }
- }// طباعة مصفوفة
- for (int i = 0; i < b; i++){
- for (int j = 0; j < b; j++){
- cout << x[i][j];
- }
- }//متوصط حسابي لجميع العناصر
- long long omar = 0;
- for (int i = 0; i < b; i++){
- for (int j = 0; j < b; j++){
- omar = omar + x[i][j];
- }
- }
- cout << omar / (b*b);
- // تحويل العناصر للنظام الثنائي
- for (int i = 0; i < b; i++){
- for (int j = 0; j < b; j++){
- cout << holy(x[i][j]) << "\n";
- }
- }
- // منقول مصفوفة
- long lexi;
- for (int i = 0; i < b; i++){
- for (int j = 0; j < b; j++){
- lexi = x[i][j];
- x[i][j] = x[j][i];
- x[j][i] = lexi;
- }
- }
- int g;//قاسم مشترك
- for (int i = 0; i <b ; i++){
- for (int j = 0; j < b; j++){
- for (int ja = 1; ja <= x[0][0]; ja++){
- if (x[i][j] % ja == 0 && ja < g)g = ja;
- }
- }
- }cout << g << "\n";
- //// مضاعف
- g = 0;
- int n;
- for (int i = 0; i <b; i++){
- for (int j = 0; j < b; j++){
- if (x[i][j]>n)n = x[i][j];
- }
- }
- for (int i = 0; i <b; i++){
- for (int j = 0; j < b; j++){
- for (int ja = 1; ja <= x[0][0]; ja++){
- }
- }
- }
- for (int i = 0; i <b; i++){
- for (int j = 0; j < b; j++){
- for (int ja = 1; ja <= x[i][j]; ja++){
- if (x[i][j] % ja == 0 && ja < g)g = g+ja;
- }
- if (g == x[i][j])cout << "complete num"; // عدد تام
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement