Turing Tape - CodeForces 132A - Virtual Judge (csgrandeur.cn)
题意:
记录一个数字的前n个二进制数表示的十进制数
int t=s[i];
LL y=0;
for(int j=1;j<=n;j++)
{
y=y*2+t%2;
t/=2;
}
思路:记录每个字符的前八个2进制反转表示的十进制数,再模拟推公式即可
(a[i-1]-a[i])%256=res
#include<bits/stdc++.h>
#define x first
#define gcfx main
#define y second
#define mak make_pair
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define debug(a) cout<<a<<'\n'
#define endl '\n'
#define umap unordered_map
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
const int N=2e5+10,M=1,inf=0x3f3f3f3f,mod=1e9+7;
string s;
int a[N];
int gcfx()
{
IOS;
getline(cin,s);
for(int i=0;i<s.size();i++)
{
int t=s[i];
LL y=0;
for(int j=1;j<=8;j++)
{
y=y*2+t%2;
t/=2;
}
a[i+1]=y;
}
for(int i=1;i<=s.size();i++)
{
int x=a[i-1],y=a[i];
x-=y;
if(x<0) x+=256;
cout<<x<<endl;
}
return 0;
}