PAT1049、1048、1047

1049

#include<stdio.h>
#include<stdlib.h>

long long howmanyones1(int N)
{
    int temp=N;
    int i=0;
    int dec[20];
    int o[10]={1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000};
    while(temp>0)
    {
        dec[i++]=temp%10;
        temp/=10;
    }
    long long ones=0;
    i--;
    while(i>0)
    {
        int d=dec[i];
        if(d==1)
            ones+=o[i-1]*i+N-o[i]+1;
        else if(d!=0)
            ones+=d*o[i-1]*i+o[i];
        N-=d*o[i];
        i--;
    }
    if(dec[0]>0)
        ones++;
    return ones;
}

int main(void)
{
    int N;
    scanf("%d",&N);

    printf("%ld",howmanyones1(N));

    return 0;
}

---

1048

#include<stdio.h>
#include<stdlib.h>
using namespace std;

int compare(const void *data1,const void *data2)
{
    int *ptr1=(int*)data1;
    int *ptr2=(int*)data2;
    return ptr1[0]>=ptr2[0];
}
int search(int key,int *v, int n)
{
    int left=0,right=n;
    while(right>left)
    {
        int mid=(right+left)/2;
        int key1=v[mid];
        if(key1<key)
            left=mid+1;
        else if(key1>key)
            right=mid;
        else
            return key1;
    }
    return v[left];
}
int main(void)
{
    int N,M;
    scanf("%d %d",&N,&M);
    int *v=(int*)malloc(sizeof(int)*N);
    int i;
    for(i=0;i<N;i++)
        scanf("%d",v+i);
    qsort(v,N,sizeof(int),compare);

    for(i=0;i<N-1;i++)
    {
        int t=M-v[i];
        int t1=search(t,v+i+1,N-i-1);
        if(t1==t)
        {
            printf("%d %d",v[i],t1);
            return 0;
        }
    }
    printf("No Solution");
    return 0;
}

---

1047

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

int N, K;
struct people{
    char name[5];
    int id;    
}str[40001];

int cnt[2501];
vector<int> buf[2501];
char bucket[40001];

bool mycmp(const struct people &a, const struct people &b) {
    return strcmp(b.name, a.name)>0;
}

int main(int argc, char * argv[]) {
    scanf("%d %d", &N, &K);
    int tmp;
    int k;
    for (int i=1; i<=N; ++i) {
        str[i].id = i;
        scanf("%s %d", str[i].name, &tmp);
        for (int j=0; j<tmp; ++j) {
            scanf("%d", &k);    
            ++cnt[k];
            buf[k].push_back(i);
        }
    }
    sort(str+1, str+1+N, mycmp);
    vector<int>::iterator itr;
    for (int i=1; i<=K; ++i) {
        printf("%d %d
", i, cnt[i]);
        
        for (itr = buf[i].begin(); itr != buf[i].end(); ++itr) {
            bucket[*itr] = 1;
        }
        for (int j=1; j<=N; ++j) {
            if (bucket[str[j].id]) {
                printf("%s
", str[j].name);
            }    
        }
        for (itr = buf[i].begin(); itr != buf[i].end(); ++itr) {
            bucket[*itr] = 0;
        }
    }
    return 0;
}