第十届ACM省赛-F Binary to Prime

问题 F: Binary to Prime

时间限制: 1 Sec  内存限制: 128 MB
[提交][状态][讨论版]

题目描述

To facilitate the analysis of  a DNA sequence,  a DNA sequence is represented by a binary  number. The group of  DNA-1 has discovered a great new way .  There is a certain correlation between binary number and prime number. Instead of using the ordinary decadic numbers, they use prime base numbers. Numbers in this base are expressed as sequences of zeros and ones similarly to the binary numbers, but the weights of bits  in the representation are not powers of two, but the elements of the primes  ( 2, 3, 5, 7,... ).

 

For example  01101 , ie. 2+5+7=14

 

Herefore, it is necessary to convert the binary number to the sum of prime numbers 

输入

The input consists of several instances, each of them consisting of a single line. Each line of the input contains a 01 string, length of not more than 150.  The end of input is not marked in any special way.

输出

For each test case generate a single line containing a single integer , The sum of the primes.

样例输入

000010

0011

11001

样例输出

3520

暴力 不解释

#include <iostream>
#include <string.h>
#include <cstdio>
using namespace std;
int v[200];

int main()
{
    int i,j,t=0;
    for (i=2; i<10000; i++)
    {
        for (j=2; j<i; j++)
        {
            if (i%j==0)
                break;
        }
        if (i==j)
        {
            v[t] = i;
            t++;
        }

    }
    char a[1000];
    while (scanf("%s",a)!=EOF)
    {
        long long int sum=0;
        int n = strlen(a);
        for (i=n-1;i>=0;i--)
        {
            if (a[i]=='1')
                sum += v[n-i-1];
        }
        printf ("%lld\n",sum);
    }
    return 0;
}