Algorithm used Euclidean GCD (Click the link for Tutorial).
Solution :
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /// Author : shohan | |
| /// Problem Type : Math (GCD) | |
| /// URI -- 1028 | |
| #include<stdio.h> | |
| int main() | |
| { | |
| int a,b,c,i,j,temp,temp1,tcase; | |
| while(scanf("%d",&tcase)==1){ | |
| for(i=1;i<=tcase;i++){ | |
| scanf("%d %d",&a,&b); | |
| if(a<b){ | |
| temp1=a; | |
| a=b; | |
| b=temp1; | |
| } | |
| while(a%b!=0){ | |
| temp=a; | |
| a=b; | |
| b=temp%b; | |
| } | |
| printf("%d\n",b); | |
| temp=0; | |
| } | |
| } | |
| return 0; | |
| } |
