0
Your rating: None
CodeChef submission 812884 (C) 

CodeChef submission 812884 (C) plaintext list. Status: TLE, problem D4, contest . By maxstell (maxstell), 2012-01-31 10:03:30.
  1. #include<stdio.h>
  2. int gcd(int a,int b) 
  3. { 
  4. int temp;
  5. while(b){
  6.          temp=a%b;
  7.          a=b;
  8.          b=temp;
  9.          }
  10.          return(a);
  11.          }
  12. int isprime(int p){
  13. int i;
  14. if(p==1)
  15. return 0;
  16. if(p==2)
  17. return 1;
  18. for(i=2;i<p;i++){
  19. if(p%i==0){
  20. return 0;
  21. }
  22. }
  23. return 1;
  24. }
  25. main(){
  26. int a,b,i,j,count=0;
  27. int c[200][200];
  28. char ch;
  29. scanf("%d",c);
  30. do{
  31.               count=0;
  32. scanf("%d %d",&a,&b);
  33. for(i=0;i<a;i++){
  34.                  for(j=0;j<b;j++){
  35.                                   c[i][j]=gcd(i+1,j+1);
  36.                                   if(isprime(c[i][j])){
  37.                                                  count++;
  38.                                                  }
  39.                                                  }
  40.                                                  }
  41. printf("%d",count);
  42. scanf("%c",&ch);
  43. }
  44. while(ch=='\n');
  45.  
  46.  
  47. }
  48.

Comments