C++博客-Feng-随笔分类-water

统计数字

Going — Sun, 24 May 2009 11:43:00 GMT

//用于计算从0到某个数字n中用到(0,1,2,3,4,5,6,7,8,9)的个数
//使用前注意将数组a初始化为0,即每个数字出现的个数是0
void Count(int a[10],int n)  //结果存在a数组中.其中a[0]存0的个数…
{
    int i,m,b,l,p;
    b=1;
    l=0;
    p=0;
    while(n)
    {
        p=p*10+1;
        m=n%10;
        n=n/10;
        for(i=0;i<m;i++)
            a[i]+=b;
        a[m]=a[m]+l+1;
        for(i=0;i<10;i++)
            a[i]+=n*b;
        l=l+m*b;
        b=b*10;
    }
    a[0]=a[0]-p;
}

Going 2009-05-24 19:43 发表评论

zju 2301 Color the Ball

Going — Mon, 18 May 2009 12:11:00 GMT

摘要: #include#include#include#include#includeusing namespace std;typedef struct node{ ... 阅读全文

Going 2009-05-18 20:11 发表评论

hdu 2371 Decode the Strings

Going — Sat, 16 May 2009 02:11:00 GMT

#include<iostream>
#include<string>
#include<cstdio>
using namespace std;

int st[83][83];

int main()
{
    int n;
    __int64 m;
    while(scanf("%d%I64d",&n,&m) != EOF)
    {
        if(n == 0 && m == 0)
            break;
        int i,j,pp;
        char str[90],temp[83];
        int sh[83],xia[83];
        for(i = 0;i < n;i++)
        {
           scanf("%d",&pp);
           pp--;
           sh[i] = pp;
           xia[pp] = i;//
        }
        getchar();
        cin.getline(str,82,'\n');
        for(i = 0; i < n;i++)
        {
            j = xia[i];
            pp = 1;
            while(i != j)
            {
                st[i][pp++] = j;
                j = xia[j];
            }
            st[i][pp] = st[i][pp+1] = j;
            st[i][0] = pp;//循环次数
        }
        for(i = 0; i < n;i++)
        {
            if(m % st[i][0] == 0)
                pp = st[i][0];
            else
            {
                pp = m % st[i][0];
                pp = st[i][0] - pp;
            }
            temp [st[i][pp]] = str[i];
        }
    temp[n] = '\0';
    printf("%s\n",temp);
    }
    return 0;
}

Going 2009-05-16 10:11 发表评论

hdu 2734 A Game with Marbles

Going — Thu, 14 May 2009 02:07:00 GMT

#include<iostream>
#include<cstdio>
using namespace std;

__int64 a[51];
__int64 sum;

int main()
{
    int n;
    while(cin>>n)
    {
        if(n == 0)
            break;
        int i;
        sum = 0;
        for(i = 1;i <= n;i++)
            scanf("%I64d",&a[i]);
        while(n > 0)
        {
            for(i = 1; i < n;i++)//从最后开时一次往i-1加a[i]
                a[i] = a[i] + a[n];
            sum = sum + a[n];
            n--;
        }
        printf("%I64d\n",sum);
    }
    return 0;
}

Going 2009-05-14 10:07 发表评论

zju 2669 Romantic

Going — Fri, 08 May 2009 01:41:00 GMT

#include<iostream>
using namespace std;

