[题目链接] (http://codeforces.com/contest/490)
C题 :
就是对公式
(a+b)%p =( a%p + b%p ) % p ;
(a*b) % p = ( (a%p) * (b%p) ) % p;
运用
假设一个数156,我们要取模一个数mod。
我们可以变为 1 * 100 % mod + 5 * 10 % mod + 6 % mod;
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6+10;
char s[maxn];
int a,b;
int s1[maxn],s2[maxn];
int main()
{
scanf("%s",s+1);scanf("%d%d",&a,&b);
int n = strlen(s+1);
s1[1] = (s[1]-'0') % a;
for(int i=2;i<=n;i++)
{
s1[i] = (s1[i-1] * 10 % a + (s[i]-'0') % a) % a;
}
s2[n] = (s[n]-'0') % b;
int p = 10;
for(int i=n-1;i>=1;i--)
{
s2[i] = ((s[i]-'0')* p % b + s2[i+1] % b) % b ;
p = p * 10 % b;
}
int ans = 1e9;
for(int i=1;i<n;i++)
{
if(s1[i]==0&&s2[i+1]==0&&s[i+1]!='0'){
ans = i;break;
}
}
if(ans==1e9) puts("NO");
else {
puts("YES");
for(int i=1;i<=ans;i++)printf("%c",s[i]);puts("");
for(int i=ans+1;i<=n;i++)printf("%c",s[i]);puts("");
}
}
D题:
用map记录每条边能够到达的状态,同时还要记录每条边到达改状态的次数,再把每两条边对应的面积记录下来,同时记录次数。
#include<bits/stdc++.h>
#define ll long long
using namespace std;
map<int,int> s1,s2,s3,s4;
map<ll,int>mp,tmp;
void dfs(int p,int c,map<int,int>&s){
if(!s.count(p)) s[p] = c ;
else {
s[p] = min(s[p],c); return;
}
if(p%2==0) dfs(p/2,c+1,s);
if(p%3==0) dfs(p-p/3,c+1,s);
}
int main()
{
ll a1,b1,a2,b2;scanf("%lld%lld%lld%lld",&a1,&b1,&a2,&b2);
dfs(a1,0,s1),dfs(b1,0,s2),dfs(a2,0,s3),dfs(b2,0,s4);
map <int,int>::iterator it1,it2;
for(it1=s1.begin();it1!=s1.end();it1++)
for(it2=s2.begin();it2!=s2.end();it2++)
{
ll res = 1LL * it1->first * it2->first;
int tt = it1->second + it2->second;
if(!mp.count(res)||tt<mp[res])
{
mp[res] = tt;
tmp[res] = it1->first;
}
}
int ans = 1e9,ans1,ans2,ans3,ans4;
for(it1=s3.begin();it1!=s3.end();it1++)
for(it2=s4.begin();it2!=s4.end();it2++){
ll res = 1LL * it1->first * it2 ->first;
int tt = it1->second + it2->second;
if(!mp.count(res)) continue;
if(ans>tt+mp[res])
{
ans = tt + mp[res];
ans1 = tmp[res];
ans2 = res / ans1;
ans3 = it1->first;
ans4 = it2->first;
}
}
if(ans==1e9)puts("-1");
else {
printf("%d\n",ans);
printf("%d %d\n%d %d\n",ans1,ans2,ans3,ans4);
}
}