PKU 2649. Factovisors. AC 소인수분해

#include <stdio.h> #include <math.h> int m,n; int is_prime(int m) { int i, sqrn; sqrn=sqrt(m); for(i=2 ; i<=sqrn ; i+=1) { if(m % i == 0) { return 0; } } return 1; } int decomposition(int a) { int i, count=0; for(i=2;a>1;) { if(a%i==0) { a/=i; count++; } if(a%i!=0 || a==1) { if(count>0) { if(n/i<count) return 0; count=0; } i++; } } return 1; } main() { while( scanf("%d %d", &n, &m) != EOF ) { if(m==0) { printf("%d does not divide %d!\n",m,n); continue; } if(m <= n || (n==0&&m==1)) { printf("%d divides %d!\n",m,n); continue; } else { if(is_prime(m)) { printf("%d does not divide %d!\n",m,n); continue; } if(decomposition(m)) printf("%d divides %d!\n",m,n); else printf("%d does not divide %d!\n",m,n); } } }

Run ID	User	Problem	Result	Memory	Time	Language	Code Length	Submit Time
4188387	jht009	2649	Accepted	832K	94MS	C	1045B	2008-10-07 18:52:10

흐흐흐흐흐흐흐

수많은 뻘짓끝에 해냈습니다.

/*땜빵용 주석을 제거하니 크기가 반으로 줄어버리네요*/