Tag: Codeforces Round #422 (Div. 2)
Codeforces Round #422 (Div....
#include<cstdio>
#include<cstdlib>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<cmath>
using namespace std;
#define pi acos(-1.0)
typedef long long ll;
typedef double...
Codeforces Round #422 (Div....
#include<bits/stdc++.h>
typedef long long ll;
const int N=100010;
const ll mo=1000000007;
int n,x,i,l,r,m,mid,g,j,k;
ll...
Codeforces Round #422 (Div....
#include<bits/stdc++.h>
using namespace std;
long long f,pwr,mod=1e9+7,t,r,l,ans;
main()
{
int i,j,k;
cin>>t>>l>>r;
pwr=1;
//for(i=1;i<=r-l+1;i++)pwr=(1ll*pwr*t)%mod;
for(i=0;i<=r;i++)
f=1e18;
f=0;
for(i=1;i<=r;i++)
{
for(j=2*i,k=2;j<=r;j+=i,k++)
{
f=min(f,(1ll*i*(k-1)*k)/2+f);
}
}
ans=0;long long pr=1;
for(i=l;i<=r;i++)
ans=(ans+((f)%mod*pr)%mod)%mod,pr=(pr*t)%mod;
cout<<ans<<endl;
}
Codeforces Round #422 (Div....
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
ll ans,c,n,x,L,R,cc;
vector<pair<ll,ll> >l,r;
int main(){
scanf("%lld%lld",&n,&x);
for(int...
Codeforces Round #422 (Div....
#include<bits/stdc++.h>
using namespace std;
int n,m,i,j,c,a=2e9,ai;
string s,t;
int main(){
cin>>n>>m>>s>>t;
for(i=0;i<=m-n;i++)
{
for(c=j=0;j<n;j++)
t==s?0:c++;
c<a?a=c,ai=i:0;
}
cout<<a<<endl;
for(c=j=0;j<n;j++)
t!=s?cout<<j+1<<" ",0:0;
}
Codeforces Round #422 (Div....
#include<iostream>
using namespace std;
int a,b;
int main(){
cin>>a>>b;
a=a<b?a:b;
for(b=a;--a;)b*=a;
cout<<b;
}