int exgcd(int a,int b,int &x,int &y)//求最大公约数
{
    if(b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    int r = exgcd(b,a%b,x,y);
    int t = x;
    x = y;
    y = t - a/b*y;
    return r;
}

int main()
{
    int a,b,m,n,r;
    while(cin>>a>>b)
    {
        int i;
        r = exgcd(a,b,m,n);
        if(r == 1)
        {
            while(m < 0)
            {
                m += b;
                n -= a;
            }
            printf("%d %d\n",m,n);
        }
        else
            cout<<"sorry"<<endl;
    }
    return 0;
}

Going 2009-05-08 09:41 发表评论

zju 2107 Quoit Design

Going — Thu, 07 May 2009 06:33:00 GMT

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

typedef struct
{
    double x;
    double y;
}pttype;

const long maxsize = 100000;

long arr[maxsize];
long arr1;
pttype pt[maxsize];

int sortcmp(const void *a, const void *b)
{
    if (((pttype*)a)->x < ((pttype*)b)->x)
        return -1;
    else
        return 1;
}

double dis(pttype a,pttype b)
{
    return sqrt((a.x - b.x)*(a.x - b.x) + (a.y - b.y)*(a.y - b.y));
}

double getMin(double a, double b)
{
    if(a<b)
        return a;
    else
        return b;
}

int arrcmp(const void *a, const void *b)
{
    if (pt[*(int*)a].y < pt[*(int*)b].y)
        return -1;
    else
        return 1;
}

double shortest(long left,long right)
{
    if(right-left == 1)
        return dis(pt[left],pt[right]);
    if(right-left == 2)
        return getMin(getMin(dis(pt[left], pt[left+1]), dis(pt[left], pt[right])), dis(pt[left+1], pt[right]));
    long i,j,mid = (left + right) >> 1;
    double curmin = getMin(shortest(left,mid),shortest(mid +1 ,right));
    arr1 = 0;
    for (i = mid; i >= left && pt[mid+1].x - pt[i].x <= curmin; i --)
        arr[arr1++] = i;
    for (i = mid + 1; i <= right && pt[i].x - pt[mid].x <= curmin; i ++)
        arr[arr1++] = i;
    qsort(arr, arr1, sizeof(arr[0]), arrcmp);
    for (i = 0; i < arr1; i ++)
        for (j = i + 1; j < arr1 && pt[arr[j]].y - pt[arr[i]].y <= curmin; j ++)
            curmin = getMin(curmin, dis(pt[arr[i]], pt[arr[j]]));
    return curmin;
}

int main()
{
    long n,i;
    while(1)
    {
        scanf("%d",&n);
        if(n == 0)
            break;
        for(i = 0;i < n;i++)
            scanf("%lf%lf",&pt[i].x,&pt[i].y);
        qsort(pt,n,sizeof(pt[0]),sortcmp);
        printf("%.2lf\n",shortest(0,n-1)/2);
    }
    return 0;
}

Going 2009-05-07 14:33 发表评论

zju 2967 Colorful Rainbows

Going — Wed, 06 May 2009 10:15:00 GMT

#include<iostream>
#include<cstdio>
#include<vector>
#include<stack>
#include<cmath>
#include<algorithm>
using namespace std;

const double eps = 1E-6;//误差限

struct Line
{
    double a;
    double b;
};

struct Point
{
    double x;
    double y;
};

void readReal(double &v)
{
    scanf("%lf",&v);
}

bool operator < (Line const &l1,Line const &l2)
{ //斜率为主序（从小到大）
    if(l1.a < l2.a)
        return true;
    if(l1.a > l2.a)
        return false;
    //截距为次序（从大倒小，也即从高到低）
    return l1.b > l2.b;
}

double y_at_x(Line const &line,double x)
{//返回直线line在x处的y值
    return line.a*x + line.b;
}

Point intersection(Line const &l1,Line const &l2 )
{//求直线l1和l2的交点
    Point p;
    p.x = (l1.b - l2.b)/(l2.a - l1.a);
    p.y = y_at_x(l1,p.x);
    return p;
}

int count(vector<Line> &L)
{//统计有多少条可见彩虹
    if(L.size() < 2) // 处理平凡情形
        return L.size();
    // 处理非平凡情形
   // 首先对直线按斜率递增排序(平行时截距大者优先)
    sort(L.begin(),L.end());
    stack<Line> lines;// 半平面所交凸域的边所在直线
    stack<Point> points;// 半平面所交凸域的顶点
    lines.push(L.front());// 添加第一条直线作为约束
    for(vector<Line>::iterator iter = L.begin() + 1;iter != L.end();iter++)
    {// 不断添加直线约束
        while(!points.empty())// 去除多余约束 -- 注意误差处理
        {// 先处理出现平行直线的情形
            if(fabs(iter->a - lines.top().a) < eps)
                break;
            // 处理不含平行直线的情形
            Point tmp = points.top();
            if(y_at_x(*iter,tmp.x) < tmp.y - eps)
                break;
            else
            {
                lines.pop();
                points.pop();
            }
        }
        // 添加当前非平行直线作为新的约束
        if(fabs(iter->a - lines.top().a) > eps)
        {
            points.push(intersection(*iter,lines.top()));
            lines.push(*iter);
        }
    }
    // 凸域的边数即是题目要求解的“可见”彩虹条数
    return lines.size();
}

int main()
{
    int text;
    cin>>text;
    while(text--)
    {
        int n;
        int i;
        scanf("%d",&n);
        vector<Line> L(n);//直线集合
        for(i = 0;i < n;i++)
        {
            readReal(L[i].a);
            readReal(L[i].b);
        }
        printf("%d\n",count(L));
    }
    return 0;
}

Going 2009-05-06 18:15 发表评论

zju 2976 Light Bulbs

Going — Sun, 03 May 2009 12:38:00 GMT

#include<iostream>
#include<cmath>
using namespace std;

typedef struct node
{
    double x,y,z;
    double I;
}Node;

Node point[101];

double distence(Node c,double a,double b)
{
    double sum = (c.x - a)*(c.x - a)+(c.y - b)*(c.y - b)+c.z*c.z;//计算光源点到地面点的距离
    return sum;
}

int main()
{
    int text;
    cin>>text;
    while(text--)
    {
        int n;
        int i,j,k;
        cin>>n;
        double maxs = 0.0;

        for(i =1; i <= n;i++)
            cin>>point[i].x>>point[i].y>>point[i].z>>point[i].I;
        for(i = -100;i <= 100;i++)//枚举xy平面上从-100到100的xy所有的点，找出最大的
            for(j = -100;j <= 100;j++)
            {
                double sum = 0.0;
                for(k = 1;k <= n;k++)
                {
                    double R;
                    R =  distence(point[k],i,j);
                    sum += (point[k].I /(R))*(point[k].z/sqrt(R));//计算光强度
                }
                if(sum > maxs)
                    maxs = sum;
            }
    printf("%.2lf\n",maxs);
    }
    return 0;
}

Going 2009-05-03 20:38 发表评论

hdu 1059 Windows Message Queue

Going — Thu, 23 Apr 2009 05:08:00 GMT

#include<iostream>
#include<queue>
#include<string>
using namespace std;

typedef struct node
{
    string ss;
    int par;
    int pri;
    int num;
    friend bool operator < (node a,node b)
    {
        if(a.pri != b.pri)
            return a.pri > b.pri;
        else
            return a.num >b.num;
    }
}Node;

int main()
{
    string str;
    priority_queue<Node> Q;
    int k=1;
    while(cin>>str)
    {
        Node p,q;
        if(str == "GET")
        {
            if(!Q.empty())
            {
                q = Q.top();
                Q.pop();
                cout<<q.ss<<" "<<q.par<<endl;
            }
            else
            {
                cout<<"EMPTY QUEUE!"<<endl;
            }
        }
        if(str == "PUT")
        {
            string str1;
            int a,b;
            cin>>str1>>a>>b;
            p.ss = str1;
            p.par = a;
            p.pri = b;
            p.num = k;
            Q.push(p);
            k++;
        }
    }
    return 0;
}

Going 2009-04-23 13:08 发表评论