第十届河南acm省赛F: Binary to Prime

最新推荐文章于 2022-10-07 20:50:36 发布

原创最新推荐文章于 2022-10-07 20:50:36 发布 · 376 阅读

1 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

37 篇文章

订阅专栏

本文介绍了一种使用素数基数而非十进制来表示DNA序列的方法，并提供了一个具体的算法实现示例，该方法将DNA序列转换为素数基数表示形式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

样例输入

样例输出

以素数作为权值，2 3 5 7....；

如第一个 0*2+1*3+0*5...=3；

         1*2+1*3+0*5+0*7=5；

所以素数筛，直接乘法相加；

#include<iostream>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int b[155];
int prime(int n)
{
    int i;
    if(n==0||n==1)
        return -1;
    if(n==2||n==3)
        return 1;
    for(i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return -1;//不是
    }
    return 1;
}
int main()
{
    int k,kk=0,i;
    for(k=0;k<1000;k++)
    {
        if(prime(k)==1)
           b[kk++]=k;
    }
    char a[155];
    while(scanf("%s",a)!=EOF)
    {
        int i,j,len;
        long long int s=0;
        len=strlen(a);
        for(i=len-1;i>=0;i--)
            s+=(a[i]-'0')*b[len-1-i];
        printf("%lld\n",s);
    }
    return 0;
}