Results 1 to 13 of 13
Thread: ++
Hybrid View
-
20th December 2014 11:44 #1
-
20th December 2014 11:46 #2
-
20th December 2014 11:55 #3
, . , . . , . , 2, , S=1 S=S*2, 1? /2 .
:
#include<iostream>
#include<math.h>
using namespace std;
int main ()
{
int n;
cout<<"n=";cin>>n;
int arr[n];
int S=0;
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
/*for (int i = 0; i < n - 1; i++)
{
for (int j = i + 1; j < n; j++)
{
if (arr[i] > arr[j]) // swap items
{
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}*/
for(int i=0;i<n;i++)
{
for(int j=1;j<arr[i]/2;j++)
{
if(arr[i]%j==0)
{
S=S+j;
}
}
if(S==arr[i])
{
cout<<arr[i];
}
}
}Intel Core i7 4770K @ 3,5GHz | H80i | 4x4GB 1600Mhz | 500GB WD SSD| GTX 1060 | 690 II Advanced | 700W Hypro | AGON 271QX | Windows 10 Pro x64 + Fedora 32
-
20th December 2014 13:00 #4Registered User
Join Date: Apr:2011
Location:
Posts: 90
, 2. , 2 - else
while , 2 - while if>1
while 1 ( ) - 2
...
Code:int number = 1024; if((number % 2) == 0 || number == 1){ while((number % 2) == 0 || number < 1){ number /= 2; } if(number > 1){ cout << "ne e stepen na 2"; }else if (number == 1){ cout << "stepen na 2"; } }else{ cout << "ne e stepen na 2"; }
-
20th December 2014 13:20 #5
,
for(int i=0;i<n;i++)
{
if((arr[i] % 2) == 0 || arr[i] == 1)
{
while((arr[i] % 2) == 0 || arr[i] < 1)
{
arr[i] /= 2;
}
if (arr[i] == 1)
{
flag++;
}
}
}
if(flag>0)
{
cout<<"Ima stepen na 2";
};
, , ( , ), . , , . .Intel Core i7 4770K @ 3,5GHz | H80i | 4x4GB 1600Mhz | 500GB WD SSD| GTX 1060 | 690 II Advanced | 700W Hypro | AGON 271QX | Windows 10 Pro x64 + Fedora 32
-
20th December 2014 13:31 #6Registered User
Join Date: Apr:2011
Location:
Posts: 90
- if
isPerfectly(arr[i]) ...
true - - arr[i]
- , 1 , i
i ( i )
Code:bool isPerfectly(int n){ int sum = 0; for (int i = 1; i < n ; i++) { if((n % i) == 0){ sum += i; } } if(n == sum){ return true; }else{ return false; } }




Reply With Quote
Lenovo ThinkPad 15 IdeaPad 15
5th May 2023, 22:16 in