1 条题解
-
0
C :
#include<stdio.h> int main() { int N,c,i,j,sum,t,c1,ch; scanf("%d",&N); ch=32; for(i=5;i<N;i++) { sum=0; for(j=1;j<i;j++) { c=i%j; if(c==0) { sum=sum+j; } else { continue; } } if(sum==i) { printf("%d",i); printf("%c",ch); printf("its factors are "); for(t=1;t<i;t++) { c1=i%t; if(c1==0) { printf("%d ",t); } else { continue; } } printf("\n"); } } return 0; }
C++ :
#include <stdio.h> #include<string.h> void judge(int a) { int i,s=0; for(i=1; i<a; i++) { if(a%i==0) s=s+i; } if(s==a) { printf("%d its factors are",a); for(i=1; i<a; i++) { if(a%i==0) printf(" %d",i); } printf(" \n"); } return; } int main() { int n,i,j; scanf("%d",&n); for(i=2; i<=n; i++) { judge(i); } return 0; }
Pascal :
var n,i,j,s:longint; begin readln(n); for i:=1 to n do begin s:=0; for j:=1 to i-1 do if i mod j=0 then s:=s+j; if s=i then begin write(i,' its factors are '); for j:=1 to i-1 do if i mod j=0 then write(j,' '); writeln; end; end; end.
- 1
信息
- ID
- 1757
- 时间
- 20000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- (无)
- 递交数
- 0
- 已通过
- 0
- 上传者