歼灭弱题13

ZOJ 1949 原来是个弱题
#include <iostream>
using namespace std;
int main()
{
    bool ff;
    int n,i,j,a,b;
    int R[101][101];
    while(cin >> n)
    {
        if(n==0) break;
        for(i=0;i<n;++i)
        {
            R[i][100] = 0;
            for(j=0;j<n;++j)
            {
                cin >> R[i][j];
                R[i][100] += R[i][j];
            }
        }
       
        for(i=0;i<n;++i)
        {
            R[100][i] = 0;
            for(j=0;j<n;++j)
            {
                R[100][i] += R[j][i];
            }
        }
        a = b = -1;ff = false;
        for(i=0;i<n;++i)
        {
            if(R[100][i]%2!=0)
            {
                if(a==-1)
                    a = i;
                else
                {
                    ff = true;
                    break;
                }
            }
            if(R[i][100]%2!=0)
            {
                if(b==-1)
                    b = i;
                else
                {
                    ff = true;
                    break;
                }
            }
        }
        if(ff == true)
        {
            cout << "Corrupt" << endl;
        }
        else if((a == -1)&&(b == -1))
        {
            cout << "OK" << endl;
        }
        else
        {
            cout << "Change bit (" << b+1 << "," << a+1 << ")" << endl;
        }
    }
    return 0;
}

ZOJ 1337 Pi
题目怪怪的
#include <iostream>
#include <math.h>
#include <iomanip>
using namespace std;
bool RR(int a,int b)
{
 int x = a;int y = b;
 int t;
 while(b!=0)
 {
  t = a%b;
  a = b;
  b = t;
 }
 if(a==1&&a!=x&&a!=y)
  return true;
 else
  return false;
}
int main()
{
 int n,t,*r,i,j,cnt;
 while(cin >> n)
 {
  if(n==0) break;
  t = n;i = 0;cnt = 0;
  r = new int[n];
  while(t--)
  {
   cin >> r[i];
   i++;
  }
  for(i=0;i<n-1;++i)
   for(j=i+1;j<n;++j)
   {
    if(RR(r[i],r[j]))
     cnt++;
   }
  if(cnt==0)
   cout << "No estimate for this data set." << endl;
  else
   cout << setiosflags(ios::fixed) << setprecision(6) << sqrt(((double)3*n*(n-1))/cnt) << endl;
  delete[] r;
 }
 return 0;
}