code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const double PI = acos(-1.0);
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a;
for(int i = 0; i < n; i++) {
int t;
cin >> t;
a.push_back(t);
}
sort(a.begin(), a.end());
int mi... | #include <iostream>
int main(int argc, char const* argv[])
{
int num;
long max = -10000000, min = 10000000, sum = 0;
int input;
std::cin >> num;
for (size_t i = 0; i < num; i++)
{
std::cin >> input;
if( max < input)
max = input;
if (min > input)
min = input;
sum += input;
}
std::cout << min << " "... | 1 | 48,439,272 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, m;
cin >> n >> m;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<tuple<int,int,int>> x(M);
for (int i=0; i<M; i++) {
int a,b;
cin >> a >> b;
x[i]=make_tuple(a,b,i);
}
sort(x.begin(),x.end());
for (int i=0; i<M; i++) {
if (i==0) {
get<1... | 1 | 93,504,029 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define pb(a) push_back(a)
using namespace std;
typedef long long LL;
int t[110], v[110];
int lm[202020];
int n, T;
int main(){
LL x, y;
cin >> x >> y;
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long a,b;cin>>a>>b;
if(abs(a-b)>1){
cout<<"Alice"<<endl;
}else{
cout<<"Brown"<<endl;
}
return 0;
} | 1 | 86,296,775 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <bits/stdc++.h>
#define F first
#define S second
#define int long long
#define inf 1000000000
using namespace std;
vector<int> lunlun;
int k;
void prnt(){
cout << lunlun[k-1] << endl;
exit(0);
}
void nxt(const int& len, const int& frst, int prv){
prv = prv*10+frst;
if (len == 1){
lunlun... | 1 | 33,143,852 |
#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<complex>
#define INF (long long)1000000000
#define MOD 1000000007
#define EPS 1e-8
#define REP(i, m) for(long long i = 0; i < m; ++i)
#define F... | #include <bits/stdc++.h>
using namespace std;
class Dice {
private:
int* face;
int* relative;
public:
Dice();
~Dice();
void SetNumber(int index, int num);
int ReturnRight(int top, int front);
};
Dice::Dice() {
face = new int[6];
relative = new int[55];
relative[12] = relative[24] = r... | 1 | 51,538,263 |
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using pint=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... | #include <bits/stdc++.h>
using namespace std;
#define nl <<'\n'
#define pi acos(-1.0);
#define ll long long
#define pb push_back
#define eb emplace_back
#define tc int t; cin>>t; while(t--)
#define fio ios_base::sync_with_stdio(0); cin.tie(0)
int main()
{
int n;
cin>>n;
string s;
... | 1 | 80,122,393 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x)),(x).end()))
#define sz(x) ((int)(x).size())
#... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
ll n;
cin >> n;
if(n%2 == 1) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
ll cnt = 10;
while(cnt <= n){
... | 1 | 14,946,246 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n, h; cin >> n >> h;
vector <pair <ll, ll>> a(n, pair <ll, ll> ());
vector <pair <ll, ll>> b(n, pair <ll, ll> ());
rep(i, n) {
... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int mod=1000000007;
const int INF=1001001001;... | 1 | 25,345,378 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
int timeStart = clock();
typedef vector< int > vi;
typedef vector< string > vs;
typedef v... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i,m,n) for(int i = m - 1; i >= n; i--)
#define ALL(v) v.begin(), v.end()
#define itn int
#define Yes() cout << "Yes" ... | 1 | 49,797,323 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
vector<int> a(N);
for (int i = 0; i < N; i++){
cin >> a.at(i);
}
int now = 0;
for (int i = 0; i < N; i++){
if(now == 1){
cout << i << endl;
break;
}else if(i == N - 1){
cout << -1 << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> a(N);
vector<int> b(N);
for(int i=0;i<N;i++)
cin>>a.at(i);
int c=0;
int s=1;
while(true) {
s=a.at(s-1);
c++;
if(s==2) {
cout<<c<<endl;
break;
}
if (b.at(s-1)==1) {
cout<<"-1"<<... | 1 | 55,842,658 |
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
int uniquePathsWithObstacles(vector<vector<int>>& hi) {
int m=hi.size();
int n=hi[0].size();
if(hi[0][0] || hi[m-1][n-1])
return 0;
int dp[m][n];
for(int i=0;i<n;i++)
{
if(hi[0][i]... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long int
#define pb push_back
#define mp12 make_pair
#define pii pair<int,int>
... | 1 | 64,162,653 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
using namespace std;
int main()
{
string op;
int num;
priority_queue<int>pq;
while (cin >> op)
{
if (op == "end") break;
if (op == "insert")
{
cin >> num;
pq.push(num);
}
else if (op == "extract")
{
cout << ... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
template <typename T>
class PriorityQueue {
private:
vector <T> d;
public:
void push(T s) {
int k = d.size();
d.push_back(s);
while (k&&d[(k - 1) / 2] < d[k]) {
swap(d[(k - 1) / 2], d[k]);
k = (k - 1) / 2;
}
}
T top() {
re... | 1 | 17,292,845 |
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
#define INF 10000000000000
int N, K;
int H[305];
long long memo[305][305];
long long getMinPaint(int index, int remK)
{
if (index >= N) return 0;
if (memo[index][remK] != -1) return memo[index][remK];
long long curAns = INF;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N,K;
ll H[310];
ll dp[310][310][310];
ll inf = 1e18;
int main() {
cin >> N >> K;
for (int i = 0; i < N; i++) cin >> H[i+1];
for (int i = 0; i < 310; i++)
for (int j = 0; j < 310; j++)
for (int k = 0; k < 310; k++)
... | 1 | 100,144,752 |
#include <cstdio>
#include <algorithm>
const int N = 100000;
int n, m, v, p, a[N];
bool test(int t)
{
t = n - t;
int amt = v - t - 1;
int i;
for (i = n - 1; a[t] + m < a[i]; --i, --amt);
long long to = 0;
for (int j = i; j > t; --j) to += a[t] + m - a[j];
for (; i > t && to < (long long)amt * m; --i) {
--amt;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
ll n,m,v,p;
vector<ll> a;
bool C(ll x){
if(x < p) return true;
ll now ... | 1 | 51,523,315 |
#include <utility>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
int N, M;
while(cin >> N >> M && N >0)
{
pair<int, int> PD[10000];
for(int i=0;i<N;i++)
cin >> PD[i].second >> PD[i].first;
sort(PD, PD+N);
int Mcur = M;
int sum = 0;
for(int i=0;i<... | #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F fi... | 1 | 50,883,272 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, A, B, X, Y, Cur = 1;
vector<long long> V;
vector<vector<long long> > ANS;
cin >> N >> A >> B;
if (A * B < N || N + 1 < A + B) {
cout << -1 << endl;
return 0;
}
X = N, Y = B;
for (int i = 0; i < B; i++) {
if (X == Y) {
V.push_back(1... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ll N,A,B;
cin>> N >> A >> B;
if( A+B -1 > N || A*B < N || A > N || B>N || A<1 || B<1 ){
cout<< -1 <<endl;
}
else if(B==1){
for(ll i=1; i<=N; i... | 1 | 82,095,368 |
#include<bits/stdc++.h>
using namespace std ;
int main(){
int N , K , cnt;
cin >> N >> K ;
vector<int> h(N) ;
cnt = 0 ;
for (int i = 0 ; i < N ; i++){
cin >> h[i] ;
if(h[i] >= K){
cnt++ ;
}
}
cout << cnt << endl ;
} | #include <bits/stdc++.h>
#define DAU ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PLEC exit(0);
using namespace std;
int n, x, k, res;
int main() {
DAU
cin >> n >> k;
while (n--) {
cin >> x;
res += (x >= k);
}
cout << res;
PLEC
} | 1 | 74,275,195 |
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast,no-stack-protector")
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define LL long long int
#define vi vector<int>
#define vl vector<LL>
#define pb push_back
#define all(V) V.begin(),V.end()
#define sci(x) scanf("%d",&x)
#define scl(x) scanf("... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
cout << n * (n+1)/2;
return 0;
} | 1 | 77,358,061 |
#include <bits/stdc++.h>
using namespace std;
const int nm = 1e3;
int n, m;
long long x, v[8][nm], sum, ans = -3e13;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < 3; j++) {
cin >> x;
for (int k = 0; k < 8; k++)
v[k][i] += 1 << j & k ? x : -x;
}
for (int i = 0; i < 8; i++) ... | #include<bits/stdc++.h>
#define PI acos(-1.0)
#define pb push_back
#define F first
#define S second
using namespace std;
typedef long long ll;
const int N=1e5+5;
struct node{
ll a,b,c;
}p[N];
int n,m,i,j,k;
bool cmp(node x,node y){
return x.a*i+x.b*j+x.c*k>y.a*i+y.b*j+y.c*k;
}
int main(void){
ios::sync_with... | 1 | 19,496,242 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const int INF = 1001001001;
const int mod = 1000000007;
int main(){
int N, M;
cin >> N >> M;
vector<int> a(M), b(M), c(M);
rep(i, M){
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | 1 | 85,948,076 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<string> s(H);
for (int r = 0; r < H; r++)
{
cin >> s.at(r);
}
vector<vector<int>> dp(H, vector<int>(W, 0));
if (s.at(0).at(0) == '#')
{
dp.at(0).at(0) = 1;
}
for (int r ... | #include <iostream>
#include <queue>
#define INF (1<<28)
using namespace std;
#define MAX_H 100
#define MAX_W 100
int H, W;
char S[MAX_H][MAX_W];
int dx[] = {0, 1}, dy[] = {1, 0};
struct P { int x, y, current, flip; };
bool solve() {
queue<P> q;
int used[MAX_H][MAX_W];
for (int i = 0; i < H; i++) {
for (int j... | 1 | 37,074,218 |
#include <bits/stdc++.h>
#define rep0(i,b) for(int i=0 ; i< b ;i++)
#define rep1(i,b) for(int i=1 ; i<=b ;i++)
#define reps(i,a,b) for(int i=a ; i< b.length() ;i++)
typedef long long ll;
#define MOD 1000000007
# define M_PI 3.14159265358979323846
using namespace std;
int main()
{
ll a,b,c,k,res=0;
cin>>a>>b>>c>... | #include<bits/stdc++.h>
using namespace std;
#define optimize() ios::sync_with_stdio(false);cin.tie(0);
#define endl '\n'
int main()
{
int a,b,c,k;
cin>>a>>b>>c>>k;
int ans=(min(k,a)*1);
k-=a;
if(k>0)
{
ans+=min(k,b)*0;
}
k-=b;
if(k>0)
{
ans+=(min(k,c)*-1);
}
... | 1 | 77,881,150 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
deque<int> D;
for (int i = 0; i < N; i++) {
if (i % 2) D.push_front(A.at(i));
else D.push_back(A.at(i));
}
if (N % 2) reverse(D.begin(), D.end());
for (auto... | #include<iostream>
#include<vector>
#include<string>
#include<list>
int main(){
int n;
std::cin >> n;
std::list<int> out;
for(int i = 0; i < n; i++){
int a;
std::cin >> a;
if(i % 2 == 0){
out.push_back(a);
}else{
out.push_front(a);
}
}
... | 1 | 82,341,258 |
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc s... | #include <bits/stdc++.h>
using namespace std;
int a[110];
int main()
{
int n, md = 0; cin >> n;
for (int i = 0; i < n; i ++){
int d; cin >> d; a[d] ++;
md = max(d, md);
}
int r = (md + 1) / 2;
for (int i = 0; i < r; i ++){
if (a[i] >= 1) return cout << "Impossible", 0;
}... | 1 | 5,937,233 |
#include<iostream>
using namespace std;
int main(){
int a = 1;int b = 1;int i = 1;int ii = 1;
for(ii = 1;ii <= 9;ii++){
b = 1;
for(i = 1;i <= 9;i++){
cout << a << "x" << b << "=" << a*b << endl;
b = b+1;
}
a = a+1;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define ... | 1 | 62,731,605 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int I... | 1 | 91,804,126 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<bool> a(n + 1, 0);
while (m--) {
int i;
cin >> i;
a[i] = 1;
}
vector<ll> c(n + 1);
c[0] = 1;
ll M = (ll)1e9 + 7;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
const int MOD = 1000000007;
int n, m;
cin >> n >> m;
vector<int> a(m), dp(n);
for(int i = 0; i < m; i++){
int in;
cin >> in;
a[i] = in - 1;
}
dp[0] = 1;
dp[1] = 2;
if(find(a.begin(), a.end(), 0)... | 1 | 38,648,277 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (to_string(i).length()%2 == 1) ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main()
{
int n; cin >> n;
int ans = 0;
for(int i=1; i < n+1; i ++) {
string s = to_string(i);
if(s.size() % 2 != 0) ans++;
}
cout << ans << endl;;
return 0;
} | 1 | 15,177,223 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
const int INF=1001001001;
int main() {
string S;
int64_t K;
cin>>S>>K;
int N=S.size();
auto ans= [&](string T){
int64_t cnt=1,ans=0;
int n=T.size();
for(int i=0;i<n;i++){
if(T[i]==T[i+1]){cnt++;}
if(i==n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main(){
string s;
int k;
cin >> s >> k;
int cnt=0;
rep(i,s.size()-1){
if(s[i]==s[i+1])
cnt++;
}
if(cnt==s.size()-1){
cout << s.size()*k/2 <<endl;
return 0;
}
s... | 1 | 83,808,121 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k,sum=0;
cin>>n>>k;
vector<int> v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
sort(v.begin(),v.end());
for(int i=0;i<k;i++)
{
sum+=v[i];
}
cout<<sum<<"\n";
return 0;
} | 1 | 1,594,425 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mk make_pair
#define TEST int test; cin >> test ;while(test--)
#define endl "\n"
int main()
{
ll a,b,c,d;
cin>>a>>b>>c>>d;
ll z=a*c;
ll z1=a*d;
ll z2=b*c;
ll z3=b*d;
cout<<max(z,max(z1,max(z2,z... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define all(v) v.begin(),v.end()
#define double long double
#define trace1(x) cerr<<#x<<": "<<x<<endl
#define trace2(x, y) cerr<<#x... | 1 | 100,833,751 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c);... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <list>
#include <cassert>
#include <climits>
#inclu... | 1 | 39,025,583 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<n; i++)
#define print(n) cout<<n<<endl;
int c=0,e=0,n=0,k=0;
signed main... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, k) for (int i = (s); i < (int)(k); i++)
int main(){
int n;
cin >> n;
vector<int> a(n),b(n);
rep(i,0,n) cin >> a.at(i);
rep(i,0,n) a.at(i)--;
rep(k,0,n){
b.at(a.at(k)) = k;
}
rep(i,0,n) cout << b.at(i)+1 << " ";
} | 1 | 86,988,020 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main() {
string s;
cin>>s;
int n=s.size();
ll dp0[n+1];
ll dp1[n+1];
dp0[0]=0;
dp1[0]=1;
rep(i,0,n){
if(s[i]=='0'){
dp0[i+1]=dp0[i]*3%mod;
dp1[i+1]=dp1[i]%mod;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
string L; cin >> L;
int n = L.length();
vector<vector<ll> > memo(n, vector<ll>(2));
memo[0][0] = 1;
memo[0][1] = 2;
for (int i = 1; i < L.length(); i++) {
if (L[i] == '1') {
... | 1 | 35,516,256 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define pb push_back
#define endl '\n'
#define w(t) ll test;cin>>test;while(test--)
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=5010;
ll dist[N][N],circle[N],mark[N];
bool st[N];
int pos[N],n;
ll k;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>pos[i];
for(int i=1;i<=n;i++) cin>>mark[i];
for(int i=1;i<=n;i++)
{
... | 1 | 93,723,082 |
#include <iostream>
#include <list>
#include <string>
using namespace std;
#define ll long long
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
string com;
int key;
list<ll> lst;
list<ll>::iterator it,i=lst.end();
while(n--){
cin>>com;
if(com=="insert"){
cin>>key;
lst.push_fron... | #include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
using namespace std;
struct Node
{
int value;
Node* prev;
Node* next;
};
Node* nil;
void insertValue(int value)
{
Node* node = (Node*)malloc(sizeof(Node));
node->value = value;
node->next = nil->next;
node->prev = nil;
node->next->prev ... | 1 | 16,608,707 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
ll x,y;
cin >> x >> y;
ll num = INF;
ll a = y - x;
if(a>=0) num = min(num,a);
ll b = y + x + 1;
if(b>=0) num = min(num,b... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node... | 1 | 725,612 |
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i =... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsigned lo... | 1 | 84,242,634 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s; cin >> s;
long long int k, ans = 0;
cin >> k;
bool setubi = false;
if (s.at(0) == s.at(s.size() - 1)) setubi = true;
long long int b_seq, e_seq;
b_seq = 1;
e_seq = 1;
if (setubi){
for (int i = 1; i < s.size()... | #include <bits/stdc++.h>
typedef long long ll;
const int N = 105;
char s[N];
int k, n, tot, len[N];
ll ans;
int main()
{
bool is = 1;
scanf("%s%d", s + 1, &k); n = strlen(s + 1);
for (int i = 1; i <= n; i++) if (s[i] != s[1]) is = 0;
if (is) return std::cout << 1ll * n * k / 2 << std::endl, 0;
for (int i = 1, c = ... | 1 | 13,827,128 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (int)(N); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int main() {
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
long long ara[n+5];
for(int i=0;i<n;i++)cin>>ara[i];
sort(ara,ara+n);
long long h=-1,w=-1;
for(int i=n-1;i>=1;i--)
{
if(h==-1 && ara[i]==ara[i-1])h=ara[i],i--;
else if(h!=-1 && ara[i]==ara[i-1])
{
w=ara[i];
... | 1 | 73,532,763 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define rep(i,n) for (int i=0; i<n;++i)
#define ALL(a) (a).b... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long a[1010], b[1010], c[10... | 1 | 39,683,260 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < n;i++)
using ll = long long;
int main(){
ll a,c; double b;
cin >>a >>b;
c = b*100+0.5;
ll ans = a*c/100;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define sci(x) int x; scanf("%d", &x);
#define TC(x) sci(x); while(x--)
typedef long long ll;
using namespace std;
int main()
{
ll a;
double b;
cin>>a>>b;
int d = round(b*100);
ll c= a*d/100;
... | 1 | 87,632,688 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
struct Point{ double x; double y; };
void printPoint(Point p){
printf("%.5lf %.5lf\n", p.x, p.y);
}
void koch... | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
struct TCoordinate
{
double X;
double Y;
};
TCoordinate FindSplitMiddle(TCoordinate A, TCoordinate B)
{
TCoordinate C = {(A.X + B.X) / 2, (A.Y + B.Y) / 2};
C.X += (sqrt(3) / 6) * (A.Y - B.Y);
C.Y += (sqrt(3) / 6) * (B.X - A.X);
return C;... | 1 | 19,033,551 |
#include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB e... | #include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=210;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return... | 1 | 37,759,814 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long M,d,c,a=0,b=0,e=0;cin>>M;
for(int i=0;i<M;i++){
scanf("%lld%lld",&d,&c);
b+=d*c;
a+=c;
}
while(b/10){
a+=b/10;
b=b%10+b/10;
}
cout<<--a<<endl;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long int
constexpr int INF = std::numeric_limits<int>::max();
constexpr int NINF = std::numeric_limits<int>::min();
using namespace std;
int g[10][10];
int f[10][... | 1 | 82,418,112 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <string>
#include <iomanip>
#include <vector>
using namespace std;
int main(){
int n, h, w;
cin >> n >> h >> w;
vector<vector<int>> a(1100, vector<int>(2));
for(int i = 0; i < n; i++) cin >> a.at(i).at(0) >> a.at(i).at(1);
int coun... | #include <iostream>
using namespace std;
int main()
{
int n,x,y;
cin >> n >> x >> y;
int ans=0;
for(int i=0; i<n; ++i)
{
int u,v;
cin >> u >> v;
if (u>=x && v>=y) ans++;
}
cout << ans;
return 0;
} | 1 | 26,661,271 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
int main() {
string S;
cin >> S;
int min = 99999;
int res = 0;
int x = 0;
for(int i = 0; i < S.length() - 2; i++) {
x = 100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0');
if(min > abs(x - 753)) {
min = ab... | 1 | 43,438,152 |
#include <iostream>
#include <string>
#include <queue>
using namespace std;
int main() {
int N, A, B, C, X, Y;
while (cin >> N >> A >> B >> C >> X && (N || A || B || C || X)) {
queue<int> q;
for (int i=0; i<N; ++i) {
cin >> Y;
q.push(Y);
}
int time = 0;
... | #include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
int n,a,b,c,x;
int y;
int frame;
while(1){
cin>>n>>a>>b>>c>>x;
if(n+a+b+c+x==0) break;
frame=0;
for(int i1=0;i1<n;i1++){
cin>>y;
if(x==y && i1==0) continue;
while(1){
x=(a*x+b)%c;
frame++;
if(x==y) break;
... | 1 | 98,317,133 |
#include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main() {
int n,m,a,b;
cin>>n>>m>>a>>b;
int mat[n][m];
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if((i<b)^(j<a))
{
mat[i][j]=1;
}
else
... | #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 long long LL;
typedef pair<int, int> PII;
typede... | 1 | 89,491,350 |
#include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define double ld
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
const ll MAX = 1001001;
const ll MOD = 1000000007;
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> a(m), b(m... | 1 | 12,701,688 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i<n;i++)
#define vv(Type, n,m,d)vector<vector<Type>> vv(n, vector<Type>(m, d));
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a < b) {
rep(i, b) cout... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
for(int i=1;i<=max(a,b);i++){
cout<<min(a,b);
}
} | 1 | 89,621,739 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long X, Y;
cin >> X >> Y;
int ans = 1;
while (X * 2 <= Y) X *= 2, ans++;
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
ll X, Y;
void func()
{
cin >> X >> Y;
ll ans = 0;
while (X <= Y)
{
X *= 2;
++ans;
}
cout << ans << endl;
... | 1 | 36,473,553 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define INF 10000... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 1 | 63,847,128 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void solve()
{
int a, b;
cin >> a >> b;
if (a + b == 15)
{
cout << "+" << endl;
}
else if (a * b == 15)
{
cout << "*" << endl;
}
else
{
cout << "x" << endl;
}
}
int main()
{
solve();
return(0);
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 15){
cout << "+" << endl;
}
else if(a * b == 15){
... | 1 | 33,734,339 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(){
double t,x;
cin>>t>>x;
printf("%.12f\n",t/x);
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
double T,X;
cin>>T>>X;
cout << fixed << setprecision(4);
cout<<T/X<<endl;
return 0;
} | 1 | 23,893,948 |
#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 mod = 1000000007;
int dp[100005];
int main() {
int N, M; cin >> N >> M;
vector<int> S(N+1);
rep(i, M){
int a; cin >> a;
S[a] = 1;
}
dp[0] =... | #include <bits/stdc++.h>
using namespace std;
#define BROKE 1
int main() {
int64_t n,m;
cin>>n>>m;
vector<int64_t> broken(n+1);
for(int i=0;i<m;i++){
int wk=0;
cin>>wk;
broken.at(wk)=BROKE;
}
vector<int64_t> route(n+1);
route.at(0)=1;
for(int i=1;i<=n;i++){
int route1,route2;
if(brok... | 1 | 90,819,028 |
#include<iostream>
#include<algorithm>
#include<string.h>
#include<set>
#define MAX_N 50
#define INF 10000
using namespace std;
int d[MAX_N][MAX_N];
int N;
void floyed(int X) {
for (int k = 0; k<X; k++) {
for (int i = 0; i<X; i++) {
for (int j = 0; j<X; j++) {
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
... | #include<iostream>
#include<vector>
#include<algorithm>
#define INF (1<<29)
using namespace std;
int main(void){
int a,b,c,g[10][10],n,sum[10];
while(cin >> n,n){
fill(sum,sum+10,0);
fill(g[0],g[10],INF);
for(int i=0;i<10;i++)g[i][i]=0;
for(int i=0;i<n;i++){
cin >> a >> b >> c;
g[a][b]=g... | 1 | 98,268,513 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template<class T,class U>bool chmax(T &a, const U &b){if(a<b){a=b;return 1;}return 0;}
template<class T,class U>bool chmin(T &a, const U &b){if(b<a){a=b;return 1;}return 0;... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ll h, w; cin >> h >> w;
ll ans1 = 10e11, ans2 = 10e11;
for(int i = 1; i < h; i++){
ll halfh = (h-i) / 2, halfw = w / 2, h2 = h - i;
ll s1 = i * w;
ll s2 = halfh * w;
ll s3 = (h2 - halfh) * w;
... | 1 | 78,168,240 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265358979
int main()
{
long n, m; cin >> n ... | #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(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 1 | 49,622,777 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c,d,maxx;
cin>>a>>b>>c>>d;
maxx=max(a*c,a*d);
maxx=max(maxx,max(b*c,b*d));
cout<<maxx;
return 0;
} | 1 | 66,358,504 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define repr(i, a, b) for (auto i = (a); i < (b); ++i)
#define itr(x) for (auto&& v : (x))
#define updatemax(t, v) ((t) = std::max((t), (v)))
#define updatemin(t, v) ((t) = std::min((t), (v)))
int m... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll... | 1 | 52,769,825 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
bool f = 0;
int a,b,n,cnt = 0,m,k = 0;
int x[100],y[100];
int mas[100][100];
int dx[2] = {0,1},dy[2] = {1,0};
void dfs(int x, int y);
int main(){
while(1){
cnt = 0;
cin >> a >> b;
if(a == 0 && b == 0)break;
cin >> n;
m = ... | #include<cstdio>
using namespace std;
void func(int,int);
int a,b;
int x,y;
int cnt;
int kouzi[17][17];
int main(void)
{
int i,j,n;
scanf("%d %d",&a,&b);
while(a!=0 && a!=0){
for(i=1;i<=b;i++){
for(j=1;j<=a;j++){
kouzi[i][j]=0;
}
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %d",&x,&y);
kouzi... | 1 | 93,662,926 |
#include <iostream>
using namespace std;
int main(void){
bool ans;
char N, W;
cin >> N;
cin >> W;
cin >> N >> W;
ans = 0;
if(N==W){
}else{
ans = 1;
}
cin >> N >> W;
if(N==W){
}else{
ans = 1;
}
if(ans==1){
cout << "No";
}else{
c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
string S;
int... | 1 | 12,241,546 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N=2e5+5;
const int MOD=1e9+7;
int n;
int a[N], first[N], last[N];
int fact[N], invfact[N];
int pow(int a, int b, int m)
{
int ans=1;
while(b)
{
if(b&1)
an... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x) * (x))
const char *fin = "arc077_b.inp";
const char *fon = "arc077_b.out";
#define oo (int) (1e9+7)
#define maxn (int) (1e5+5)
int n, A, B;
int a[maxn], pos[maxn];
long lo... | 1 | 28,259,205 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,INF=mod*mod*3;
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define pb push_back
ll N;
ll A[100005];
ll dp[100005];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin... | 1 | 11,235,325 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cstring>
#include <tuple>
#include <utility>
#include <list... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
struct mouse{
int x;
int y;
int cnt;
};
int used[1000][1000]={0};
char map[1000][1000];
int maps[1000][1000]={0};
int main(){
int h,w,n,p=1,i,j,fx,fy,k;
int mx[4]={-1,0,1,0};
int my[4]={0,-1,0,1};
char num[11]="0123456789"... | 1 | 49,621,490 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int N,K,X,Y;
cin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
int n,k,x,y; cin>>n>>k>>x>>y;
if(n>k){
cout<<k*x+(n-k)*y<<endl;
}else{
cout<<n*x<<endl;
}
} | 1 | 1,777,086 |
#include <iostream>
#include <string>
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <math.h>
#include <stdio.h>
#include <climits>
#include <cfloat>
#include <string>
#include <unordered_map>
#include <algorithm>
#include <cctype>
using namespace std;
i... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int sum=0;
while(m--)
{
int x;
cin>>x;
sum+=x;
}
if(sum<n)
{
cout<<n-sum<<endl;
}
else if(sum==n) cout<<0<<endl;
else{cout<<-1<<endl;}
return 0;
} | 1 | 91,099,536 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<int> ans;
vector<vector<int>> g(200005,vector<int> (0));
void dfs(int v,int p){
for(auto i:g[v]){
if(i==p) continue;
ans[i] += ans[v];
dfs(i,v);
}
}
int main(){
int n,q;
cin ... | #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 { \... | 1 | 12,320,119 |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if (a+b>=c){
cout<<"Yes\n";
}
else {
cout<<"No\n";
}
return 0;
} | #include<iostream>
#include<bits/stdc++.h>
#include<iomanip>
#include<math.h>
#include<vector>
#include<cctype>
#include<string>
#include<set>
#include<map>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
std::string line;
typedef long long ll;
int main(){
int a,b,c;
cin >> a >> b >> c;
if( c <= a+b... | 1 | 65,093,234 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define vll vector<ll>
#define mll map<ll,ll>
#define MOD 1000000007
#define pll pair<ll,ll>
constexpr ll INF = 1999999999999999997;
#define fastio ios_base:... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio();
cin.tie(0);
vector <int> a(2);
cin >> a[0] >> a[1];
sort(a.begin(), a.end());
for (int i=0;i<3;i++) {
if (a[i]!=i+1) {
cout << i+1;
return 0;
}
}
return 0;
} | 1 | 16,466,444 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
int count_k = 0;
cin >> A >> B;
for(int i = A; i < B+1; i++){
int n1,n2,n3,n4,n5;
n1 = i % 10;
n5 = i / 10000;
if(n1 != n5){
continue;
}else{
n4 = i / 1000 - n5 * 10;
n2 = (i % 100) / 10;
if(n2 == n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, a1, a2, a3, a4, a5;
int N = 0;
cin >> A >> B;
for(int i = 0;i < B; i++) {
a1 = A / 10000;
a2 = (A - a1 * 10000) / 1000;
a3 = (A - a1 * 10000 - a2 * 1000) / 100;
a4 = (A - a1 * 10000 - a2 * 1000 - a3 * 100) / 10;
a5 = A % 10... | 1 | 24,861,427 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char c,res;
cin>>c;
res= c + 1;
cout<<res;
return 0;
} | #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>;
... | 1 | 97,878,904 |
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx")
#define io_init cin.tie(0);ios::sync_with_stdio(0);cout<<setprecision(10)
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
constexpr d... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define FILL(i,n) memset(i,n,sizeof i)
#define X first
#define Y second
#define ET cout << "\n"
#define SZ(a) ((int)a.size())
#define... | 1 | 64,009,916 |
#include <bits/stdc++.h>
#define rep2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using ll = long long;
template <typename T>
T sq(T x) {
return x * x;
}
signed main() {
int N, K;
cin ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int res = 1;
for(int i = 0; i < n; ++i){
res = min({res * 2, res + k});
}
cout << res;
} | 1 | 11,915,655 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define LL_HALFMAX 9223372036854775807 / 2
int main()
{
ll n,k;
cin >> n >> k;
vector<ll>a(n);
for(ll i = 0; i < n; i++)
{
cin >> a[i];
}
ll result = LL_HALFMAX;
ll addcost = 0;
for(ll bit = 0; bit <(1<<... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 1 | 74,461,927 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
string s;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = (int)1e9 + 7;
const int INF = (int)100100100;
int main() {
string S; cin >> S;
int w;
cin >> w;
int x=0;
while(x<S.length()){
cout << S[x];
x+=w;
}
} | 1 | 78,160,450 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
int main()
{
int n,k;
cin >> n >> k;
int a[n];
rep(i,n) cin >> a[i];
ll ans = 0;
rep(i,n)
{
ans++;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
ll n,k;
cin >> n >> k;
ll ans = (n-2)/(k-1) + 1;
cout << ans << endl;
} | 1 | 5,782,477 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | #include <iostream>
#include <algorithm>
using namespace std;
long long a[100010],sum = 0;
int main(){
int i,j,n;
cin >> n;
for(i=0;i<n;i++){
cin >> a[i];
sum ^= a[i];
}
for(i=0;i<=60;i++){
long long x = (1LL<<i);
if(sum & x){
for(j=0;j<n;j++){
if(a[j]&x) a[j] ^= x;
}
}
}
int k = 0;
for(i=60... | 1 | 94,273,269 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define mod 998244353
#define lim 1000000000000000007
#define lim1 18446744073709551615
#define sq(a) ((a)*(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define mms(v,i) memset(v,i,sizeof(v))
#def... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <set>
#include <algorithm>
#include <iomanip>
typedef long long ll;
const ll MOD = 998244353;
const long long INF = 1LL<<60;
const double PI=3.14159265358979323846;
const int NMAX=100005;
using namespace st... | 1 | 60,117,186 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#define pi 3.14159265358979323846264338327950
int main() {
long long N, A, B, d; std::cin >> N >> A >> B;
std::cout << ((N / (A + B)) * A) + std::min(A, N % (A + B)) << std::endl;
return 0;
} | #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>;
const long long INF = 1ll << 60;
int main() {
ll N, A, B; cin >> N >> A >> B;
ll SUM = A + B;
ll ans = (N / SUM) * A;
ll amari = N%SUM;
ans += min(amari,A);
cout ... | 1 | 49,337,479 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100000000;
bool cmp(string a,string b)
{
int n=min(a.size(),b.size());
rep(i,n)
{
if(a[i]!=b[i])
{
return a[i]<b[i];
}
... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | 1 | 77,678,719 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1000003;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<cla... | #include <bits/stdc++.h>
using namespace std;
string s1, s2;
int memo[1010][1010];
int calc(int i, int j) {
if (i == s1.length()) {
return memo[i][j] = (int)s2.length() - j;
}
if (j == s2.length()) {
return memo[i][j] = (int)s1.length() - i;
}
if (memo[i][j] != -1) return memo[i][j];... | 1 | 88,502,401 |
#include<bits/stdc++.h>
#define me(a,x) memset(a,x,sizeof(a))
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);
#define sc scanf
#define itn int
#define STR clock_t startTime = clock();
#define END clock_t endTime = clock();cout << double(endTime - startTime) / CLOCKS_PER_SEC *1000<< "m... | #include<iostream>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
uint64_t getZ() {
uint64_t v = 0; int c;
while((c = getchar_unlocked()) >= '0') v=v*10+c-'0';
return v;
}
int const MAXN = 2e5;
int64_t A[MAXN];
int N;
int ... | 1 | 14,849,144 |
#include <iostream>
#include <vector>
#include<string>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
int main()
{
int K;
std::string S;
cin >> K >> S;
if(S.size()>K){
S = S.substr(0, K) + "...";
}
std::cout << S << endl;
return 0;
} | #include<stdio.h>
#include<string.h>
int main(){
int k;
char s[105];
scanf("%d",&k);
getchar();
scanf("%s",&s);
if(strlen(s)>k){
for(int i=0;i<k;i++){
printf("%c",s[i]);
}
printf("...");
printf("\n");
}
else{
int l = strlen(s);
for(int i=0;i<l;i++)
printf("%c",s[i]);
printf("\n");
}
} | 1 | 90,132,854 |
#include <bits/stdc++.h>
#define rep(i,n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.be... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
int64 pow2(uint64 e){
int64 p=1;
for(uint64 i=0; i<e; ++i){ p*=2; }
return p;
}
int64 nCr(int64 n, int64 r){
int64 ret=1;
for(int64 i=0; i<r; ++i){
ret = ret * (n-i) / (i+1);
... | 1 | 68,414,755 |
#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()
{
ll n,a,b;
cin >> n >> a >> b;
if(n<a+b-1||a*b<n) {
cout << -1 << "\n";
return 0;
}
if(a==1) {
rep(i,n) co... | #include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <cstring>
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define PI acos(-1.0)
typedef long long ll;
const int INF=0x3f3f3f3f;
int s[500005];
int mai... | 1 | 81,767,475 |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <cstdlib>
using namespace std;
typedef ... | #include <iostream>
using namespace std;
const long MOD = 1000000007;
typedef pair<int, int> P;
typedef long long ll;
ll N, X;
ll nums[51];
ll ps[51];
ll dfs(ll X, ll N){
if(N == 0) return 1;
if(X == 1) return 0;
else if(X >= 2 && X <= nums[N-1] + 1) dfs(X-1, N-1);
else if(X == nums[N-1] + 2) return ps[... | 1 | 75,045,211 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include "bits/stdc++.h"
#include <ext/rope>
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) for(int i = a; i < b; i++)
using namespace __gnu_cxx;
using ll = long long;
using db = long double;
using row = ve... | 1 | 15,166,190 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
int N;
cin >> N;
bool x = false;
for (int i = 0; i <= N / 7; i++)
if ((N - i * 7) % 4 == 0)
x = true;
cout << (x ? "Yes" : "No");... | 1 | 33,516,399 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pa;
const ll MOD = 1e9 + 7;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (int i = (l); i... | 1 | 20,203,824 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
void solve() {
ll H, W;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
int main() {
int H, W; cin >> H >> W;
vector<vector<char>> table(H+2, vector<char>(W+2,'.'));
for (int i=1; i<H+1; i++){
for (int j=1; j<W+1; j++){
cin >> t... | 1 | 35,154,057 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
for (;;) {
scanf("%d %d",&h,&w);
if (h==0) break;
for (int i=0;i<h;i++) {
for (int j=0;j<w;j++) {
printf("#");
}
printf("\n");
}
printf("\n");
}
r... | #include <stdio.h>
int main()
{
int h,w,g,r;
scanf("%d %d",&h,&w);
while(h!=0||w!=0){
for(g=0;g<h;g++){
for(r=0;r<w;r++){
printf("#");
}
printf("\n");
}
printf("\n");
scanf("%d %d",&h,&w);
}
return 0;
} | 1 | 87,932,249 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll N;
string s, t;
cin >> N >> s >> t;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 1 | 45,180,697 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
void solve(long long N, long long X, std::vector<long long> x){
sort(x.begin(), x.end(), [&](auto a, auto b){ return abs(X ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int n,x;
cin>>n>>x;
int cor[n];
for(int i=0;i<n;i++)
{cin>>cor[i];cor[i]=abs(cor[i]-x);}
if(n==1)
{
cout<<cor[0]<<endl;
return 0;
}
int gcd=__gcd(cor[0],cor[1]);
for(int i=2;i... | 1 | 99,071,228 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long
const int N = 1e5 + 5;
int get(int x)
{
int cnt = 0;
while(x > 0)
{
cnt++;
x /= 10;
}
return cnt;
}
int32_t main()
{
IOS;
int n;
cin >> n;
int ans = 1e9;
for(... | 1 | 71,218,605 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
if(a == b){
cout << 1 << endl;
return 0;
}
cout << max(0LL, (b-a)*1LL*(n-2) + 1) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#incl... | 1 | 53,212,803 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000100;
int a[N];
int d[N];
int main() {
int n;
cin >> n;
long long v = (n*1ll*(n+1))/2;
long long sum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
if(sum % v == 0) {
sum/=v;
for (int i = 0; i < n; ++i) {
d[i] = a[i] - a[(i... | #include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
ll n;cin>>n;
ll a[n];
ll diff[n];
ll sum=0;
rep(i,n){
... | 1 | 18,583,702 |
#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--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 ... | 1 | 5,176,192 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9+7;
template<class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
#include<iomanip>
using namespace std;
int main()
{
int a, b; cin >> a >> b;
vector<vector<long long>>che(b, vector<long long>(2));
vector<vector<long long>>stu(a, vector<long long>(2));
for (int i = 0; i < a; ++i)
{
for (int j = 0; j < 2; ... | 1 | 1,535,686 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.