text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
for(int n;cin>>n,n;){
int r=0;
for(int i=1;i*i<=n;i++) if(!(n%i)){
int x=n/i;
if(i!=x) r+=i;
if(i!=1) r+=x;
}
if(n==r) cout<<"perfect number"<<endl;
else if(n>r) cout<<"deficient number"<<endl;
else cout<<"abundant number"<<endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(void){
int N,S;
int temp;
int sum;
while(1){
int temp = 0;
cin >> N;
if( N == 0 ) break;
sum = 0;
for( int j = 1 ; j*j <= N; j++ ){
if( N % j == 0 ){
sum += j;
if( j*j != N ) sum += N/j;
}
}
sum -= N;
if( N < sum ) cout << "abundant number" << endl;
else if( N > sum ) cout << "deficient number" << endl;
else cout << "perfect number" << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
void solve(int in){
int ans = 0;
if(in > 1) ans = 1;
for(int i = 2; i * i <= in; i++){
if(in%i == 0){
if(i != in/i) ans += in/i;
ans += i;
}
}
if(ans > in) cout << "abundant number" << endl;
if(ans == in) cout << "perfect number" << endl;
if(ans < in) cout << "deficient number" << endl;
}
int main(){
int in;
while(cin >> in && in) solve(in);
return 0;
} |
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(void){
int n = 0;
while(cin >> n){
if(n == 0){
break;
}
else if(n == 1){
cout << "deficient number" << endl;
}
else{
int s = 1;
for(int i = 2; i <= sqrt(n); i++){
if(n % i == 0){
s = s + i;
if(i != sqrt(n)){
s = s + (n / i);
}
}
}
if(s == n){
cout << "perfect number" << endl;
}
else if(s > n){
cout << "abundant number" << endl;
}
else{
cout << "deficient number" << endl;
}
}
}
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int getS(int x) {
if(x == 1) return 0;
int sum = 1;
int i;
for(i = 2; i*i < x; ++i) {
if(x % i == 0) sum += i + x/i;
}
if(i*i == x) sum += i;
return sum;
}
int main() {
int N;
while(cin >> N && N) {
int S = getS(N);
if(N == S) {
cout << "perfect number" << endl;
} else if(N > S) {
cout << "deficient number" << endl;
} else if(N < S) {
cout << "abundant number" << endl;
}
}
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n;
while( cin >> n , n ){
int sum = -n;
for(int i=1 ; i*i<=n ; ++i ){
if( n%i == 0 ){
sum += i + n/i;
if( i == n/i ) sum -= i;
}
}
if( n > sum )
cout << "deficient number" << endl;
else if( n == sum )
cout << "perfect number" << endl;
else
cout << "abundant number" << endl;
}
} |
#include <iostream>
#include <algorithm>
#include <cmath>
#define int long long
using namespace std;
signed main() {
int n;
while (cin >> n, n) {
if (n == 1) {
cout << "deficient number\n";
continue;
}
int sum = 1;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)sum += i + (n / i);
if (i*i == n)sum -= i;
}
if (n == sum)cout << "perfect number\n";
else cout << (n < sum ? "abundant number\n" : "deficient number\n");
}
}
|
#include <iostream>
#include <cmath>
void check(int number) {
int root_num = sqrt(number);
int total = 0;
for (int i = 1; i <= root_num; i++) {
if (number % i == 0) {
total += i;
if (i != number / i) {
total += (number / i);
}
}
}
total -= number;
if (total == number) {
std::cout << "perfect number" << std::endl;
} else if (total < number) {
std::cout << "deficient number" << std::endl;
} else {
std::cout << "abundant number" << std::endl;
}
return;
}
int main(void) {
int number;
while (1) {
std::cin >> number;
if (number == 0) {
break;
}
check(number);
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int n;
while (cin>>n, n) {
int s=n>1;
for(auto i=2LL; i*i<=n; ++i) {
if (n%i==0) {
s+=i;
if (i!=n/i) s+=n/i;
}
}
if (n==s)
cout<<"perfect number"<<endl;
else if (n>s)
cout<<"deficient number"<<endl;
else
cout<<"abundant number"<<endl;
}
} |
#include <iostream>
using namespace std;
#define MAX 100000001
bool p[MAX];
int main()
{
int N;
/*
for (int i=0; i<MAX; i++)
p[i] = true;
p[0] = [1] = false;
for (int i=2; i*i<MAX; i++)
{
if (p[i])
{
for (int k=i; k<MAX; k+=i)
p[k] = false;
}
}*/
while (cin >> N, N)
{
int sum = 1;
if (N == 1) sum = 0;
for (int i=2; i*i<=N; i++)
{
if (N%i == 0)
{
sum += i;
sum += N/i;
if (i == N/i)
{
sum -= i;
}
}
}
if (sum < N) cout << "deficient number" << endl;
else if (sum == N) cout << "perfect number" << endl;
else cout << "abundant number" << endl;
}
return 0;
} |
#include <cstdio>
using namespace std;
int main(){
int n,sum=0,i;
while(1){
scanf("%d",&n);
if(n==0) break;
for(i=1;i*i<=n;i++){
if(n!=i){if(n%i==0){
sum+=i;
if(i!=n/i){
sum+=n/i;}
if(sum>2*n){
break;
}
}}}
if(sum<2*n){
printf("deficient number\n");
}else if(sum==2*n){
printf("perfect number\n");
}else{
printf("abundant number\n");
}
sum=0;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> pii;
int main() {
ll N;
while(cin >> N, N) {
ll cnt = (N==1 ? 0 : 1);
for(int i=2; i*i<=N; i++) {
if(N%i == 0) {
cnt += i + (N/i);
if(i == N/i) cnt -= i;
}
}
if(cnt == N) {
cout << "perfect number" << endl;
}
else if(cnt < N) {
cout << "deficient number" << endl;
}
else {
cout << "abundant number" << endl;
}
}
return 0;
} |
#include <cstdio>
#include <math.h>
#include <iostream>
using namespace std;
int solve(int n)
{
int total = 0;
for (int i = 1; i * i <= n ; i++)
{
if (n % i == 0)
{
total += i;
if (i * i != n) total += n / i;
}
}
total -= n;
return total - n;
}
int main()
{
int n;
while (scanf("%d", &n) != EOF)
{
if (n == 0) return 0;
int result = solve(n);
if (result == 0)
puts("perfect number");
else if (result < 0)
puts("deficient number");
else if (result > 0)
puts("abundant number");
}
} |
#include <iostream>
using namespace std;
int isPerfect(int x) {
int sum = 0;
for(int i = 1; ; i++) {
if(x % i == 0) {
int a = x / i;
if(a == i) {
if(i != x) sum += i;
break;
}
if(a < i) break;
if(a != x) sum += a;
sum += i;
}
}
return x - sum;
}
int main() {
while(1) {
int N;
cin >> N;
if(N == 0) break;
int ans = isPerfect(N);
if(ans > 0) cout << "deficient number" << endl;
else if(ans == 0) cout << "perfect number" << endl;
else if(ans < 0) cout << "abundant number" << endl;
}
return 0;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main (){
int n,a,b;
while(1){
a=0;
cin >>n;
if( n == 0 )break;
for(int i=1; i <= sqrt(n) ; i++){
if( n%i == 0){
if( i == n/i){
a+=i;
}else{
a+=i+n/i;
}
}
}
b=a-n;
if( n == 1 ){
b=0;
}
if( n == b ){
cout <<"perfect number"<<endl;
}else if( n > b ){
cout <<"deficient number"<<endl;
}else if( n < b ){
cout <<"abundant number"<<endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
int main(void)
{
int N;
while(cin>>N){
if(!N) break;
int S=1;
for(int i=2; i*i<=N; i++){
if(!(N%i)){
if(i*i==N) S += i;
else S += i + N/i;
}
}
if(N==1||N>S) cout << "deficient number\n";
else if(N==S) cout << "perfect number\n";
else cout << "abundant number\n";
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
int n;
while(cin >> n, n){
int sum = n!=1;
for(int i = 2; i*i <= n; i++){
if(n%i==0){
sum += i;
if(i*i != n) sum += n/i;
}
}
string s;
if(sum == n){
s = "perfect number";
}else if(sum < n){
s = "deficient number";
}else{
s = "abundant number";
}
cout << s << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int solve(int n) {
int cnt=0;
for(int i=1; i*i<=n; i++) {
if(n%i==0) {
int j=n/i;
if(i!=n) cnt+=i;
if(j!=n && i!=j) cnt+=j;
}
}
return cnt;
}
int main() {
int n;
while(cin >> n && n) {
int c=solve(n);
if(n==c) cout << "perfect number" << endl;
else if(c<n) cout << "deficient number" << endl;
else cout << "abundant number" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n&&n){
int sum=(n==1?0:1);
for(int i=2;i*i<n;++i){
if(n%i==0){
sum+=i;
sum+=(n/i);
}
if(sum>n) break;
}
if(sum==n) cout<<"perfect number"<<endl;
else if(sum<n) cout<<"deficient number"<<endl;
else cout<<"abundant number"<<endl;
}
return 0;
}
|
#include <stdio.h>
#include <math.h>
int main(void){
int i, n, sum;
while(1){
scanf("%d",&n);
if(!n)
break;
sum = 0;
for(i = 1;i <= sqrt((double)n);i++){
if(n % i == 0 && n != 1){
sum += i;
if(i != 1 && i != n / i)
sum += n / i;
}
}
if(sum == n)
printf("perfect number\n");
else if(sum < n)
printf("deficient number\n");
else
printf("abundant number\n");
}
return 0;
} |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
using namespace std;
int main(){
ll N,sum,limit,tmp,calc,count;
while(true){
scanf("%lld",&N);
if(N == 0)break;
if(N <= 5){
printf("deficient number\n");
continue;
}
sum = 1;
limit = sqrt(N);
tmp = N;
calc = 1;
count = 1;
while(tmp%2 == 0){
tmp /= 2;
calc += pow(2,count);
count++;
}
sum *= calc;
for(int i = 3; i <= limit; i+=2){
calc = 1;
count = 1;
while(tmp%i == 0){
tmp /= i;
calc += pow(i,count);
count++;
}
sum *= calc;
}
if(tmp < N && tmp != 1){
sum *= (1+tmp);
}
sum -= N;
if(sum == N){
printf("perfect number\n");
}else if(sum > N){
printf("abundant number\n");
}else{
printf("deficient number\n");
}
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n != 0){
if(n == 1){
cout << "deficient number" << endl;
continue;
}
int sum = 1;
for(int i=2; i*i<=n; i++){
if(n%i == 0) {
if(n/i != i){
sum += (i + n/i);
}else{
sum += i;
}
}
}
if(sum < n) cout << "deficient number" << endl;
if(sum == n) cout << "perfect number" << endl;
if(sum > n) cout << "abundant number" << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n;
while(cin >> n && n){
int score = 0;
for(int i = 1; i * i <= n && i < n; i++){
if(n % i) continue;
score += i;
if(i * i < n && i != 1){
score += n / i;
}
}
if(n == score){
cout << "perfect number\n";
}else if(n > score){
cout << "deficient number\n";
}else{
cout << "abundant number\n";
}
}
}
|
#include <bits/stdc++.h>
#define r(i,n) for(int i=1;i<n;i++)
using namespace std;
int main(){
long long n,p,a,b;
while(cin>>n,n){
long long s=1;
if(n==1)s--;
for(int i=2;i*i<n;i++)if(n%i==0)s+=i+n/i;
if(n<s)cout<<"abundant number"<<endl;
else if(n>s)cout<<"deficient number"<<endl;
else cout<<"perfect number"<<endl;
}
} |
#include<iostream>
#include<cstdio>
int main(){
int n;
while(true){
scanf("%d", &n);
if(n == 0){
break;
}
int sum = 0;
/* 3ツ暗按湘」 */
int i,j;
for(i = 1, j = n; i < j; i++){
if(i == n){
continue;
}
if(n % i == 0){
// ツ姪アツ青板づーツペツアツづつスツつキ
sum += i;
if(i != 1 && i * i != n){
sum += n / i;
j = n / i;
}
}
}
if(n == sum){
printf("perfect number\n");
}
else if(n > sum){
printf("deficient number\n");
}
else{
printf("abundant number\n");
}
}
return 0;
} |
#include<stdio.h>
int main(void){
int n;
while(1){
int i,s=0,squareroot;
scanf("%d",&n);
if(n==0)break;
for(i=1;;i++){
if(i*i<=n&&n<(i+1)*(i+1)){
squareroot=i;
break;
}
}
for(i=1;i<=squareroot;i++){
if(n%i==0){
s+=n/i;
s+=i;
if(i==n/i)s-=i;
}
}
s-=n;
if(n==s)printf("perfect number\n");
else if(n>s)printf("deficient number\n");
else printf("abundant number\n");
}
return 0;
} |
#include<iostream>
#include<string.h>
using namespace std;
int main() {
int n;
while(cin>>n, n) {
int sum = 1;
if(n == 1) sum = 0;
for(int i=2; i*i<=n; ++i) {
if(n%i==0) sum += i + n/i;
if(i*i==n) sum -= i;
}
if(n > sum) cout<<"deficient number"<<endl;
else if(n < sum) cout<<"abundant number"<<endl;
else cout<<"perfect number"<<endl;
}
} |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<climits>
#include<cmath>
using namespace std;
#define MAX 100000010
int n;
void init(){
n=0;
}
bool input(){
cin>>n;
return n;
}
string solve(){
int ans=1;
for(int i=2;i*i<n;i++){
if(n%i==0){
ans+=i+n/i;
}
}
if(n==1)ans=0;
if(ans==n){
return "perfect number";
}else if(ans<n){
return "deficient number";
}else if(ans>n){
return "abundant number";
}
}
int main(){
while(init(),input()){
cout<<solve()<<endl;
}
} |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define EPS 1e-10
using namespace std;
typedef long long llong;
int main() {
int n;
while (cin >> n, n) {
int x = -n;
for (int i = 1; i <= sqrt(n); i++) {
if (n%i == 0) {
x += i;
x += n / i;
}
}
int i;
for (i = 1; i*i <= n; i++) {
if (i*i == n)x -= i;
}
if (x == n)cout << "perfect number" << endl;
else if (x < n)cout << "deficient number" << endl;
else cout << "abundant number" << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int n;
while(std::cin >> n, n){
if(n == 1){
std::cout << "deficient number" << std::endl;
continue;
}
int sum = 1;
for (int i = 2; i*i <= n; i++) {
if(i*i == n)sum += i;
else if(n%i == 0)sum += i + (n/i);
}
if(sum < n){
std::cout << "deficient number" << std::endl;
}else if(sum > n){
std::cout << "abundant number" << std::endl;
}else{
std::cout << "perfect number" << std::endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define LL long long
using namespace std;
int main(){
LL n;
vector<LL> vc;
while(cin>>n){
LL temp=n,res=0;
if(n==0){return 0;}
for(int i=1; i*i<=n; i++){
if(n%i==0){
if(0==n%i){
res+=i;
if(i!=n/i){res+=n/i;}
}
}
}
res-=temp;
cout << (res==temp?"perfect number":res<temp?"deficient number":"abundant number") << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
long long int input;
int ans;
int main(){
while(cin >> input, input){
ans = 0 - input;
for(int i=1; i*i <= input; i++){
if(input % i == 0) ans += i + input/i;
if(i == input/i && input % i == 0) ans -=i;
}
if(ans == input) cout << "perfect number" << endl;
else if(ans < input) cout << "deficient number" << endl;
else cout << "abundant number" << endl;
}
} |
#include<stdio.h>
int main(){
long long int N,i,j,yaku;
while(scanf("%lld",&N)){
if(N==0)break;
yaku=0;
for(i=1;i*i<=N;i++){
if(N%i==0){
yaku+=i+N/i;
}
if(N==i*i){
yaku-=i;
}
if(yaku>2*N)break;
}
//printf("%d\n",yaku);
if(yaku>2*N){
puts("abundant number");
}else if(yaku==2*N){
puts("perfect number");
}else{
puts("deficient number");
}
}
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int N;
while(cin>>N,N){
int sum=0;
int i;
for(i=(int)sqrt(N);i>0;i--){
if(N%i==0){
//cout<<i<<" ";
sum+=i;
if(N!=i*i)sum+=N/i;
}
//if(sum>N)break;
}
sum-=N;
if(sum>N){
cout<<"abundant number"<<endl;
}else if(sum==N){
cout<<"perfect number"<<endl;
}else{
cout<<"deficient number"<<endl;
}
}
return 0;
} |
#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
int main() {
long long a = 6;
while (cin >> a&&a != 0) {
long long sum = 1,a2=a;
int i = 2;
while (a != 1) {
if (a%i == 0) {
int j = 1;
long long sum2 = 1;
while (a%i == 0) {
sum2 += (pow(i, j));
j++;
a /= i;
}
sum *= sum2;
}
if(i==2)
i++;
else i += 2;
}
sum -= a2;
if (a2 == sum) cout << "perfect number" << endl;
else if (a2 > sum) cout << "deficient number" << endl;
else cout << "abundant number" << endl;
}
} |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n, sum;
while(cin >> n, n){
int N = n;
sum = 1;
for(int i = 1; i <= n; i++){
if(n % i == 0) {
int j = 1, temp = 1;
while(n % i == 0 && i != 1){
n /= i;
temp += (int)pow(i,j++);
}
// cout <<"temp"<< temp << endl;
sum *= temp;
}
}
sum -= N;
// cout << sum << endl;
if(sum > N) cout << "abundant number" << endl;
else if(sum < N) cout << "deficient number" << endl;
else cout << "perfect number" << endl;
}
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
while(cin >> n, n)
{
int sum = 0;
int sq = sqrt((double)n);
for(int i=1; i <= sq; i++) {
if(n % i == 0) {
sum += i;
int dev = (n/i);
if(i != dev) sum += dev;
}
}
sum -= n;
if(n > sum) {
cout << "deficient number" << endl;
}
else if(n < sum) {
cout << "abundant number" << endl;
}
else {
cout << "perfect number" << endl;
}
}
return 0;
} |
#include <stdio.h>
int main(){int n,s,i;
for(;;){scanf("%d",&n);if(!n)break;for(i=1;i*i<=n;i++){if(n!=i){if(n%i==0){s+=i;if(i!=n/i){s+=n/i;}}}}if(s<2*n){printf("deficient number\n");}else if(s==2*n){printf("perfect number\n");}else{printf("abundant number\n");}s=0;}
return 0;} |
#include <iostream>
using namespace std;
int main(void){
long long n;
while( cin >> n , n ){
long long total = -n;
for( int i = 1 ; i*i < n ; i++ ){
if( !(n % i) ){
total += i + ( n / i );
}
}
if( n == total ) cout << "perfect number" << endl;
if( n < total ) cout << "abundant number" << endl;
if( n > total ) cout << "deficient number" << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans,i,ika;
scanf("%d",&n);
while(n != 0){
ika = n;
i = 2;
if(n == 1)ans = 0;
else ans = 1;
while(ika > i){
if(n%i == 0){
ans += i;
if(i*i != n) ans += n/i;
ika = n/i;
}
i++;
}
if(ans == n) printf("perfect number\n");
else if(ans < n) printf("deficient number\n");
else if(ans > n) printf("abundant number\n");
scanf("%d",&n);
}
return (0);
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int lli;
int main(){
while(1){
lli n;
cin >> n;
if(n==0) break;
lli s=0;
if(n!=1) s=1;
for(lli i=2; i*i<=n; i++){
if(n%i == 0){
s += i;
s += n/i;
}
if(i*i == n) s -= i;
}
if(n == s){
cout << "perfect number" << endl;
}else if(n > s){
cout << "deficient number" << endl;
}else{
cout << "abundant number" << endl;
}
}
return 0;
}
|
//テストケース100個以下、1 <= n <= 10^8
#include<iostream>
#include<cmath>
using namespace std;
char *out[3] = {"perfect number", "deficient number", "abundant number"};
int main() {
int n;
while( cin >> n ) {
if (!n) break;
int i, s = 0;
for( i = 1; i <= (int)(sqrt((double)n) + 1e-6); i++ ) {
if ( n % i == 0 ) {
s += i;
if ( n/i > i )
s += n/i;
}
}
s -= n;
//cout << s << endl;
if ( n == s )
cout << out[0] << endl;
if ( n > s )
cout << out[1] << endl;
if ( n < s )
cout << out[2] << endl;
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<climits>
#include<cmath>
using namespace std;
#define MAX 100000010
int n;
void init(){
n=0;
}
bool input(){
cin>>n;
return n;
}
string solve(){
int ans=1;
for(int i=2;i*i<n+1;i++){
if(n%i==0){
ans+=i+n/i;
if(i*i==n)ans-=i;
}
}
if(n==1)ans=0;
if(ans==n){
return "perfect number";
}else if(ans<n){
return "deficient number";
}else if(ans>n){
return "abundant number";
}
}
int main(){
while(init(),input()){
cout<<solve()<<endl;
}
} |
#include <iostream>
#include <set>
using namespace std;
int main(){
while(1){
int n; cin>>n;
if(n == 0) return 0;
long long sum = 0;
set<long long> div;
for(int i=1; i*i<=n; i++){
if(n % i == 0){
if(i != n) div.emplace(i);
if(n / i != n) div.emplace(n / i);
}
}
for(auto i:div){
sum += i;
}
if(n == sum){
cout << "perfect number" << endl;
}
else if(n > sum){
cout << "deficient number" << endl;
}
else{
cout << "abundant number" << endl;
}
}
}
|
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main(){
while(1){
long n;
scanf(" %ld", &n);
if(n==0) break;
long s=1;
for(long i=2; i<=sqrt(n); ++i){
if(n%i==0){
if(i==n/i) s+=i;
else s+=i+n/i;
}
}
string ans;
if(n==1 || s<n) ans="deficient number";
else if(s==n) ans="perfect number";
else ans="abundant number";
cout << ans << endl;
}
} |
#include<iostream>
#include<cstdio>
using namespace std;
int n;
int main(void){
while(1){
scanf("%d",&n);
if(n==0)break;
int cnt=1;
for(int i=2;i*i<=n;i++){
if(n%i==0){
cnt+=i;
if(n/i!=i)cnt+=n/i;
}
}
if(n==1)cnt=0;
if(cnt<n)puts("deficient number");
if(cnt==n)puts("perfect number");
if(cnt>n)puts("abundant number");
}
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, i;
while (cin >> n, n) {
int s = -n;
for (i = 1; i * i <= n; i++) {
if (n % i == 0) s += i + n / i;
}
i--;
if (i * i == n) s -= i;
cout << (s == n ? "perfect" : s > n ? "abundant" : "deficient") << " number" << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int a=2;
int tmp=n;
vector<int> ans;
ans.push_back(1);
while((int)sqrt(n)>=a && n!=1){
if(n%a==0){
ans.push_back(a);
if(a!=n/a)
ans.push_back(n/a);
}
a++;
}
int b=0;
for(int i=0;i<ans.size();i++){
if(ans[i]==tmp)continue;
b+=ans[i];
}
if(tmp==b && tmp != 1){
cout << "perfect number" << endl;
}else if(tmp > b){
cout << "deficient number" << endl;
}else{
cout << "abundant number" << endl;
}
}
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
int n;
string hantei(int n) {
int sum = 0;
for (int i = 1; i <= n / 4; i++) {
if (n%i == 0) { sum += i; }
}
if (n % 3 == 0) { sum += n / 3; }
if (n % 2 == 0) { sum += n / 2; }
if (sum < n) { return "deficient number"; }
if (sum == n) { return "perfect number"; }
return "abundant number";
}
int main() {
while (true) {
cin >> n;
if (n == 0) { break; }
cout << hantei(n) << endl;
}
} |
#include <cstdio>
#include <cmath>
int main(){int n,i,r,m;while(scanf("%d",&n)&&n){r=-n;m=sqrt(n);for(i=1;i<=m;i++)if(n%i==0){r+=i+n/i;if(i==n/i)r-=i;}printf("%s\n",n>r?"deficient number":n<r?"abundant number":"perfect number");}} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int sum = 0;
if (N > 1) sum = 1;
for (int i = 2; i <= sqrt(N); i++) {
if (N % i == 0) {
if (i != (N/i))
sum += i + (N/i);
else
sum += i;
}
}
if (sum < N) cout << "deficient number" << endl;
else if (sum == N) cout << "perfect number" << endl;
else cout << "abundant number" << endl;
}
return 0;
} |
#include <cstdlib>
#include <iostream>
using namespace std;
string calc(int n) {
int sum = (n == 1 ? 0 : 1);
for(int i = 2; i * i <= n; ++i) {
if(n % i == 0) {
sum += i;
if(i * i != n) sum += n / i;
}
}
return sum < n ? "deficient number" :
sum == n ? "perfect number" : "abundant number";
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
for(int n; cin >> n && n;) {
cout << calc(n) << endl;
}
return EXIT_SUCCESS;
} |
#include<iostream>
#include<map>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int n;
while(1){
cin >> n;
if(n==0) break;
int sum,hoge=n;
n<2?sum=0:sum=1;
for(int i=2;i< hoge && sum < n;i++){
if(n%i == 0){ //約数
hoge= n/i; //n = i * hoge
if(i!=hoge){
sum += i+hoge;
}else{
sum += i;
}
}
}
if(sum==n)
cout << "perfect number" << endl;
else if(sum < n)
cout << "deficient number" << endl;
else
cout << "abundant number" << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int ans = 1;
for(int i = 2;i*i < n; i++){
if(n%i == 0){
ans += i;
if(n/i != i)ans += n/i;
}
}
if(n != 1 && ans == n){
cout << "perfect number" << endl;
}else if(ans > n){
cout << "abundant number" << endl;
}else{
cout << "deficient number" << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
#define MAX 100000010
int t[100000010];
int main(void){
int n;
while(cin>>n, n){
int sum = 0;
for(int i=1;i<n && i*i<=n;i++){
if(n % i == 0){
sum += i;
if(i != n / i && n / i != n) sum += n / i;
}
}
// cout<<sum<<endl;
cout<<(sum==n ? "perfect" : sum>n ? "abundant" : "deficient")<<" number\n";
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
string solve(int n){
long long int sum=0;
for(int i=1; i*i<=n; ++i){
if(n%i==0&&n!=1){
sum+=i;
if(i!=n/i&&i!=1) sum+=n/i;
}
}
//cout << sum << endl;
if(sum<n) return "deficient number";
else if(n<sum) return "abundant number";
else return "perfect number";
}
int main(){
int N;
while(cin >> N&&N){
cout << solve(N) << endl;
}
} |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
unsigned long long n, sum;
while(cin >> n, n){
sum = -n;
for(int i = 1 ; i * i <= n ; i++){
//cout << "OK" << endl;
if(n % i == 0){
sum += i + n/i;
if(i == n/i) sum -= i;
}
}
if(sum == n) cout << "perfect number" << endl;
else if(sum < n) cout << "deficient number" << endl;
else if(sum > n) cout << "abundant number" << endl;
}
return 0;
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#define INF 999999
using namespace std;
int main(){
int N;
while(cin>>N,N){
if(N==1){cout<<"deficient number"<<endl;continue;}
int S=1;
for(int i=2;i*i<N;i++){
if(N%i==0){S+=i;S+=N/i;}
}
if(N>S)cout<<"deficient number"<<endl;
else if(N<S)cout<<"abundant number"<<endl;
else cout<<"perfect number"<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int sun_factors(int n){
if(n<=1)return 0;
int i,s=1;
for(i=2;i*i<n;i++)
if(n%i==0)s+=i+n/i;
if(i*i==n&&n%i==0)s+=i;
return s;
}
int main(){
int n;
while(cin>>n&&n){
int s=sun_factors(n);
if(s<n)cout<<"deficient number"<<endl;
else if(s==n)cout<<"perfect number"<<endl;
else cout<<"abundant number"<<endl;
}
return 0;
} |
#include<iostream>
int main(){
int n;
while(std::cin>>n,n){
int sum=0;
for(int i=1;i*i<=n;i++){
if(n%i==0){
int j=n/i;
if(i!=n)sum+=i;
if(i!=j&&j!=n)sum+=j;
}
}
if(sum==n)std::cout<<"perfect number"<<std::endl;
else if(sum<n)std::cout<<"deficient number"<<std::endl;
else if(sum>n)std::cout<<"abundant number"<<std::endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define pp pair<int,int>
#define ll long long
#define ld long double
int inf=100000000;
ll INF=4000000000000000000;
ll MOD=1000000007;
int main() {
while (true){
ll a;
cin >> a;
if (a==0) return 0;
ll b=a;
ll ans=1;
for (ll i=2;i<inf;i++){
if (i*i>a) break;
ll aa=1,m=1;
while (true){
if (b%i==0) aa+=pow(i,m);
else break;
b=b/i;
m++;
}
ans=ans*aa;
}
if (b!=1) ans=ans*(1+b);
//cout << "88888" << " " << ans << endl;
if (ans-a==a) cout << "perfect number" << endl;
if (ans-a>a) cout << "abundant number" << endl;
if (ans-a<a) cout << "deficient number" << endl;
}
}
|
// Undone
#include <bits/stdc++.h>
using namespace std;
signed main() {
int N;
while (cin >> N, N) {
int ans = (N == 1) ? 0 : 1;
for (int i = 2; i*i < N; i++) {
if (N % i == 0) {
ans += i + N/i;
}
if (ans > N) break;
}
if (ans == N) {
cout << "perfect number" << endl;
} else if (ans > N) {
cout << "abundant number" << endl;
} else if (ans < N) {
cout << "deficient number" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while (cin >> n, n) {
int s = 0;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
s += i;
if (n / i != n && i * i != n) s += n / i;
}
}
cout << ((s < n || n == 1) ? "deficient number" : s > n ? "abundant number" : "perfect number") << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(1){
cin>>n;
if(n==0) break;
int sum=0;
if(n!=1) sum+=1;
for(int i=2;i*i<n;i++){
if(n%i==0){
sum+=i+n/i;
}
}
if(sum==n){
cout<<"perfect number"<<endl;
}
else if(sum<n){
cout<<"deficient number"<<endl;
}
else cout<<"abundant number"<<endl;
}
return 0;
}
|
//42-47
#include<iostream>
using namespace std;
int main(){
bool cmp[10001]={true,true};
for(int i=2;i<=10000;i++){
if(!cmp[i]){
for(int j=2;i*j<=10000;j++){
cmp[i*j]=true;
}
}
}
for(int n;cin>>n,n;){
int nt=n;
int ans=1;
for(int i=0;i<=10001;i++){
if(!cmp[i]){
int f=1;
int s=1;
while(nt%i==0){
nt/=i;
f*=i;
s+=f;
}
ans*=s;
}
}
if(nt!=1){
ans*=(1+nt);
}
ans-=n;
if(n>ans){
cout<<"deficient number"<<endl;
}else if(n<ans){
cout<<"abundant number"<<endl;
}else{
cout<<"perfect number"<<endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n;
while( cin>>n && n ){
int sum=0;
if( n>1 ) sum=1;
int a,b;
for( int i=2;i<n;i++ ){
if( n%i==0 ){
a=i;
b=n/i;
if( a<b ) sum+=b;
else if( a>b ) break;
sum += a;
}
}
// cout << n << " " << sum << "\t";
if( sum==n )
cout << "perfect number" << endl;
else if( sum<n )
cout << "deficient number" << endl;
else
cout << "abundant number" << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
while(1){
int S = 0;
cin>>N;
if(N == 0) break;
for(int i = 1; i * i < N;i++){
if(N%i == 0){
S += i;
S += N/i;
}
}
if(S - N == N) cout<<"perfect number"<<endl;
else if(S - N > N)cout<<"abundant number"<<endl;
else if(S - N < N)cout<<"deficient number"<<endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;
int main() {
int n;
while(cin >> n,n) {
if (n==1) {
cout << "deficient number" << endl;
continue;
}
int hoge = 1;
for (int i=2; i*i<=n; ++i) {
if (n%i==0) {
if (i*i!=n)
hoge += i+n/i;
else
hoge += i;
}
}
if (hoge<n) {
cout << "deficient number" << endl;
}else if (hoge==n)
cout << "perfect number" << endl;
else
cout << "abundant number" << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define MAX 100000000
int main(){
int n;
while(cin >> n,n){
int tmp=n;
vector<pair<int,int> > pfact;
for(int i=2;i*i<=tmp;++i){
if(tmp%i==0){
int cnt=0;
while(tmp%i==0) cnt++,tmp/=i;
pfact.push_back(make_pair(i,cnt));
}
}
long long sum=1;
for(int i=0;i<pfact.size();++i){
int s;
int a=pfact[i].first,b=pfact[i].second;
if(tmp==i) s=((long long)pow(a,b+2)-1)/(a-1),tmp=0;
else s=((long long)pow(a,b+1)-1)/(a-1);
sum*=s;
}
if(tmp>1) sum*=(tmp+1);
if(n==1) sum=0;
sum-=n;
if(sum==n) cout << "perfect number" << endl;
else if(sum<n) cout << "deficient number" << endl;
else cout << "abundant number" << endl;
}
return 0;
}
|
#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
#define pb push_back
#define fi first
#define sec second
ll pow(ll a,int x)
{
ll res = 1ll;
while(x)
{
if(x&1)res*=a;
a=a*a;
x>>=1;
}
return res;
}
int main()
{
while(1)
{
ll n,N;
vector<P> fac;
scanf("%lld",&n);
if(n==0)break;
N=n;
for(ll i=2;i*i<=n;i++)
{
int cnt=0;
while(n%i==0)
{
n/=i;
cnt++;
}
if(cnt)fac.pb(P(i,cnt));
}
if(n!=1)fac.pb(P(n,1));
ll S=1;
for(int i=0;i<fac.size();i++)S *= (pow(fac[i].fi,fac[i].sec+1)-1)/(fac[i].fi-1);
if(2*N==S)printf("perfect number\n");
else if(2*N>S)printf("deficient number\n");
else printf("abundant number\n");
}
return 0;
} |
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<cstdio>
#include<climits>
#include<iostream>
#include<algorithm>
#include<vector>
#include<deque>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<utility>
#include<queue>
using namespace std;
void solve(int n){
int s = 0;
for(int i = 1;i*i <= n;i++){
if(n % i == 0){
s += i + (n/i);
}
if(i*i == n)s -= i;
}
s -= n;
if(n == 1) cout << "deficient number";
else if(s == n)cout << "perfect number";
else if(s < n)cout << "deficient number";
else if(s > n)cout << "abundant number";
cout << endl;
}
int main(){
ios::sync_with_stdio(false);
int n = 0;
while(cin >> n && n != 0){
solve(n);
}
return 0;
} |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main(){
int N;
while (cin >> N, N) {
vector<int> s;
for (int i = 1; i < sqrt(N); i++) {
if (N % i == 0) {s.push_back(i); s.push_back(N / i);}
}
int S = 0;
for (int i = 0; i < s.size(); i++) {S += s[i];}
S -= N;
if (S - N) {
if (S > N) cout << "abundant number" << endl;
else cout << "deficient number" << endl;
} else {
cout << "perfect number" << endl;
}
}
return 0;
} |
#include <cstdio>
using namespace std;
int main()
{
while(1)
{
int n;
scanf("%d",&n);if(!n)return 0;
int ds=0;
for(int i=1;i*i<=n;++i){
if(!(n%i))ds+=i+(n/i);
if(i*i==n)ds-=i;
}
ds-=n;
if(ds==n)puts("perfect number");
else if(ds<n)puts("deficient number");
else puts("abundant number");
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long n;
while (cin >> n, n) {
long long sum = 0LL;
for (int i = 1; i * i <= n; i++) {
if (n % i) continue;
sum += i;
if (i * i != n) sum += n / i;
}
if (n == 1 || 2 * n > sum) cout << "deficient number\n";
else if (2 * n < sum) cout << "abundant number\n";
else cout << "perfect number\n";
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
int main(){
int n,sum,cnt;
while (true){
cin>>n;
if (n==0) return 0;
sum=cnt=0;
for (int i=1;i<=sqrt(n);i++)
if (n%i==0)
sum+=i+n/i;
if (sqrt(n)==(int)sqrt(n))
sum-=n+(int)sqrt(n);
else
sum-=n;
if (sum==n)
puts("perfect number");
else if (sum<n)
puts("deficient number");
else
puts("abundant number");
}
} |
#include <iostream>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int sum = 0;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (1 < i && i * i < n) {
sum += i + n / i;
} else if (n != 1) {
sum += i;
}
}
}
if (n > sum) {
cout << "deficient number" << endl;
} else if (n < sum) {
cout << "abundant number" << endl;
} else {
cout << "perfect number" << endl;
}
}
} |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int sum=0;
for(int i=2;i*i<=n;i++){
if(n%i==0)sum+=i+n/i;
if(i*i==n)sum-=i;
}
if(n!=1)sum++;
if(sum<n)cout<<"deficient number"<<endl;
else if(sum>n)cout<<"abundant number"<<endl;
else cout<<"perfect number"<<endl;
}
} |
#include <iostream>
#include <math.h>
using namespace std;
void doIt3();
int main(){
doIt3();
}
void doIt3(){
int n;
cin >> n;
while(n != 0){
if(n == 1){
cout << "deficient number" << endl;
cin >> n;
continue;
}
double rt = sqrt(n);
//まず1の処理
int sum = 1;
int i;
for(i = 2; i < rt; i++){
if(n % i == 0){
sum += i;
sum += n / i;
}
}
if((double)i == rt){
sum += i;
}
if(sum == n){
cout << "perfect number" << endl;
}
else if(sum > n){
cout << "abundant number" << endl;
}
else{
cout << "deficient number" << endl;
}
//cout << sum << endl;
cin >> n;
}
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <sstream>
using namespace std;
int main(){
while(true){
long long int n;
cin >> n;
if(n == 0){
break;
}
long long int sum = -n;
for(long long int i = 1; i < n; i++){
if(i * i >= n){
if(i * i == n){
sum += i;
}
break;
}
if(n % i == 0){
sum += i;
sum += n / i;
}
}
if(n > sum){
cout << "deficient number" << endl;
}else if(n == sum){
cout << "perfect number" << endl;
}else{
cout << "abundant number" << endl;
}
}
return 0;
} |
//Perfect Number
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//不足:-1 完全:0 過剰:1
int judge(ll n){
ll sum=0;
for(ll i=1; i*i<=n; i++){
if(n%i==0)sum+=(i+n/i);
if(i==1)sum-=n;
if(i*i==n)sum-=i;
}
if(sum>n)return 1;
if(sum<n)return -1;
return 0;
}
int main(){
ll n;
while(true){
cin >> n;
if(n==0)break;
switch(judge(n)){
case -1 : cout << "deficient number" << endl; break;
case 0 : cout << "perfect number" << endl; break;
case 1 : cout << "abundant number" << endl; break;
}
}
return 0;
} |
#include<stdio.h>
int main(){
int a;
while(scanf("%d",&a),a){
int sum=0;
for(int i=1;i*i<=a;i++){
if(a%i==0)sum+=i+(a/i);
if(i*i==a)sum-=i;
}
if(sum==a+a)printf("perfect number\n");
else if(sum<a+a)printf("deficient number\n");
else printf("abundant number\n");
}
} |
#include<cstdio>
#include<set>
#include<cmath>
#include<iostream>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n),n)
{
set<int> s;
s.insert(1);
for(int i=2;i<sqrt(1.0*n)+2;i++)
{
if(n%i == 0)
{
s.insert(i);
s.insert(n/i);
}
}
set<int>::iterator p;
int sum = 0;
for(p=s.begin();p!=s.end();p++)
{
//cout<<*p<<endl;
sum += *p;
}
if(n<=4) printf("deficient number\n");
else{
if(sum > n) printf("abundant number\n");
else if(sum == n) printf("perfect number\n");
else printf("deficient number\n");
}
}
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n,i,s;
float r;
for(;;){
cin >> n;
if(n==0)break;
if(n==1) {
cout << "deficient number" << endl;
continue;
}
r = sqrt(n);
s = 1;
i = 2;
while(i < r){
if((n % i) == 0) s += i + (n / i);
i++;
}
if(n == s) cout << "perfect number" << endl;
else if(n < s) cout << "abundant number" << endl;
else cout << "deficient number" << endl;
}
return 0;
} |
#include <cstdio>
#include <cmath>
using namespace std;int main(){int n;while(scanf("%d",&n)&&n){int r=-n,m=sqrt(n);for(int i=1;i<=m;i++)if(n%i==0){r+=i+n/i;if(i==n/i)r-=i;}printf("%s\n",n>r?"deficient number":n<r?"abundant number":"perfect number");}} |
#include <iostream>
using namespace std;
int main(){
int N;
while(cin>>N,N!=0){
long long sum=1;
int i;
for(i=2;i*i<N;i++)
if(N%i==0){
sum+=i;
sum+=N/i;
}
if(i*i==N)sum+=i;
if(N==1)sum-=1;
if(N>sum)
cout<<"deficient number"<<endl;
else if(N<sum)
cout<<"abundant number"<<endl;
else
cout<<"perfect number"<<endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
int S = 0;
if (N != 1) S = 1;
for (int i=2; i*i<=N; ++i) {
if (i * i == N) {
S += i;
} else if (N % i == 0) {
S += i;
S += N / i;
}
}
if (N == S) {
cout << "perfect number" << endl;
} else if (N > S) {
cout << "deficient number" << endl;
} else if (N < S) {
cout << "abundant number" << endl;
}
}
return 0;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <cstring>
#include <climits>
#include <queue>
#include <map>
#include <sstream>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define EPS 1e-9
int main(){
long long n;
while(scanf("%lld",&n),n){
long long sum = 1;
long long K = (long long)n;
for(long long i=2; i*i<=n; i++){
if( n%i==0 ){
long long cnt = 1;
for(long long k=(long long)i;n%i==0;n/=i,k*=i)cnt+=k;
sum *= (long long)cnt;
//printf("i:%lld , cnt:%lld , sum:%lld\n",i,cnt,sum);
}
//if( sum-2*K>0 ){ break; }
}
if( n>1 )sum*=(long long)(n+1);
//printf("n:%lld , sum:%lld\n",n,sum);
if( sum-2*K==0 ){
puts("perfect number");
}else if( sum-2*K<0 ){
puts("deficient number");
}else{
puts("abundant number");
}
}
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
while (true) {
int n;
cin >> n;
if (!n) return 0;
int sum = 0;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
sum += i;
if (i * i < n) sum += n / i;
}
}
sum -= n;
if (n == sum) {
cout << "perfect number" << endl;
} else if (n > sum) {
cout << "deficient number" << endl;
} else {
cout << "abundant number" << endl;
}
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum;
while(1){
sum = 0;
cin >> n;
if(n == 0) break;
for(int i=1; i*i<=n; i++){
if(n%i == 0 ){
int j=n/i;
//jは片方の約数
sum += i;
if(j != i ) sum += j;
}
}
sum = sum - n;
if(n==sum) cout << "perfect number" << endl;
if(n>sum) cout << "deficient number" << endl;
if(n<sum) cout << "abundant number" << endl;
}
return 0;
}
|
#include<iostream>
#include<cmath>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
long long s,n;
while(cin>>n,n){
s=1;
loop(i,2,sqrt(n))if(n%i==0){s+=i;s+=(n/i);}
if(n==1)cout<<"deficient number"<<endl;
else if(n>s)cout<<"deficient number"<<endl;
else if(n<s)cout<<"abundant number"<<endl;
else cout<<"perfect number"<<endl;
}
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main(){
long long N;
while(cin >> N, N){
long long s = 0;
for(long long i = 1; i*i <= N; ++i){
if(N%i) continue;
s += i;
if(i != N/i) s += N/i;
}
if(s-N < N) puts("deficient number");
else if(s-N == N) puts("perfect number");
else puts("abundant number");
}
}
|
#include <iostream>
using namespace std;
int main(int argc, char **argv)
{
unsigned int n, tmp, sum;
while(1){
cin >> n;
if(n == 0){
break;
} else if(n == 1){
cout << "deficient number" << endl;
continue;
}
sum = 1;
tmp = n;
for(int i = 2; (i < tmp && sum < n); i++){
if(n % i == 0){
tmp = n/i;
sum += ((i != tmp)? (i+tmp): i);
}
}
if(sum == n){
cout << "perfect number" << endl;
} else if(sum > n){
cout << "abundant number" << endl;
} else {
cout << "deficient number" << endl;
}
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
ll n;
while(cin>>n&&n!=0){
ll S=0;
for(ll i = 1; i*i < n; i++){
if(n%i==0){
S+=i;
if(i!=1)
S+=n/i;
}
}
if(n==S)
cout<<"perfect number"<<endl;
else if(n>S){
cout<<"deficient number"<<endl;
}
else if(n<S)
cout<<"abundant number"<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
signed main() {
int a;
while (scanf("%d", &a), a) {
int p = a;
map<int, int>c;
for (int b = 2; b < sqrt(a); b++) {
while(a%b==0){
a /= b;
c[b]++;
}
}
if (a != 1)c[a]++;
ll s = 1;
for (auto k = c.begin(); k != c.end(); k++) {
int x = 0, y = 1;
for (int z = 0; z <= k->second; z++) {
x += y;
y *= k->first;
}
s *= x;
}
s -= p;
if (p == s)puts("perfect number");
else if (p > s)puts("deficient number");
else puts("abundant number");
}
} |
#include<cstdio>
#include<vector>
#define mp make_pair
#define pb push_back
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(){
static bool era[10000];
for(int i=2;i<100;i++){
if(!era[i]) for(int j=i*i;j<10000;j+=i) era[j]=true;
}
vi pr;
for(int i=2;i<10000;i++) if(!era[i]) pr.pb(i);
for(int n;scanf("%d",&n),n;){
int nn=n;
vector<pii> div;
for(int i=0;i<pr.size()&&n>1;i++){
if(n%pr[i]==0){
int m=0;
do{
n/=pr[i];
m++;
}while(n%pr[i]==0);
div.pb(mp(pr[i],m));
}
}
if(n>1) div.pb(mp(n,1));
long long dsum=1;
for(int i=0;i<div.size();i++){
int d=div[i].first,m=div[i].second;
long long tmp=1;
for(int j=0;j<m+1;j++) tmp*=d;
dsum*=(1-tmp)/(1-d);
}
dsum-=nn;
puts(nn==dsum?"perfect number":nn<dsum?"abundant number":"deficient number");
}
return 0;
} |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
vector<long long int> divisor(long long int n) {
vector<long long int> res;
for (long long int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
res.push_back(i);
if (i * i != n) res.push_back(n / i);
}
}
sort(begin(res), end(res));
return res;
}
int main() {
while (1) {
long long int N; cin >> N;
if (!N)break;
auto v(divisor(N));
long long int sum = accumulate(v.begin(), v.end(), 0ll);
if (sum > 2 * N)cout << "abundant number" << endl;
else if (sum == 2 * N)cout << "perfect number" << endl;
else cout << "deficient number" << endl;
}
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
void solve()
{
int N;
while(cin >> N, N)
{
if(N == 1)
{
cout << "deficient number" << endl;
continue;
}
double rt = sqrt((double)N);
int sum = 1;
for(int i = 2; i <= rt; ++i)
{
if(i == rt && N % i == 0)
{
sum += i;
}
else if(N % i == 0)
{
sum += i + N / i;
}
}
if(sum < N)
{
cout << "deficient number" << endl;
}
else if(sum > N)
{
cout << "abundant number" << endl;
}
else
{
cout << "perfect number" << endl;
}
}
}
int main()
{
solve();
return(0);
} |
#include<iostream>
using namespace std;
int solve(int& n){
if(n==1) return 0;
int m=1;
for(int i=2; i*i<n; ++i){
if(!(n%i)){
m+=i;
if(i!=n/i) m+=n/i;
}
}
return m;
}
int main(){
int n, m;
while(cin >> n && n){
m = solve(n);
if(n==m) cout << "perfect number" << endl;
else if(n<m) cout << "abundant number" << endl;
else cout << "deficient number" << endl;
}
return 0;
} |
#include<cstdio>
#include<cmath>
int yaksu(int a){
if (a==1) return 1;
int res=a;
for(int i=sqrt(a);i>0;i--){
if(a%i==0){
res-=i;
if(i!=a/i&&i!=1) res=res-a/i;
}
if(res<0) break;
}
return res;
}
int main(){
int a,tk;
while(1){
scanf("%d",&a);
if(a==0) return 0;
tk=yaksu(a);
if(tk>0) printf("deficient number\n");
else if(tk==0) printf("perfect number\n");
else printf("abundant number\n");
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long x,sum = 0;
while(cin >> x){
if(x==0){break;}
sum = 0;
double n = pow(x, 1.0/2);
for(int i = 1; i< n; ++i){
if(x % i == 0){
sum += i;
if(i != 1){sum+=x/i;}
}
if(i == n-1){sum += n;}
}
if(x > sum){
cout << "deficient number" << endl;
}else if(x < sum){
cout << "abundant number" << endl;
}else{
cout << "perfect number" << endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.