1 solutions
-
0
C :
#include <stdio.h> int main() { int m, n, i; scanf("%d %d", &m, &n); if(m > n) { for(i = n; i > 1; i --) { if(m % i == 0 && n % i == 0) { printf("%d", i); break; } } } if(n > m) { for(i = m; i > 1; i --) { if(m % i == 0 && n % i == 0) { printf("%d", i); break; } } } return 0; }C++ :
#include<stdio.h> int main() { int m,n,a,b,i; scanf("%d %d",&m,&n); if(m>n) { a=m; b=n; } else { a=n; b=m; } i=b; while(i>=1) { if(a%i==0&&b%i==0) { printf("%d\n",i); break; } i--; } return 0; }Pascal :
var m,n,a,b,r:integer; begin readln(m,n); a:=m;b:=n; r:=a mod b; while r<>0 do begin a:=b; b:=r; r:=a mod b; end; write(b); end.
- 1
Information
- ID
- 17681
- Time
- 1000ms
- Memory
- 12MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By