Admin
875 animes navigated
Celebrating Black History Month: Past, Future
As February unfolds, so does the annual celebration of Black History Month, a time...
The Path to Self-Mastery: Lessons from Book ‘The Mountain Is You’
Embarking on a journey of self-mastery and breaking free from self-sabotage is a transformative...
Wizards of Waverly Place Cast Reunites for Enchanting Revival
In a spellbinding announcement, Disney has officially revealed that the beloved fantasy series "Wizards...
Jim Irsay’s Reported ‘Suspected Overdose’: A Closer Look
In a shocking turn of events last month, Jim Irsay, the owner of the...
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;
}
Codeforces Round #425 (Div....
#include<bits/stdc++.h>
#define oo 0x3f3f3f3f
#define cl(x) memset(x, 0, sizeof(x))
#define mp make_pair
#define...
Codeforces Round #425 (Div....
#include<cstdio>
#include<iostream>
using namespace std;
struct Edge{
int to,next;
}e;
int head,cnt=0;
void add(int u,int v)
{
cnt++;
e.to=v;
e.next=head;
head=cnt;
}
int...
Codeforces Round #425 (Div....
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld...
Codeforces Round #425 (Div....
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
string s,t;
int q;
string str;
int w;
bool g;
int main()
{
cin>>s;
for(int...
Codeforces Round #425 (Div....
#include <cstdio>
int main() {
long long n, k;
scanf("%I64d%I64d", &n, &k);
puts((n...
Codeforces Round #423 (Div....
import java.io.*;
import java.util.*;
import sun.security.pkcs11.Secmod.DbMode;
public class F {
static class Edge...