code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n)... | #include <algorithm>
#include <cstdio>
typedef long long ll;
ll dp[100000];
int v[100000];
int main()
{
int n, k;
while (scanf("%d%d", &n, &k), n|k) {
for (int i=0; i<n; ++i) scanf("%d", v+i);
dp[k-1] = 0;
for (int i=0; i<k; ++i) dp[k-1] += v[i];
for (int i=k; i<n; ++i) dp[i] = d... | 0 | 82,412,691 |
#include<iostream>
#include<queue>
#include<string>
using namespace std;
int main(){
priority_queue<int> q;
string cmd;
while(cin>>cmd && cmd!= "end"){
if(cmd == "insert"){
int k;
cin >> k;
q.push(k);
}else if(cmd == "extract"){
int k = q.top();
q.pop();
cout << k << en... | #include<bits/stdc++.h>
using namespace std;
int min(int a,int b)
{
return a<=b? a:b;
}
int main()
{
int n,i,sum=0;
cin>>n;
int arr[2*n];
for(i=0 ; i<2*n ; i++)
cin>>arr[i];
sort(arr,arr+2*n);
for(i=0 ; i<2*n ;)
{
sum=sum+min(arr[i],arr[i+1]);
i=i+2;
}
cout<<... | 0 | 9,959,158 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 998244353
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t--)
#define bi begin()
#define ei end(... | #include <iostream>
#include <stack>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#define rep(i,n) for(int i=0; i < n; i++)
using ll = long long;
using namespace std;
#define pi 3.14159265358979
int main()
{
int a, b;
cin >> a >> b;
int i = 1;
while((int)(i * 0.08) <= a... | 0 | 86,100,935 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
vector<int>h(n);
int ans=0,mx=0;
for (int i = 0; i < n; ++i) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
ll n, k;
vector<ll> a(20);
ll solve (vector<ll> &d) {
ll mx = 0, res = 0, p = 0;
rep(i, k) {
while (p < d[i]) {
... | 0 | 78,194,871 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
string s;
cin >> n >> s >> k;
int kk = k - 1;
for(int i = 0; i < n; i+... | 0 | 37,755,445 |
#include<bits/stdc++.h>
using namespace std ;
#define endl "\n"
#define async ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long int
#define all(y) y.begin(), y.end()
#define present( x, y ) (x.find( y ) != x.end())
const int mod = (int)1e9 + 7 ;
template<class T>
auto matrix( int r, int c, T v ){
... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T>
using vec = std::vector<T>;
int main() {
int N;
cin >> N;
map<int,int> mp;
rep(i,N) {
int a;
cin >> a;
++mp[a];
... | 0 | 97,179,886 |
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using namespace std;
int main(){
int k;
cin >> k;
vector<int> v(33);
v[1]=1;
v[2]=1;
v[3]=1;
v[4]=2;
v[5]=1;
v[6]=2;
v[7]=1;
v[8]=5;
v[9]=2;
v[10]=2;
v[11]=1;
v[12]=5;
... | #include<stdio.h>
main(){
int n,x;
int i,j,k;
int num;
int sum;
while(1){
num = 0;
scanf("%d %d",&n,&x);
if(n == 0 && x == 0) break;
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
for(k=j+1;k<=n;k++){
sum = i+j+k;
if(sum == x){
num++;
}
}
}
}
printf("%d\n",num);
}
return 0... | 0 | 84,045,259 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
vector<ll>ok;
vector<ll>ng;
vector<P>ans;
void f(){
if(ng.empty()){
return;
}
ll c... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define trav(var, container) for(auto& var: container)
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)x.size()
using namespace std;
using namespace __gnu_pbds;
using ld = long double;
using ll = lo... | 0 | 88,711,611 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
long long K;
cin >> K;
string T = S + S;
string T_ = S + S + S;
long long N = S.size();
long long count = 0;
for (int i = 1; i < N; i++){
if (S[i] == S[i - 1]){
count++;
i++;
}
}
long lo... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define N2 998244353
#define nmax 200001
#define pll pair<ll,ll>
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).... | 0 | 5,339,160 |
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define f... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using pii = pair<int, int>;
using pil = pair<int, long>;
using pll = pai... | 0 | 38,380,960 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
using namespace std;
typedef uint64_t u64;
typedef ... | 0 | 12,048,760 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
int X;
X = N-(K-1);
cout<<X<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | 0 | 77,629,314 |
#include <bits/stdc++.h>
using namespace std ;
#define An setprecision(16)
int main(){
int N,A,B;
cin >> N >> A >> B;
int c;
int F=0,S=0,T=0;
for(int i=1;i<=N;i++){
cin >> c;
if(c<=A)F++;
else if(c<=B)S++;
else T++;
}
int ans = min(F,min(S,T));
cout << an... | #include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
long long int cou[2][70];
int main(){
long long int N;
cin>>N;
for(long long int i=0;i<N;i++){
long long int pa;
cin>>pa;
for(long long int i=0;i<61;i++){
cou[pa%2... | 0 | 23,876,588 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
using namespace std;
int maps[50][50];
int inf=0x3f3f3f3f;
void floyd(int n)
{
for(int k=0;k<=n;k++)
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++)
{
if(maps[i... | 0 | 88,921,689 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef long int li;
int main()
{
IOS;
int n;
cin>>n;
string s;
cin>>s;
bool ok=true;
if(n%2!=0)
ok=false;
for(int i=0;i<n/2;i++){
... | #include <iostream>
#include <cmath>
#include <cctype>
#include<cstdio>
#include <string>
#include<algorithm>
using namespace std;
int main(){
while(true){
string s;
cin>>s;
if(s=="-")break;
int n;
cin>>n;
for(int i=0;i<n;i++){
int j;
cin>>j;
s=s.substr(j)+s.substr(0,... | 0 | 950,053 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <limits>
using namespace std;
typedef long long LL;
int main(int argc, char*... | #include <iostream>
using namespace std;
int n,a[1000010];
int st[1000010];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]),st[a[i]]++;
int cnt=n;
for(int i=1;i<=n;++i){
for(int j=1;j*j<=a[i];++j){
if(a[i]%j==0){
int x=a[i]/j,y=j;
... | 0 | 22,858,497 |
#include<stdio.h>
#include<math.h>
int main()
{
long long int a,b,ans;
double s;
scanf("%lld %lf",&a,&s);
b=round(s*100);
ans=a*b/100;
printf("%lld",ans);
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, K; cin >> N >> K;
vector<ll> x(N);
vector<ll> y(N);
rep(i, N){
cin >> x[i] >> y[i];
}
ll ans = (1e18) * 5;
for (int i = 0; ... | 0 | 28,871,407 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M=1000000007;
int main(){
int N;cin>>N;
vector<int> h(N);
rep(i,N) cin>>h[i];
vector<int> dp(N+1);
dp[0]=0;
dp[1]=abs(h[1]-h[0]);
for(int i=2;i<=N;i++){
... | #include <algorithm>
#include <cstdio>
#include <vector>
class PriorityQueue {
std::vector<int> v_;
public:
void insert(int i)
{
v_.push_back(i);
upto(v_.size()-1);
}
int extract_max()
{
const auto max = v_.front();
v_[0] = v_.back();
v_.pop_back();
downto(0);
return max;
}
pri... | 0 | 66,157,896 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int K1,K2,H1,H2,M;cin>>K1>>H1>>K2>>H2>>M;
cout<<((K2-K1)*60)+(H2-H1)-M<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b;... | 0 | 33,327,483 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
int odd=0;
rep(i,N){
int cnt=0;
int A=i+1;
while(A!=0){
cnt++;
A/=10;
}
if(cnt%2==1){
odd... | #include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i... | 0 | 30,547,644 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = 3.1415926535897932;
long long GCD(long long a, long long... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
int n;ll l;
cin >> n >> l;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
vector<ll> sum(n+1);
sum[0] = 0;
rep(i... | 0 | 6,726,740 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
class point {
public:
int x, y;
point() {}
point(int _x, int _y) {
x = _x;
y = _y;
}
};
class list_node {
public:
list_node *prev, *next;
point data;
list_node(list_node *_prev, list_node *_next, point _data) {
prev = _prev;
nex... | #include <bits/stdc++.h>
using namespace std;
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const... | 0 | 64,037,362 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
ll x, y,... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | 0 | 92,392,026 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m;
cin >> n >> m;
long long a[100005];
for(int i=0; i<n; i++) cin >> a[i];
long long p=1;
for(int i=0; i<n; i++){
long long x=1;
while(a[i]%2==0){
a[i] /= 2;
x *= 2;
}
i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int M=3e5+5;
int a[M];
int b[M];
map<pair<int,int>,bool>mp;
int main()
{
int n,m,q;
scanf("%d%d%d",&n,&m,&q);
while(q--)
{
int x,y;
scanf("%d%d",&x,&y);
a[x]++;
b[y]++;
mp[make_pair(x,y)]=1;
}... | 0 | 7,267,928 |
#include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;
int main(){
string input, longest, many;
int len = ... | #include <cstdio>
#include <vector>
#include <climits>
using namespace std;
inline int MIN(int a,int b){
return ((a)<(b)?(a):(b));
}
int minimumProduct(int left, int right, vector<pair<int,int> >& mat, vector<vector<int> >& product) {
if(left==right) return 0;
if(product[left][right]!=-1) {
return product[left][ri... | 0 | 11,877,002 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> p(N);
for(int i=0;i<N;i++){
cin>>p[i];
}
int L;
cin>>L;
vector<vector<int>> dp(N,vector<int>(17));
for(int j=0;j<17;j++){
for(int i=0;i<N;i++){
if(j==0){
if(p[i]+L>=p[N-1]){
dp[i][0]=N-... | #include <iostream>
#include <iomanip>
using namespace std;
int main(){
int d,r;
double a,b,f,w;
f=0.0;
a=0.0;
b=0.0;
w=0.00000;
cin>>a>>b;
d=a/b;
r=(int)a%(int)b;
f=(double)a/(double)b;
cout<<d<<' '<<r<<' '<<fixed<<setprecision(5)<<f<<endl;
} | 0 | 20,400,188 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string c;
cin>> c;
for(int i = 0; i < c.size(); i++){
if(c.at(i) == 'a'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'i'){
cout << "vowel" << endl;
}
else if(c.at(i) == 'u'){
cout << "vowel" << endl;
}
else... | 0 | 75,197,706 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int X, Y;
cin >> X >> Y;
cout << X + Y / 2 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define REPR(i,n) for(int i=n-1;i>=0;i--)
#define FO... | 0 | 54,726,858 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
int k;
scanf("%d",&k);
int cnt=0;
while(b<=a) cnt++,b*=2;
while(c<=b) cnt++,c*=2;
if(cnt<=k) puts("Yes");
else puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
long long a[N];
for (int i=0; i<N; i++) cin >> a[i];
long long total=1000000000000000;
for (int tmp=0; tmp<(1<<15); tmp++) {
bitset<15> s(tmp);
int k=0;
long long count=0;
long long b=a[0];
... | 0 | 74,314,425 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
unordered_map<int,list<int> > um;
int mod=1000000007;
void solve()
{
int r,c;
cin>>r>>c;
char a[r][c];
for(int i=0; i<r; i++){
cin>>a[i];
}
int dp[r][c];
memset(dp,0,sizeof(dp));
dp[r-1][c-... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int h,n;
cin>>h>>n;
int a[n],sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=0;i<n;i++)
{
sum+=a[i];
}
if(sum>=h)
cout<<"Yes\n";
else
cout<<"No\n";
exit(0);
} | 0 | 12,353,750 |
#include <iostream>
using namespace std;
void print20sharps()
{
for(int i = 0; i < 20; i++) {
cout << "#";
}
cout << endl;
}
int main(){
int n, b, f, r, v;
cin >> n;
int bldg_01[3][10], bldg_02[3][10], bldg_03[3][10], bldg_04[3][10];
for(int i = 0; i < 3; i++) {
for(int j = 0... | #include <bits/stdc++.h>
using namespace std;
#define fast static int fastline = []() { std::ios::sync_with_stdio(false); cin.tie(NULL); return 0; }();
#define ll long long
#define LL unsigned ll
#define pb push_back
#define pi pair<ll,ll>
#define debug(x) cout<<x<<"\n";
#define debug cout<<"debugged\n";
#define minval... | 0 | 36,135,437 |
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define szof(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define prev myrza4321
#define y1 myrza1234
#de... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define F first
#define S second
#define ld long double
int const M=2e5+10,M2=1e6+10,mod=1e9+7,mod2=1e9+9,inf=1e18+30;
int mn[M],cnt[M],x[M],y[M];
int32_t main()
{
int n,m;
cin>>n>>... | 0 | 45,663,992 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
static const int INF = 2000000000;
int main(){
ll n, m;
cin >> n >> m;
ll ans;
if (2*n >= m)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scan... | 0 | 2,602,271 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a[100005],b[100005],c[100005];
ll sum;
ll M;
ll amari(ll i,ll j){
if(i%j>=0){
return i%j;
}else{
return i%j+j;
}
}
int main(void){
cin>>n;
ll SUM=n*(n+1)/2;
cin>>a[0];
sum=sum+a[0];
for(int i=1;i<n;i++){
cin>>a[i];
sum=sum+a[i];
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1L... | 0 | 68,637,268 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int n;
cin >> n;
for(int i = 0; i < n; i++){
string op;
int b, e;
cin >> op;
cin >> b >> e;
if(op == "print"){
cout << s.substr(b, e-b+1) << endl;
}else{
... | #include<bits/stdc++.h>
using namespace std;
const int N=100005;
int n,a[N],fa[22][N],L,q,x,y;
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++)scanf("%d",&a[i]);
scanf("%d%d",&L,&q);
for (int i=1;i<n;i++){
int l=i+1,r=n;
while (l<r){
int mid=(l+r+1)/2;
if (a[i]+L>=a[mid])l=mid;
else r=mid-1;
}
fa... | 0 | 77,850,386 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int dataN,i,j,tmp;
string str;
cin>>str;
for(i=str.length()-1;0<=i;i--){
cout<<str[i];
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> d(N);
for(int i = 0 ; i < N ; i++){
cin >> d.at(i);
}
int sum = 0;
for(int i = 0 ; i < N ; i++){
for(int j = 0 ; j < N ; j++){
if(i != j){
sum += d.at(i) * d... | 0 | 42,259,238 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int d,i,ans,d_di;
while(cin>>d){
ans = 0;
for(i = d;i < 600;i += d){
ans += i*i*d;
}
cout<<ans<<endl;
}
return 0;
} | #include<bits/stdc++.h>
const int maxn=100010;
using namespace std;
vector<int>G[maxn];
int n,m;
int sg[maxn];
void calc(int cur,int pre)
{
for(int i=0;i<G[cur].size();i++){
if(G[cur][i]==pre)
continue;
calc(G[cur][i],cur);
sg[cur]^=(sg[G[cur][i]]+1);
}
}
int main()
{
sca... | 0 | 41,860,731 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N;
cin >> N;
ll ans = 1e8;
vector<ll> six(0), nine(0);
int tmp = 1;
while (true) {
six.push_back(tmp);
tmp *= 6;
if (N < tmp) break;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7;
int N, K;
ll mul(ll a, ll b) {
return (a%MOD)*(b%MOD) % MOD;
}
ll add(ll a, ll b) {
return ((a%MOD)+(b%MOD) + MOD) % MOD;
}
ll mpow(ll a, ll b) {
if (b == 0) return 1;
i... | 0 | 83,876,046 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n; cin >> n;
vector<int> a(200000);
vector<ll> memo(200000+1, 0);
for(int i=0; i<n; i++){
cin >> a[i];
memo[a[i]]++;
}
ll sum=0;
for(int i=1; i<=n; i++){
if(memo[i]<2) continue;
... | #include <iostream>
#include <string>
using namespace std;
int main (void) { ... | 0 | 21,784,641 |
#include <iostream>
using namespace std;
bool tst (int n, const string &s, const string &t, int pos) {
for (int i = 0; i + pos < n; i++) {
if (s[i + pos] != t[i]) return false;
}
return true;
}
int main () {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i < n; i++) {
if (tst(n, s, t, i))... | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <nume... | 0 | 69,531,150 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int N,M,R;
cin>>N>>M>>R;
int r[R];
rep(i,0,R){
cin>>r[i];
r[i]--;
}
sort(r,r+R);
int d[N][N];
rep(i,0,N){
rep(j,0,N){
d[i][j]=2... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<pair<int,int>> a;
for(int i = 0; i < n; ++i){
int p,q;
cin >> p >> q;
a.push_back({p,q});
}
sort(a.begin(),a.end());
long long int res = 0;
int c = 0;
for(int i = 0; i < n; ++i){
for(int j = 0; j <... | 0 | 73,646,715 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
vector<bool> isexist1(b, false);
{
int cur = a % b;
while(!isexist1[cur]){
isexist1[cur] = true;
cur += a;
cur %= b;
}
... | 0 | 58,438,450 |
#include <iostream>
#include <stdlib.h>
#include <string>
#define rep(i, n) for(int i = 1; i < n; i++)
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
rep(i, n+1){
string num = to_string(i);
if(num.size() % 2 != 0) ans++;
}
cout << ans << endl;
} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <string>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <functional>
#include <map>
#include <set>
#include <stack>
#include <deque>
#include <queue>
#include <cstring>
#define MOD 1000000007;
#define LIMIT 1000000000... | 0 | 11,415,425 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
string N;
int K;
int dp[110][3][5];
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N >> K;
int L = N.size();
dp[0][0][0] = 1;
rep(i, L) {
int D ... | #include <bits/stdc++.h>
#define fs first
#define sc second
#define mx 100005
#define mod 1000000007
#define pii pair<int, int>
#define ll long long
#define mkp make_pair
#define all(a) a.begin(),a.end()
using namespace std;
int main()
{
int n;
scanf("%d", &n);
ll ara[n];
for(int i = 0; i<n; i++){
scanf("%lld", &... | 0 | 33,415,923 |
#include <iostream>
#include <string>
int main()
{
int N;
std::string S;
std::cin >> N;
std::cin >> S;
if (N%2==0) {
bool flg = true;
for (int i=0; i<N/2; i++) {
if (S[i] != S[N/2+i]) {
flg = false; break;
}
}
if (flg) std::cout << "Yes" << std::endl;
else std::cout << ... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
vector<int> W(N, 0);
for (int i = 0; i < N; ++i) cin >> W[i];
int a = 0, b = 0, i = 0, j = N - 1;
while (i <= j) {
if (a <= b) {
a += W[i], i++;
... | 0 | 87,131,994 |
#pragma GCC optimize("O3")
#pragma GCC optimize("-Ofast", "-funroll-all-loops", "-ffast-math")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | 0 | 48,989,739 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define f(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define fm(i, a, b) for (long long i = a; i > b; i--)
#define repm(i, a, b) for (long long i = a; i >= b; i--)
#define vi... | 0 | 90,830,468 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e+9 * 2;
double eps = 1e-10;
int main() {
string s, t(""), ans_c(""), ans_s("");
map<string, int> cnt;
getline(cin, s);
for(int i = 0; i < s.size(); ++i){
if(s[i] == ' '){
cnt[t]++;
if(ans_s.length() < t.length())
ans_s = t;
t = "";
}
... | #include <iostream>
using namespace std;
int main(){
while (1){
int n;
int input[5001];
int max1;
cin >> n;
if (n == 0) break;
for (int i = 0; i < n; i++){
cin >> input[i];
}
max1 = input[0];
for (int i = 0; i < n; i++){
int sum = 0;
for (int j = i; j < n; j++){
sum += input[j];
max1 = m... | 0 | 92,375,509 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algori... | 0 | 67,330,061 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main(){
string s;
cin >> s;
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
if (s == "abc"){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
using namespa... | 0 | 51,082,757 |
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
const int N = 8003;
string s;
int x, y;
vector <pii> a, b;
bool can[N][2 * N];
void make(string s, vector <pii> &a, vector <pii> &b) {
try {
a.clear(); b.clear();
int cnt = 0, flip = 0;
s += 'T';
for (auto x: ... | #include <bits/stdc++.h>
using namespace std;
char neighbor(char me, char other, char answer) {
if (answer == 'o') {
if (me == 'S') {
if (other == 'S') {
return 'S';
} else {
return 'W';
}
} else {
if (other == 'S') {
... | 0 | 40,598,801 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> vec(N);
for(int i=0; i<N; i++){
cin >> vec.at(i);
}
vector<int> copy(N);
for(int i=0; i<N; i++){
copy.at(i) = vec.at(i);
}
sort(copy.begin(),copy.end());
map<int,int> mp;
for(int i=0; i<N; i++){
mp[co... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void rotation_N(int* dise){
int tmp[6];
tmp[0] = dise[1];
tmp[1] = dise[5];
tmp[2] = dise[2];
tmp[3] = dise[3];
tmp[4] = dise[0];
tmp[5] = dise[4];
for(int i = 0; i < 6; i++){
dise[i] = tmp[i];
}
}
void rotatio... | 0 | 53,495,492 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | #include <iostream>
using namespace std;
#define MAX 2000005
int C[MAX], n, A[MAX], B[MAX];
void countingSort(int A[], int B[], int k)
{
for(int i=0; i<=k; i++)
C[i] = 0;
for(int j=1; j<=n; j++)
C[A[j]]++;
for(int i=1; i<=k ;i++)
C[i] += C[i-1];
for(int i=n; i>=1; i--)
{
... | 0 | 84,222,688 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[5010], p[5010];
int vis[5010];
long long sum;
vector<long long> pre;
int main()
{
scanf("%d%d", &n, &k);
for(int i = 1; i <= n; ++i)
scanf("%d", &p[i]);
for(int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
long long ans = -1e18;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i,s,n) for(int i = (s); i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int a[3];
rep(i, 3) cin >> a[i];
sort(a, a + 3);
int ans = 0;
int i, j, k;
if(abs(a[0] - a[... | 0 | 46,411,804 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
typedef long long ll;
static const ll MX = 100005;
static const ll MX_ll = 1e18;
const double PI = acos(-1);
using namespace std;
#define SIZE_OF_ARRAY(array) (sizeof(array)/sizeof(array[0]))
int c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <tuple>
#include <cmath>
#include <cstdio>
#include <cassert>
#include <functional>
#define _LIBCPP_DEBUG 0
using namespace std;
int main(void){
int l,r;
cin >> l >> r;
int mi=2018*2018;
for (int i = l; ... | 0 | 51,248,526 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
long long K;
cin >> N >> K;
vector<int> P( N );
for( int i = 0; i < N; i++ ) {
int p;
cin >> p;
p--;
P[i] = p;
}
vector<long long> C( N );
for( int i = 0; i < N; i++ ) {
cin >> C[i];
}
long long ans = INT64_MIN;
set<int> st;
for( in... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | 0 | 94,061,428 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
if((A - B) % 2){
cout << "Borys" << "\n";
} else {
cout << "Alice" << "\n";
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int mai... | 0 | 14,040,341 |
#include <iostream>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::pair;
using std::vector;
typedef pair<int, int> PII;
int main(void) {
int n;
int m;
int answer;
while (cin >> n >> m) {
if (n == 0 && m == 0) {
break;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " <... | 0 | 10,050,165 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1E9 + 7, N = 100005;
string s;
int n, a[N], dp[N][2];
int solve(int idx, int f)
{
if (idx == n)
return 1;
else if (dp[idx][f] != -1)
return dp[idx][f];
int ans = 0, lim = 1;
if (f)
lim = a[idx];
for (int i = 0; i <= lim; ++i)
{
int nf = f;
if... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>bool chmax(T &a, const... | 0 | 13,573,674 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
typedef long long LL;
using namespace std;
int main()
{
LL A,B,K,cnt=0;
scanf("%lld%lld%lld",&A,&B,&K);
for(LL i=A;i>=1;i--)
{
if(A%i==0&&B%i==0)
cnt+=1;
if(cnt==K)
{
printf("%lld\n"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
int main() {
int n, k;
scanf("%d %d", &n, &k);
ld res = 0;
for (int i = 1; i <= n; i++) {
ld temp = 1.0 / n;
for (int j = i; j < k; j *= 2) ... | 0 | 72,568,070 |
#include<stdio.h>
int main(){
char c[1000];
int i,x;
int sum;
int co;
while(1){
co=0;
sum=0;
scanf("%s",&c);
for(i=0;;i++){
if(c[i]=='\0'){
co=i;
break;
}
}
if(c[0]=='0')break;
for(i=0;i<co;i++){
x =c[i]-'0';
sum+=x;
}
printf("%d\n",sum);
}
ret... | #include<bits/stdc++.h>
using namespace std;
const int N = 2e3;
const int MOD = 1e9+7;
int n,m;
int a[N+5],b[N+5];
int memo[N+5][N+5];
int dp(int idx1, int idx2){
if(idx1 > n || idx2 > m) return 0;
int &ret = memo[idx1][idx2];
if(ret!=-1) return ret;
ret = dp(idx1+1,idx2);
ret = (ret+dp(idx1,idx2+1))%MOD;
ret = ... | 0 | 62,143,827 |
#include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
const vector<int> calcV(string s) {
int n = s.size();
map<char, int> usedMap;
vector<int> retV(n);
int count = 0;
for(int i = 0; i < n; ++i) {
if(usedMap.find(s[i]) == usedMap.end()) {
use... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define foreach(i,n) for(auto &&i:n)
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define GSORT(... | 0 | 39,091,598 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, X, T;
cin >> N >> X >> T;
int a = N / X;
if(N % X != 0) T *= a + 1;
if(N % X == 0) T *= a;
cout << T << endl;
} | #include<bits/stdc++.h>
using namespace std;
bool comp(vector<int> a, vector<int> b){
return a[0] < b[0];
}
int time(string str){
int s = (int)str[7] - '0' + ((int)str[6] - '0')*10;
int m = (int)str[4] - '0' + ((int)str[3] - '0')*10;
int h = (int)str[1] - '0' + ((int)str[0] - '0')*10;
return s + 6... | 0 | 88,515,628 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <iostream>
#include <cstdio>
#include <complex>
using namespace std;
typedef long long ll;
typedef double R;
typedef complex<R> P;
const R EPS = 1e-10;
const R PI = acos(-1);
int sgn(R a) {
if (a < -EPS) return -1;
if (a > EPS) return 1;
return 0;
}
bool near(P a, P b) {
return !sgn(abs(a-b));
... | 0 | 44,384,296 |
#include<bits/stdc++.h>
#define ll long long int
#define ar array
#define pb push_back
#define input(arr,n) for(int i = 0; i<n; i++) cin>>arr[i]
const int mod = 1e9+7;
ll power(ll a,ll b){ll r=1;for(;b;b>>=1){if(b&1)r=r*a%mod;a=a*a%mod;}return r;}
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define NMAX 2010
const ll mod = 1000000000 + 7;
ll n, m;
ll dp[NMAX][NMAX];
ll s[NMAX], t[NMAX];
void init() {
rep(i, 0, NMAX) {
rep(j, 0, NMAX) dp[i][j] = 0;
... | 0 | 24,390,834 |
#include <bits/stdc++.h>
using namespace std;
int main () {
long long N;
cin >> N;
long long sum = 0;
for (long long i = 1; i <= N; i++) {
sum += i * (N / i) * (N / i + 1) / 2;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define mod (1000000007)
long int vis[100002] = {0};
vector<long int> g[100002];
void dfs(int u,long int x,long int &value)
{
value = max(value,x);
for(auto v : g[u])
{
if(vis[v] == 0){
x++;
dfs(v,x,value);
}
... | 0 | 2,022,320 |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 81,311,074 |
#include <stdio.h>
int main() {
char A, B, C;
scanf("%c %c %c", &A, &B, &C);
if(A==B && A!=C)
puts("Yes");
if(B==C && B!=A)
puts("Yes");
if(A==C && B!=A)
puts("Yes");
if(A==B && A==C)
puts("No");
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const ull mod = 1e9+7;
#define fo(i, n) for (int i = 0; i < n; i++)
#define sc(n) scanf("%d", &n)
using namespace std;
void solve() {
int n, k; sc(n); sc(k);
int a[n]; fo(i, n) sc(a[i]);
int g = 0;
int el = 0;
for (int ... | 0 | 80,677,618 |
#include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long
#define vi vector <int>
#define pii pair <int, int>
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i,n) for (int i = 0; i < (int) (n); ++ i)
#define f... | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#define pb push_back
#define mp make_pair
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef unsigned long long ull;
typedef long long ll;
... | 0 | 64,991,143 |
#include <iostream>
using namespace std;
int main()
{
string x,y;
cin>>x>>y;
int z=y.length();
int cnt=0;
for(int i=0;i<z;i++)
{
if(x[i]!=y[i])
{
cnt++;
}
}
cout<<cnt;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Mod = 1e9 + 7, Nmax = 1e5 + 5;
ll fact[Nmax], ifact[Nmax];
int ap[Nmax], n, i, x, rest;
ll comb(int n, int k)
{
if(n < k) return 0;
return fact[n] * ifact[k] % Mod * ifact[n-k] % Mod;
}
ll power(ll a, int b)
{
if(!b) return 1;
... | 0 | 63,217,856 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll moder = 1000000007;
int main(){
ll n,k;
cin>>n>>k;
long long ret = 0;
for(ll i=k; i<=n+1; i++){
ll lower = i*(i-1)/2;
lower%=moder;
ll upper = n*i-i*(i-1)/2;
ret+=upper-lower+1;
ret%=moder;
}
cout<<ret;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | 0 | 18,953,671 |
#include <iostream>
#include <vector>
#include <algorithm>
class Point{
public:
int i;
int j;
Point(int i,int j) : i(i),j(j) {}
};
class Roads{
int a;
int b;
std::vector<Point> stop;
public:
Roads(int a,int b) : a(a),b(b) {}
void setStop(Point p){
if ( p.i > 0 && p.i < a+1 &&... | #include <iostream>
#include <cstdio>
using namespace std;
#define NIL -1
const int maxn = 100010;
struct Node{int p,l,r;};
Node T[maxn];
int n,D[maxn];
int depth(int u,int d){
D[u] = d;
if(T[u].l!=NIL) depth(T[u].l,d+1);
if(T[u].r!=NIL) depth(T[u].r,d);
}
int main() {
int id,k,m,c,i,left,start=0;
scanf("%d",&n... | 0 | 65,329,098 |
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
string S;
cin >> S;
int ans = MOD;
for (int i = 0; i < S.size() - 2; i++)
{
string tmp = S.substr(i, 3);
int tmp2 = atoi(tmp.c_str())... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int mod = 1000000007;
ll dp[100005];;
ll gcd(long long a,long long b){
if(b == 0)
return a;
else return gcd(b,a%b);
}
bool sortByVal(const pair<string, int> &a,
const pair<string, i... | 0 | 33,056,671 |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
string s;
int gx, gy;
bool valid(int x) { return (0 <= x && x < 16004); }
bool ok(int goal, vector<int> vec, bool first=false) {
... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | 0 | 30,826,827 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline voi... | #include <stdio.h>
#include <stack>
int main(void)
{
using namespace std;
stack<int> stk;
int n;
while(scanf("%d",&n)==1)
{
if(!n)
{
printf("%d\n",stk.top());
stk.pop();
}
else
{
stk.push(n);
}
}
return 0;
} | 0 | 23,367,259 |
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <cstdio>
#include <cstdint>
#define READINT(X) if(ci-cn+16>cm){while((ct=readchar())>='0')(X)=(X)*10+ct-'0';}else{while((ct=*ci++)>='0')(X)=(X)*10+ct-'0';}
using namespace std;
uint16_t d, k;
uint32_t M ... | 0 | 47,413,093 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string s; cin>>s;
int n=s.size();
ll ans=0;
int b=0;
int i=0;
for (int i=0; i<n; i++){
if(s[i]=='B') b++;
if(s[i]=='W') ans+=b;
}
cout << ans << endl;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31,... | 0 | 71,765,040 |
#include <iostream>
#include <vector>
using namespace std;
bool solve() {
int N;
if(!(cin >> N)) return false;
if(!N) return false;
vector<vector<int>> dist(10, vector<int>(10, -1));
for(int i = 0; i < N; ++i) {
int a, b, c;
cin >> a >> b >> c;
dist[a][b] = dist[b][a] = c;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int main(){
string s,t;
cin >> s >> t;
... | 0 | 13,394,259 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<(n); i++)
#define REPS(i, n) for(int i=0; i<=(n); i++)
#define FOR(i, a, b) for(int i=a; i<(b); i++)
#define FORS(i, a, b) for(int i=a; i<=(b); i++)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<(n);++i)
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RREP(i, n) for(int i=(int)(n);i>=0;--i)
#define RFOR(i, a, b) for(int i=(int)(a);i>=(int)(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define DUMP(x... | 0 | 93,957,243 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
int c=1;
cin >> a;
cin >> b;
while(a>0){
c = c*b;
if (b/c==1){
b--;
}
a--;
}
cout << c;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
bool vis[200005];
vector<int> vec[2000005], v1;
int child[2000005];
int parent[2000005];
int div1[100005];
int min_indx[900005];
int count1 = 0;
int height = 0;
int max_indx[200005];
void dfs(int node)
{
vis[... | 0 | 72,243,061 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1000000;
int main() {
int N;
ll a[200005];
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> a[i];
}
ll r = 0, ans = 0, sum1 = 0, sum2 = 0;
for (int i = 1; i <= N; i++) {
while (sum1==sum2 && r ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans[100009];
struct ss
{
ll v;
ll pos;
}a[100009];
const bool com(const ss &a,const ss&b)
{
if(a.v>b.v)return 1;
else if(a.v==b.v)
{
return a.pos<b.pos;
}
return 0;
}
int main()
{
ll n;
scanf("%lld",&n);
... | 0 | 97,810,140 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
int main() {
#ifdef local
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n; cin >> n;
int m = 1 << ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define loop(i, n) for(int i = 0 ; i < n ; ++i)
#define rloop(i, n) for(int i = int(n)-1 ; i >= 0 ; --i)
#define loopOne(i, n) for(int i = 1 ; i <= n; ++i)
#define range(i, a, b) for(int i = int(a) ;... | 0 | 54,099,864 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using P=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl '\n'
#defi... | #include<bits/stdc++.h>
typedef long long int ll;
#define lld long double
#define endl "\n"
#define For(i, a, b) for(long long int i = (a); i <= (b); i++)
#define Forr(i, a, b) for(long long int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vi vector<in... | 0 | 94,086,173 |
#include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll N, A, B, C;
ll mp(vector<ll>& which_stick, vector<ll>& L)
{
ll res = -30;
vector<ll> length(3, 0);
for (ll i = 0; i < N; ++i)
{
if (which_stick.at(i) == 3)
{
continue;
... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) ... | 0 | 34,779,865 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string S;
cin >> S;
int ans = 0;
int leftcnt = 0;
char leftcol;
rep(i,S.size()) {
if (leftcnt == 0) {
leftcol = S.at(i);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using st = string;
using ch = char;
using db = double;
using bl = bool;
using vll = vector<long long>;
using vdb = vector<db>;
using vvll = vector<vll>;
using vst = vector<st>;
using vch = vector<char>;
using pll = pair<... | 0 | 79,850,476 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const long long MOD = 1e9 + 7;
const long long INF = 1e15;
const int INF_INT = 1e9;
template<class TYPE>
struct edge{
TYPE to,cost;
edge(TYPE t,TYPE c){
to = t;
cost = c;
}
};
int main(){
int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const int MAX = 64;
const ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
V<ll> a(n);
rep(i, n) cin >> a[i];
V<V<P>> bits(n, V<P>(MA... | 0 | 91,454,879 |
#include<iostream>
using namespace std;
int f(int x){
int y;
y=x*x;
return y;}
int main(){
int d,e,ans;
while(cin>>d){
ans=0;
e=600/d;
for(int i=0;i<e;i++){
ans+=f(i*d)*d;}
cout<<ans<<endl;}} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1000000000000000000;
int main(){
int n; cin >> n;
ll ans=1;
vector<ll> a(100100);
for(int i=0; i<n; i++){
... | 0 | 49,233,907 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool ans = true;
if (s.at(0) != 'A')ans = false;
if (!('a' <= s.at(1) && s.at(1) <= 'z'))ans = false;
if (!('a' <= s.at(s.length() - 1) && s.at(s.length() - 1) <= 'z'))ans = false;
int big = 0;
for (int i = 2; i <= s.length()-2; i++)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i,n) cin >> h.at(i);
int wa=0;
rep(i,n) wa += h.at(i);
int mi = 1000;
int miwa = 0;
int i=0;
for(;;){
int b = 0;
mi = 1000;
for(int i=0;i<n... | 0 | 13,696,858 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = p... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define pll pair<ll,ll>
#define v vector<ll>
#define st stack<ll>
#define pq priority_queue <int>
#define q queue<ll>
#define mod 1000000005
using namespace std;
int solve(int arr[],int n){
int res=0;
for (i... | 0 | 85,224,401 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | #include <bits/stdc++.h>
using namespace std;
int steps(int x1, int y1, int x2, int y2) {
return max(x1-x2,x2-x1) + max(y1-y2,y2-y1);
}
int main() {
int N;
cin >> N;
vector<vector<int>> p(N, vector<int>(3));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 3; j++) {
cin >> p.at(i).at(j);
}
}
... | 0 | 5,426,941 |
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;
#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)
typedef vector<int> vi;
int main()
{
int d;
while(scanf("%d", &d) != EOF){
int ans = 0;
for(int i=0; i<600; i+=d)
ans += i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | 0 | 2,391,131 |
#include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define ceil(a,b) (((a)+(b)-1)/(b))
#define dist(a,b) max((a)-(b),(b)-(a))
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#define... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
typede... | 0 | 7,656,676 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
#include <sstream>
using namespace std;
int main() {
int z;
cin >> z;
int a;
int b;
int c;
int d;
d = z % 10;
z -= d;
c = (z % 100) / 10;
z -= c * 10;
b = (z % 1000) / 100;
a = (z - b * 100) / 1000;
int eq;
char... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
string T;
cin >> S >> T;
for(int i = 0; i < S.size(); i++) {
if(S == T) {
cout << "Yes" << endl;
return 0;
}
S = S[S.size()-1]+S.substr(0,S.size()-1);
}
cout << "No" << endl;
} | 0 | 1,793,405 |
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#define ll long long
#define dd double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r,d,x;
cin>>r>>d>>x;
in... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) '[' << #x << " is: " << x << "] "
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);
cout << fixed;
#ifndef ONLINE_JUDGE
#endif
int n;
cin>>n;
vecto... | 0 | 39,029,350 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if(fopen("INPUT.txt","r"))
{
freopen ("INPUT.txt" , "r" , stdin);
freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
int k... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... | 0 | 65,651,934 |
#include <stdio.h>
int ceilindex(int sec_array[],int l,int r,int key){
while(r-l>1){
int m = l+(r-l)/2;
if(sec_array[m]>=key)
r = m;
else l = m;
}
return r;
}
int findNumberOfLIS(int nums[],int n){
int sec_array[n];
int len;
sec_array[0] = nums[0];
len = 1;
for(int i =1; i<n; i++){
if(nums[i]<sec_ar... | #include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#d... | 0 | 44,638,960 |
#include <iostream>
using namespace std;
int main (void) {
int a, b, c;
cin >> a >> b >> c;
if (a == b) {
cout << c << endl;
}else if (b == c) {
cout << a << endl;
}else if (c == a) {
cout << b << endl;
}
return 0;
} | #include <cstdio>
int m,nmin,nmax;
int P[205];
int diff[205];
int main(){
while(scanf("%d%d%d",&m,&nmin,&nmax)&&m&&nmin&&nmax){
for(int i=1;i<=m;i++) scanf("%d",P+i);
for(int i=1;i<=m-1;i++) diff[i]=P[i]-P[i+1];
int ans=nmax,difference=diff[ans];
for(int i=nmax;i>=nmin;i--)
... | 0 | 44,289,466 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i... | 0 | 3,434,743 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
void dfs(string op,int now,int i)
{
if(i==4)
{
if(now==7)
{
for(int i =0 ;i<3;i++)cout<<s[i]<<op[i+1];
cout<<s.back();
cout<<"=7"<<endl;
exit(0);
}
return;
}
dfs(op+'+',now+s[i]-'0',i+1);
if(i)dfs(op+'-',now-s[i]+'0',i+1);... | #include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | 0 | 25,528,880 |
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | #define rep(i, n) for(int i = 0; i < (int)(n); i++)
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n,k;
std::cin >> n>>k;
vector<ll> a(n);
vector<ll> psum(n+1);
vector<ll> sum( n+1);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
sum[i+1] = s... | 0 | 70,916,394 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.