标签:track for return clu acm htm print i+1 class
题目:点击打开链接
#include<stdio.h> int main() { int t; scanf("%d",&t); while(t--) { int a=0; int m,n; while(scanf("%d%d",&n,&m)) { if(m==0&&n==0) break; a++; int i,j,k,z=0; for(i=1;i<n;i++) for(j=i+1;j<n;j++)//(1 2) (2 1) 看作一种情况 if((i*i+j*j+m)%(i*j)==0) { z++; } printf("Case %d: %d\n",a,z); } if(t)//略坑 printf("\n"); } return 0; }
Hdu oj 1017 A Mathematical Curiosity
标签:track for return clu acm htm print i+1 class
原文地址:http://www.cnblogs.com/gccbuaa/p/6910427.html