code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
string a, b, c, d;
cin >>... | #include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main()
{
vector<int> a(4);
for (int i = 0; i < 4; ++i) cin >> a[i];
sort(a.begin(), a.end());
cout << ... | 1 | 58,780,235 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
#define lb(v,k) (lower_bound... | #include <bits/stdc++.h>
using namespace std;
int cost[] = {0,2,5,5,4,5,6,3,7,6};
bool d[10] = {};
int main() {
int n, m;
cin >> n >> m;
for (int i=0; i<m; i++) {
int a;
cin >> a;
d[a] = 1;
}
vector<string> dp(n+1, "");
for (int i=1; i<10; i++) {
if ( !d[i] ) cont... | 1 | 89,022,654 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
ll count(const vector<int>& vec) {
vector<vector<vector<ll>>> dp(vec.size() + 1,
vector<vector<ll>>(2, vector<ll>(2, 0)));
dp[0][0][0] = 1;
int cnt = 0;
for... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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 all(x) (x).begin(), (x).end()
using namespace std;
int main() {
int h,w;
cin>>h; cin>>w;
vector<string> a(h);
rep(i,h) cin>>a[i];
vector<bool> height(h),width(w);
... | 1 | 85,154,396 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
for(int i = 0 ; i < s.size(); i++) {
if(s[i] == 'o') sum++;
}
if(8 - sum <= 15 - s.size()) cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 1 | 77,650,313 |
#include<iostream>
#include<string>
using namespace std;
int main () {
long debt=100000;
int n;
cin >> n;
for (; n > 0; --n) {
debt *= 1.05;
long a = (debt % 1000 == 0) ? 0 : 1;
debt = (long)(debt / 1000 + a) * 1000;
}
cout << debt << endl;
return 0;
} | #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
int n;
cin>>n;
double m = 100000;
for(int i = 0; i < n; i++){
m*=1.05;
m/=1000;
m=ceil(m);
m*=1000;
}
cout<<(int)m<<endl;
} | 1 | 34,921,552 |
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int v[n+1];
for(int i=0; i<n; i++){
cin >> v[i];
}
long long cnt=0, maxi=max(v[0],v[1]);
for(int i=1; i<n; i++){
maxi = (v[i]>maxi) ? v[i] : maxi;
if(v[i] >= v[i-1]) continue;
else {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
using namespace std;
using ll = long long;
using vi = vector<int>;
int main() {
int N;
cin >> N;
vi A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
int prev = 0;
rep(i, N) {
prev = max(p... | 1 | 48,964,580 |
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main(void) {
double t, x;
cin >> t >> x;
cout << fixed << setprecision(10) << t / x << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
float T, X;
cin >> T >> X;
cout << T/X << "\n";
} | 1 | 83,933,012 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define xx first
#define yy second
const int N = 1e5 + 1;
const int mod = 1e9 + 7;
int add(int x, int y) {
return ((x + y) % mod + mod) % mod;
}
int mul(ll x, ll y) {
return (x * y) % mod;
}
int n, memo[2][N];
vector<int> adj[N];
int dp(int j, ... | #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 ll long long
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vl vector<ll>
#define vul vector<ull>
#define pii pair<int,int>... | 1 | 52,011,880 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 10000000000
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<int> a(n);
rep(i,n){
cin >> a[i];
a[i] = a[i] - (i + 1);
}
sort(a.begin(), a.end());
int b1 = a[n / 2... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
const ll mod = 1e9+7;
const ll INF = 1e18;
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
int main() {
cin.tie(0);
ios_base::sync_with_st... | 1 | 55,868,640 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
... | 1 | 32,465,153 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int n;
cin >> n;
double ans = 0;
for(int i = 0; i < n; i++){
double x;
string u;
cin >> x >> u;
if(u == "JPY") ans += x;
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | 1 | 43,483,941 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
string key = "keyence";
void solve()
{
string s; cin >> s;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | 1 | 56,379,081 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long n,a;
cin >> n >> a;
int ans=n%500;
if(ans <= a) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
cin >> N;
cin >> A;
int B = N / 500;
int C = N - B * 500;
if (C <= A){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | 1 | 84,460,023 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
t... | #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()
{
char b;
cin >> b;
if (b == 'A')
cout << "T" << endl;
if (b == 'C')
cout << "G" << endl;
if (b == 'G')
cout << "C" << endl... | 1 | 11,736,801 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)
#define mp std::make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef st... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
while (cin >> N >> K) {
if(N == 0) br... | 1 | 57,963,866 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #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;
cin >> s;
string ans = "";
ans+=s[0];
for(int i=1;i<s.size();i++){
if(s[i]!=s[i-1])
ans+=s[i];
}
cout << ans.size()-1 << endl;
return 0;
} | 1 | 31,638,469 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main()
{
double a, b, x;
cin >> a >> b >> x;
if (x < a * a * b / 2)
cout << fixed << setprecision(10) << atan(a * b * b / (2 * x)) * 180 / M_PI << endl;
else
cout << fixe... | #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<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 1 | 19,303,853 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
int a, b, k;
cin >> a >> b >> k;
stack<int> d;
for(int i = 1; i <= 100; i++) {
if(a % i == 0 && b % i == 0) {
d.push(i);
}
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,i=0,t,m=0;
cin>>a>>b>>c;
vector<int>v;
vector<int>v1;
vector<int>w;
for(int i=1;i<=a;i++)
{
if(a%i==0)
v.push_back(i);
}
for(int j=1;j<=b;j++)
{
if(b%j==0)
v1.push_back(j);... | 1 | 34,082,687 |
#include <iostream>
using namespace std;
struct Card{
char mark;
int num;
};
void bubbleSort(struct Card a[],int n){
int flag=1;
for(int i=0;flag;i++){
flag=0;
for(int j=n-1;j>i;j--){
if(a[j-1].num>a[j].num){
swap(a[j],a[j-1]);
flag=1;
... | #include<iostream>
using namespace std;
struct Card
{
int value;
char mark;
};
void BubbleSort(Card a[],int n)
{
bool flag = true;
for(int i = 0;flag;i++){
flag = false;
for(int j = n-1;j > i;j--){
if(a[j].value < a[j-1].value){
Card c = a[j];
a[j] = a[j-1];
a[j-1] = c;
flag = true;
}
}
... | 1 | 875,253 |
#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... | #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>;
class bipartite_matching {
public:
int n;
std::vector<std::vector<int>> g;
std::vector<int> match;
bipartite_matching(int n_) : n(n_), g(n_), match(n_), used(n_) {}... | 1 | 18,090,206 |
#include <bits/stdc++.h>
#define ll long long
#define M 1000000007
#define MM 998244353
#define PI 3.14159265
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
{
cin >> h[i];
}
long long int dp[n];
for (int i = 0; i<n ; i++)
{
dp[i] = M;
}
dp[0] = 0;
dp[... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int mx = 1e5+123;
int h[mx], n, k;
int dp[mx];
int solve ( int i )
{
if ( i == n ) return 0;
if ( dp[i] != -1 ) return dp[i];
int ret = 2e9;
for ( int j = 1; j <= k; j++ ) {
if ( i+j <= n ) ret = min ( ret, abs ( h[i] - h[i+j]... | 1 | 58,173,100 |
#pragma region header
#define _GLIBCXX_DEBUG
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <c... | #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 = 0; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
string s; cin >> s;
rep(i, s.size())
{
if (i%2 == 0)
cout << s[i]... | 1 | 81,789,876 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int Mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 998244353;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
... | 1 | 97,321,392 |
#define ll long long
#define dn double
#define mp make_pair
#define pb push_back
#define se second
#define fi first
#define mod 1000000007
#define sob(v) v.begin(),v.end()
#define sobr(v) v.rbegin(),v.rend()
#defi... | #include <bits/stdc++.h>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef long double ld;
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) { a = b; re... | 1 | 50,536,152 |
#include<iostream>
using namespace std;
int main(){
int a[10000]={0},au[30];
int i,j,s;
int c=0,t=0;
while(cin>>s){
a[s]++;
c++;
}
int max=0;
for(i=0;i<c;i++){
if(max<a[i]){
max=a[i];
au[0]=i;
t=1;
}
else if(max==a[i]){
au[t]=i;
t++;
}
}
for(i=0;i<t;i++){
cout<<au[i]<<endl;
}
retu... | #include<stdio.h>
int main(void)
{
int i=0,count[101]={0},max=0;
while(scanf("%d",&i)!=EOF)
{
count[i]++;
if(count[i]>max)
{
max=count[i];
}
}
for(i=1;i<=100;i++)
{
if(max==count[i])
printf("%d\n",i);
}
return 0;
} | 1 | 50,311,147 |
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >> S;
for(ll i = 1; i < S.size(); i++){
if(S[i]==S[i-1]){
cout << i << " " << i + 1 << endl;
return 0;
}
}
for(ll i = 2; i < S.size(); i++){
if(S[i]==S[i-2]){
cout << i - 1 << " " << i + 1... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
int main(){
string moji;cin>>moji;
bool flag=false;
if (moji.size()==2){
if (moji[0]==moji[1]){
cout<<"1 2"<<endl;
flag=true;
}
}else{
int now,middle,end;
for(int i=0;i<moji.size()-2;i++){
no... | 1 | 75,935,362 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int n,m;
cin >>n >>m;
vector<pair<ll, ll>> p(n);
rep(i,n){
cin >>p[i].first >>p[i].second;
}
sort(p.begin(), p.end());
ll ans = 0;
for(int i = 0; m>=0; i++){
if(p[i].sec... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 1 | 60,304,165 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #include <iostream>
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)
int N, M, A[1 << 18], B[1 << 18];
int c1[1 << 18], c2[1 << 18];
vector<int> X[1 << 18];
int main() {
cin >> N >> M;
f... | 1 | 83,691,968 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(const T& value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(const T& value, const Ts&... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { ... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <numeric>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = n-1; i ... | 1 | 62,219,022 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0; i<(ll)n; i++)
#define REPR(i, n) for(ll i=(ll)n-1; i>=0; i--)
#define FOR(i, m, n) for(ll i=(ll)m; i<(ll)n; i++)
#define FORR(i, m, n) for(ll i=(ll)m-1; i>=(ll)n; i--)
#define ALL(x) (x).begin(), (x).end()
#define ASC(v) s... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
string N;
cin >> N;
for (int i = 0; i < 3; i++) {
if (N.at(i) == '1')
N.at(i) = '9';
else
N.at(i) = '1';
}
cout << N << endl;
} | 1 | 51,647,892 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
int A[N];
long long count[200001] = {0};
for (int i = 0; i < N; i++) {
cin >> A[i];
count[A[i]]++;
}
long long totalCount = 0;
for (int i = 1; i < 200001; i++) {
if (count[i] > 1) {
... | #include<bits/stdc++.h>
#define ll long long
#define MAX 1000000000
#define INF 1000000
#define M 1000000007
#define PI 2 * acos(0.0)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int main(){
fast_io
ll n;
cin>>n;
ll a[n];
for(ll i = 0;i<n;i++)... | 1 | 30,831,293 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define ALL(x) (x).begin(), (x).end()
#ifdef _DEBUG
#define PRE_... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(a.begin(), a.end(),... | 1 | 84,612,604 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int r,d,x2000;
cin >> r >> d >> x2000;
vector<int> x(11);
x.at(0) = x2000;
for(int i = 1; i < 11; i++){
x.at(i) = r*x.at(i-1)-d;
cout << x.at(i) << endl;
}
} | 1 | 52,625,873 |
#include<bits/stdc++.h>
using namespace std;
long long n,L,a[100005],last=0,ansl,ansr,l=0,r,sum[100005];
int main(){
cin>>n>>L;sum[0]=0;ansl=0,ansr=n;
for(int i=1;i<=n;i++)cin>>a[i],sum[i]=sum[i-1]+a[i];
for(r=1;r<=n;r++){
while(sum[r]-sum[l+1]>=L)l++;
if(r-l<ansr-ansl&&sum[r]-sum[l]>=L){
ansr=r;
ansl=l;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | 1 | 85,633,062 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
string s;
int m;
cin >> s >> m;
string S;
for (unsigned int i = 0; i < (s.size() + m - 1) / m; i++)
printf("%c", s.at(i * m ));
} | #include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 ... | 1 | 73,067,154 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n,m;
cin >> n >> m;
vector<vector<ll>> G(n);
rep(i,m){
ll a,b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
ll ans=0;
queue<ll>... | #pragma GCC optimize ("O3")
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;
using ... | 1 | 10,278,427 |
#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() {
int i, N, K, l[110], count=0, A=0, B=0;
cin >> N >> K;
rep(i,N) cin >> l[i];
sort(l,l+N,greater<int>());
rep(i,K) count+=l[i];
cout << count;
} | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
int main() {
int N,K; cin >>N >>K;
vector<int> l(N);
rep(i,0,N) cin >>l[i];
sort(l.rbegin(),l.rend());
int ans=0;
rep(i,0,K) ans+=l[i];
cout <<ans <<endl;
r... | 1 | 68,949,938 |
#include <cstdio>
#include <cctype>
int main(void)
{
int chCounts[26] = {};
int ch, i;
while ((ch = getchar()) != EOF) {
if ('a' <= ch && ch <= 'z') {
chCounts[ch - 'a']++;
}
else if ('A' <= ch && ch <= 'Z') {
chCounts[ch - 'A']++;
}
}
for (i = 0; i < 26; i++) {
printf("%c : %d\n", 'a' + i, chCount... | #include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
int main()
{
char ch;
int a[26]={0};
char b[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
while( cin >> ch )
{
ch = tolower(ch);
if ( isalpha(ch) )
{
a[ch - 'a']++;
... | 1 | 57,199,250 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<ll> A(N); REP(i, N) cin >> A[i... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> static void getin... | 1 | 11,851,737 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int SUM(int n){
int sum = 0;
while(n>0){
sum += n%10;
n /= 10;
}
return sum;
}
int main(){
int a,b,n;
cin >> n >> a >> b;
int sum = 0;
int num;
for(int i = 1; i <= n; i++){
num = SUM(i);
... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | 1 | 39,637,715 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#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 rep11(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define repm(i,n) for(int i=(i... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repeat(i,s,n) for(int (i)=s; (i)<(n); (i)++)
#define revrep(i,n) for(int (i)=(n)-1;i>=0; i--)
vector<int> dz = {-1,0,1};
int main() {
cin.tie(0);
ios::sync_with_stdio(fal... | 1 | 34,539,670 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define doub... | #include<bits/stdc++.h>
#define ll long long int
#define INF 1000000000
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
ll h,n;
cin >> h >> n;
ll a[n+1], b[n+1];
for(ll i=0; i<n; i++) {
cin >> a[i] >> b[i];
}
ll dp[n+1][h+1];
dp[0][0] = 0;
for(ll i=1; i<=h;... | 1 | 74,346,916 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define size(x) (int)x.size()
const int N = 1e6 + 1, mod = 1e9 + 7, inf = 2e9;
int n;
ll ans = LLONG_MAX, sum[N];
int main() { cin.tie(0)->sync_with_stdio(0);
cin >> n;
for (int i = 1, x; i <= n; i++) {
cin >> x;
sum[i] = sum[i - 1] + x;
}
for ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int t,m,n,c=0;
cin>>n;
long long int v[n+10],u[n+10];
u[0]=0;
for(long long int i=1; i<=n; i++)
{
cin>>v[i];
u[i]=u[i-1]+v[i];
c+=v[i];
}
long long int mn=0x7fffffff;
for(long long int i=1;i<n... | 1 | 62,404,759 |
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
int n;
vector<string> a;
void input() {
cin >> n;
a.resize(n);
for (auto&& i : a)
cin >> i;
}
int count(string_view where, st... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<string> data(N);
for(int i=0; i<N; i++){
cin >> data.at(i);
}
int NfootA= 0;
int NheadB= 0;
int Nchimera= 0;
int cnt_intra= 0;
for(auto word:data){
if(word.back()=='A' && word.at(0)=='B'){
Nchimera++;
... | 1 | 27,611,894 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using namespace std;
int main() {
int n;
cin>>n;
int t,x,y;
int currentt = 0;
int currentx = 0;
int currenty = 0;
bool a = true;
for(int i = 0;i<n;i++) {
cin >>t>>x>>y;
if(t - currentt < abs(x ... | #include<bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector <long long> t(N+1, 0);
vector <long long> x(N+1, 0);
vector <long long> y(N+1, 0);
for (long long i=1; i<=N; i++) {
cin >> t.at(i) >> x.at(i) >> y.at(i);
}
bool ok=true;
for (long long i=1... | 1 | 83,536,701 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
char ch[1000];
while(1){
scanf("%s", ch);
int sum = 0;
if(ch[0] == '0'){
break;
}
for(int i = 0; i < strlen(ch); i++){
sum += ch[i] - '0';
}
prin... | #include <iostream>
using namespace std;
int main() {
string x;
int ans,i;
while (cin>>x && x != "0") {
ans = 0;
for (i=0;i<x.size();i++) {
ans += x[i] - '0';
}
cout << ans << endl;
}
return 0;
} | 1 | 57,840,656 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll MOD = 1000000007;
const int INF = 1e9 +5;
long long int mem[5001] = {INT_MIN};
int main()
{
ll int n,i;
cin>>n;
vector<ll int> h(n,0);
vector<ll int> dp(n,INF);
for(i=0;i<n;i++)
cin>>h[i];
dp[0]=0;
for(i=0;i<... | #include<bits/stdc++.h>
using namespace std;
int td(int n,vector<int> a)
{
vector<int> dp(n+1);
dp[1]=0;
dp[2]=abs(a[1]-a[2]);
for(int i=3;i<=n;i++)
{
dp[i]=min(abs(a[i]-a[i-1])+dp[i-1],abs(a[i]-a[i-2])+dp[i-2]);
}
return dp[n];
}
int main()
{
int n;
cin>>n;
vector<int> a... | 1 | 41,975,517 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main(){
ll a,b,c;
cin>>a>>b>>c;
ll t = max(0LL, a-c);
c = max(0LL,c - a);
ll aa = max(0LL, b-c);
cout<<t<<" "<<aa<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,m,k,p,q;
cin>>n>>m>>k;
if(n>k) cout<<n-k<<" "<<m<<endl;
else
{
cout<<0<<" ";
p=k-n;
q=m-p;
if(m>p) cout<<q<<endl;
else cout<<0<<endl;
}
} | 1 | 89,370,324 |
#include "bits/stdc++.h"
#include "math.h"
#include "string.h"
#include "algorithm"
using namespace std;
typedef int64_t ll;
typedef vector<int64_t> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define FOR(i,a,b) fo... | #include<iostream>
using namespace std;
int main()
{
long long n;
cin >> n;
--n;
cout << (long long)(n*(n+1))/2;
} | 1 | 5,489,803 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define int long long
using namespace std;
const int MOD=1e9+7;
const int INF=1e10;
int mx[9]={-1,0,1,-1,0,1,-1,0,1};
int my[9]={-1,-1,-1,0,0,0,1,1,1};
signed main(){
int ... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
ll H,W,N;
cin >> H >> W >> N;
map<P,int> mp;
rep(i,0,N){
int a,b;
cin >> a >> b;
a--,b... | 1 | 30,038,825 |
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
#include <array>
#include <bitset>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
us... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, a, b;
vector <int> solve(int n, int a, int b){
vector <int> ans(n);
int cur = 0;
for(int i = 0 ; i < n ; i++){
if(i % a == 0){
cur = max(1, n - i / a * a - a + 1);
... | 1 | 31,650,885 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
while(true){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if(m == 0)
break;
vector<int> p(m);
for(int i=0; i<m; i++)
cin >> p[i];
int amax = 0, ans;
for(int i=nmin; i<=nmax; i++){
if(p[i-1] - p[i] >= a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
int main(... | 1 | 81,213,228 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> A(N+1);
vector<ll> B(N);
ll cnt = 0;
for(int i=0;i<N+1;i++) {
cin >> A.at(i);
}
for(int i=0;i<N;i++) {
cin >> B.at(i);
}
for(int i=0;i<N;i++) {
if(A... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define vuni(v) ... | 1 | 90,683,363 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
int main()
{
string s;
cin >> s;
int size_s = s.length();
int sub_s, sub_e;
sub_s = -1, sub_e = -1;
for(int i=0; i<size_s-1; ++i){
if(s.substr(i, 1) == s.substr(i+1, 1)){
sub_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 10000000;
int main() {
string s;
cin >> s;
for (int i = 1; i < s.size(); i++) {
if (s[i-1] == s[i]) {
cout << i << " " << i+1 << endl;
return 0;
}
}
for (int i = 0; i+2 < s.siz... | 1 | 46,763,914 |
#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;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
inline void setPrecision(int n){cout.precision(n);}
#define dbg(x) cerr<<(#x)<<": "<<x<<endl
#define dbgV(x) cerr<<(#x)<... | 1 | 71,992,677 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef pair< int,int > ii;
typedef pair< double,double> dd;
#define... | 1 | 40,345,220 |
#include<iostream>
#include<cstdlib>
#include<cstdio>
#define N 100001
#define NIL -1
using namespace std;
int parent[N];
int leftc[N];
int rightc[N];
int degree[N];
int depth[N];
int main(){
int n,i,j,id,child,bef;
int flag=0;
for(i=0;i<N;i++){
parent[i]=NIL;
leftc[i]=NIL;
rightc[i]=NIL;
degree[i... | #include <iostream>
#include <vector>
#include <cstdio>
#include <string>
using namespace std;
struct Node
{
int id;
int parent = -1;
int depth = 0;
string type = "internal node";
vector<int> children = {};
};
int main()
{
int n;
cin >> n;
vector<Node> nodes(n);
for (int i = 0; i < n; i++) {
int id;
int ch... | 1 | 70,228,284 |
#include<bits/stdc++.h>
#include<algorithm>
#include<set>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stack>
using namespace std;
typedef long long int ll;
const int MOD=1e9+7;
ll power(ll a, ll b){
ll ans=1;
while(b>0){
if(b%2!=0)
ans=ans*a;
b/=2;
a=a*a;
... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define MAX 1005
#define MOD 1000000007
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi 3.14159265358979323846
#define Q ll _; cin >> _; while(_--)
#define endl "\n"
#define flush ff... | 1 | 64,729,993 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
char c;
cin >> c;
c += 1;
cout << c << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
char c;
cin>>c;
char d=char(c+1);
cout<<d<<endl;} | 1 | 40,042,702 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,m,d;
cin >> n >> m >> d;
double ans;
if(d==0){
ans=(1.0)/(double)n;
ans*=(m-1);
}else{
ans=(double)(2.0*(n-d))/(double)(n*n);
ans*=(m-1);
}
printf("%.10lf\n",ans);
return 0;
} | #include <iostream>
#include <iomanip>
using namespace std;
int main(){
double n,m,l;
cin>>n>>m>>l;
if(l==0){
cout << std::setprecision(20) <<(m-1)/n<<endl;
}else{
cout << std::setprecision(20) <<(m-1)*(2*(n-l))/(n*n)<<endl;
}
} | 1 | 92,973,891 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<string> S(H);
for (int i = 0; i < H; i++){
cin >> S.at(i);
}
vector<vector<int>> dp(120, vector<int>(120, 0));
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
if (i == 0 && j == 0){
if... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 998244353
#define INF 1 << 30
#define MAX 1 << 18
int solve(int src, int count, vector<vector<int>>& adj, vector<bool>& color, int* dp) {
if(dp[src] != -1) {
return dp[src];
}
int ans = MAX;... | 1 | 82,296,278 |
#include <bits/stdc++.h>
#include <string>
#include <sstream>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define clr(a) memset(a, 0, sizeof(a))
#define set(a) memset(a, -1, sizeof(a))
#define pb push_back
#define sz(a) ((ll)a.size())
#define all(a) a.begin(), a.end()
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans=0;
int p=1;
for(int i=0;i<n;i++){
int a;
cin >> a;
if(a==p) p++;
else ans++;
}
if(p==1) cout << -1 << endl;
else cout << ans << endl;
} | 1 | 76,384,189 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair... | 1 | 66,363,628 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define MOD 1000000007
#define PI 3.14159265
#define EPS 1e-9
#define Pi acos(-1.0)
typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define forr(i,a,b) for(int i=(a); i<(b); i++)
#define clean(arr,val)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
string s1, s2;
cin >> s1 >> s2;
sort(s1.begin(), s1.end());
sort(s2.rbegin(), s2.rend());
int n1 = s1.size();
int n2 = s2.size();
if(s1 == s2 && n1 < n2) {
cout << "Yes\n";
}
else if(s1<s2) cout << "Yes\n";
... | 1 | 40,126,663 |
#include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#include <queue>
#include <math.h>
#include <bitset>
#define INF 100000000000
#define ll long long
using namespace std;
struct UnionFind {
vector<ll> par;
UnionFind(ll N) : par(N) {
for(ll i = 0; i < N; i++) par[i] = i;
}
ll root(... | #include<iostream>
#include<cstring>
using namespace std;
const int N=2e5+10;
int n,m;
int p[N];
int Size[N];
int find(int x){
if(x!=p[x]) p[x]=find(p[x]);
return p[x];
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;++i){
p[i]=i;
Size[i]=1;
}
for(int i=0;i<m;++i){
int a,b;
... | 1 | 74,483,691 |
#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;
int main(int argc, char* argv[]){
cin.tie(0);... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 1 | 66,493,594 |
#include<stdio.h>
int main(){
int n,x;
while(true){
scanf("%d%d",&n,&x);
if (n==0&&x==0)break;
int a=0;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
if(i+j+k==x&&i<j&&j<k){
a++;
... | #include <iostream>
using namespace std;
int main() {
int n, x, result;
cin >> n >> x;
while(n != 0 || x != 0) {
result=0;
for(int i=1; i <= n-2; i++) {
for(int j=i+1; j <= n-1; j++) {
for(int k=j+1; k <= n; k++) {
if(i+j+k == x) result++;
}
}
}
cout << result... | 1 | 37,913,277 |
#include <iostream>
#include <bits/c++io.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main()
{
int x;
cin>>x;
cout<<x/3<<endl;
} | #include <bits/stdc++.h>
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 repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reprl(i, n) for(ll i = n; i >= 0; i... | 1 | 57,862,722 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
templat... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
int ans;
if(H%3==0 || W%3==0) ans=0;
else if(H==2 && W==2) ans=1;
else{
int pall = min(H, W);
int triH = max({H/3*W, (H-H/3)*(W/2), (H-H/3)*((W+1)/2)})-min({H/3*W, (H-H/3)*(W/2), (H-H/3)*((W+1)/2)}... | 1 | 22,589,805 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main()
{... | #include <iostream>
using namespace std;
int main(){
const int inf = 1000000;
int N, M;
cin >> N >> M;
int a[1000], b[1000], c[1000], dist[100][100];
for(int i = 0; i < M; i++){
cin >> a[i] >> b[i] >> c[i];
a[i]--, b[i]--;
}
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
if(i==j... | 1 | 89,151,313 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
using namespace std;
const int md = 1e9 + 7;
int m, n;
int x[111111], p[3];
int main(){
scanf("%d%d",&n,&m);
for(int q = 1; q <= 2; ++q){
if (q == 2) n = m;
long long tmp = 0, al = 0;
for(int i = 1; i <= n; ++i){
scanf("%d",&x[i]);
tmp += ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7, N = 1e5 + 7;
int x[N], y[N];
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> x[i];
}
for(int i = 1; i <= m; i++) {
cin >> y[i];
... | 1 | 82,652,327 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y;
scanf("%d %d", &x, &y);
if (abs(x - y) > 1) {
printf("Alice\n");
} else {
printf("Brown\n");
}
} | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
int main() {
LL X, Y;
scanf("%lld %lld", &X, &Y);
if (abs(X - Y) < 2) puts("Brown");
else puts("Alice");
return 0;
} | 1 | 64,057,135 |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9+7
using ll = long long;
using P=pair<int,int>;
using lP=pair<ll,ll>;
using fP=pair<double,double>;
ll c... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n), s(n+1, 0);
map<ll, ll> seq;
for(int i = 0; i< n; i++... | 1 | 64,916,224 |
#include<iostream>
using namespace std;
int main(){
string S, T;
cin >> S >> T;
S.push_back(T.at(S.size()));
if(S == T){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e2 + 5;
const int INF = 1e9 + 7;
string s, t;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s >> t;
if (t.substr(0, s.size()) == s)
cout << "Yes";
else
cout << "No";
return 0;
} | 1 | 2,414,210 |
#include <bits/stdc++.h>
using namespace std;
int main() {
unordered_set<long long> s;
int h, w;
cin >> h >> w;
vector<int> cr(h), cc(w);
int m;
cin >> m;
for (int i = 0 ; i < m; ++i) {
int r, c;
cin >> r >> c;
--r; --c;
++cr[r]; ++cc[c];
s.insert(1LL ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;... | 1 | 80,688,474 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using ll = long long;
#define INF 1e9
int main() {
string s; cin >> s;
ll ans = 0; ll cur = 0;
REP(i, s.size()) {
if (s[i] == 'W') {
ans += i - cur;
++cur;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
#def... | 1 | 29,775,195 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(register int i=(a);i<(b);++i)
#define ROF(i,a,b) for(register int i=(a);i>=(b);--i)
#define pi pair<int,int>
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
const int maxn = 300005;
const int ... | #include<bits/stdc++.h>
#define int long long int
#define ull unsigned long long int
#define getFaster ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define rep(i,init,n) for(int i=init;i<n;i++)
#define rev(i,n,init) for(int i=n;i>=init;i--)
#define MAXN 1200005
#define MOD 1000000007
#define f first
#d... | 1 | 21,530,006 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int xg=x;
for(int i=0;i<n;i++){
int xi;
cin>>xi;
xg=max(xg,xi);
}
int yl=y;
for(int i=0;i<m;i++){
int yi;
cin>>yi;
yl=min(yl,yi);
}
cout<<(xg<yl?"No War":"War")<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x%y) : x;
}
int main() {
int n, m, x, y; cin >> n >> m >> x >> y;
int x_max = x;
int y_min = y;
... | 1 | 68,012,716 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LC... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_bac... | 1 | 30,350,377 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long n;
cin >> n;
vector<bool> seats(20);
string first, last;
long long l = 0, r = n-1;
cout << 0 << endl;
cin >> first;
if(first == "Vacant") return 0;
cout << n-1 << end... | #include <bits/stdc++.h>
#define P pair<int, int>
using namespace std;
const int INF=1e5;
int main(){
int n, r, l, r_s, l_s;
string s;
cin >> n;
cout << 0 << endl;
cin >> s;
if(s=="Vacant")return 0;
r = 0;
r_s = (s=="Male"?0:1);
cout << n-1 << endl;
cin >> s;
if(s=="Vacant")return 0;
l = n-1;
... | 1 | 21,045,627 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define re... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,vl>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
const ll INF=1LL<<60;
const ll MOD=1000000007;
int main(){
string S;
cin >> S;
ll N=S.size();
vector<vector<... | 1 | 87,854,339 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int q;
int a, b;
bool solve(int v){
int pos = v / 2;
for(int i = max(1ll, pos - 10); i <= min(v, pos + 10); i++){
int diff = v - i;
int u = 1 + diff;
int v = i;
if(v <= b) v--;
if(u >= a) u++;
if(... | #include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<unordered_map>
#include<stack>
#include<string>
#include<algorithm>
#include<functional>
#include<cstring>
#include<complex>
#include<bitset>
#include<iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typed... | 1 | 1,448,278 |
#include <iostream>
#include <array>
#include <string>
int main()
{
std::string s;
std::cin >> s;
bool varied = true;
std::array<bool, 26> count = {false};
for (const auto c : s)
{
if (count[c - 'a'])
{
varied = false;
break;
}
count[c - 'a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define repd(i, a, b) for (int i = a; i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#... | 1 | 2,204,217 |
#include "bits/stdc++.h"
#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++)
using namespace std;
const int INF = 1 << 30;
const long long MOD = 1000000000 + 7;
const double PI = acos(-1);
int main() {
int A, P; cin >> A >> P;
cout << (A * 3 + P) / 2;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | 1 | 57,723,835 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll pow2(long long n) {
ll ret = 1;
ll x = 2;
while (n > 0) {
if (n & 1) ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
int main() {
ll a,b,c,h,i,j,k,l,m,n,... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex... | 1 | 35,650,201 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 100002;
long long ans[MAXN]={0};
int num[13]={0};
int maxlen;
long long getnum(){
long long ret=0;
for(int i=maxlen;i>=0;i--)
ret=ret*10+num[i];
return ret;
}
void op(){
for(int i=0;i<=maxlen;++i){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0, xxx_rep_end = (n); i < xxx_rep_end; ++i)
#define all(x) (x).begin(), (x).end()
template <class T1, class T2>
inline bool chmax(T1 &a, const T2 &b) {
if (a < b) {
... | 1 | 20,765,205 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int main(){
int n,k;
cin>>n>>k;
if(k==1){
cout<<0<<endl;
return 0;
}
cout<<n-k<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n, k; cin >> n >> k;
if(k == 1) cout << 0 << endl;
else if(0 < n - k) cout << n - k << endl;
else cout << 0 << endl;
return 0;
} | 1 | 1,186,659 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pcnt(bit) __builtin_popcountll(b... | #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 sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using ... | 1 | 19,190,136 |
#include <bits/stdc++.h>
using namespace std;
const int md = 998244353;
inline int mul(int a, int b) {
return (long long) a * b % md;
}
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i];
}
int maxd = *max_element(d.begin(), d.... | #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; }
template<typen... | 1 | 100,849,624 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,K,X,Y,s1,s2=0;
cin>>N>>K>>X>>Y;
if(N<K)
{
K=N;
s1=K*X;
}
else
s1=K*X;
s2=(N-K)*Y;
cout<<s1+s2<<endl;
return 0;
} | #include<bits/stdc++.h>
#include <unordered_map>
#define int long long int
#define double long double
#define endl "\n"
#define PI 3.141592653589793238462643383279502884
#define sp(x) setprecision(x)
#define ceil(a,b) (a+(b-1))/b
#define LCM(a,b) (a*b)/__gcd(a,b)
#define all(v) v.begin(),v.end()
#define alls(s,... | 1 | 28,421,567 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_... | 1 | 38,620,376 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <utility>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int sum = 0;
unordered_map<int, long> counter;
counter[0]++;
for (int i = 0; i <... | #include<bits/stdc++.h>
using namespace std;
map<long long int,long long int> mp;
int main(){
int n;
long long int m;
cin >> n >> m;
long long int a[n];
long long int sum =0;
for(int i=0;i<n;i++){
cin >> a[i];
sum += a[i];
sum %= m;
mp[sum]++;
}
long long ... | 1 | 25,152,446 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <cstdint>
#include <iomanip>
using ll = long long;
int main(){
ll n, d, x; std::cin >> n >> d >> x;
std::vector<ll> a;
for(int i=0; i<n; i++){
ll b; std::cin >> b; a.push_back(b)... | using namespace std;
#include <bits/stdc++.h>
int main()
{
int n,d,x,a[n],b=0,c=1;
cin>>n>>d>>x;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
b=0;
while(b<d){
b+=a[i];
c++;
}
}
std::cout << c+x-1 << std::endl;
return 0;
... | 1 | 68,141,876 |
#include <bits/stdc++.h>
using namespace std;
int apple[3][100005], need[2], siz[3];
int main() {
int x, y, a, b, c;
scanf("%d%d%d%d%d", &need[0], &need[1], &siz[0], &siz[1], &siz[2]);
for (int i = 0; i < 3; i++) {
for (int j = 0; j < siz[i]; j++) {
scanf("%d", &apple[i][j]);
}
sort(apple[i], apple[i] + siz... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int x, y, a, b, c; cin >> x >> y >> a >> b >> c;
vector<ll> h;
vector<ll> p(a);
for (int i = 0; i < a; i++) {
cin >> p[i];
}
sort(p.rbegin(), p.rend());
for (int i = 0; i < x; i++) {
h.push_back(p[i]);
}
vector<ll> q(b);
fo... | 1 | 96,226,447 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end(... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <deque>
#include <queue>
#include <fstream>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <set>
#include <map>
#include <list>
#define endl "\n"
typedef long long ll;
using namespace std;
void Lancer() { ios::sync_with... | 1 | 6,703,867 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <cctype>
#include <numeric>
using namespac... | #include <cstdio>
int main()
{
int N, M, P;
while (scanf("%d %d %d", &N, &M, &P) != EOF) {
if (N == 0 && M == 0 && P == 0)
break;
int sum = 0, m = 0, t;
for (int i = 0; i < N; ++i) {
scanf("%d", &t);
sum += t;
if (i == (M-1))
m = t;
}
sum *= 100 * ((100 - P) / 100.0);
if (m == 0)
printf... | 1 | 61,261,390 |
#include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1000000000000000LL
#define F... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <stack>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
string ... | 1 | 95,747,080 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int n, total = 0;
scanf("%d", &n);
vector<int> v(n);
rep(i,n){
scanf("%d ", &v[i]);
total += v[i];
}
int s, min = 1e5;
rep(t,n){
s = 0;
rep(i,t){
s += v[i];
}
if ( abs(total - 2*s) <= min ) min = abs(t... | #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() {
int n;
cin >> n;
vector<int> w(n);
rep(i,n) cin >> w.at(i);
int ans=50000;
rep(i,n+1){
int s1=0;
int s2=0;
rep(j,n){
... | 1 | 61,710,339 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int k,a,b;
cin >> k >> a >> b;
long long int count=1;
if(b-a<=2 || k-(a-1)<2){
count+=k;
}
else{
if((k-(a-1))%2==1){
count+=a;
count+=(k-a)*(b-a)/2;
}
else{
cou... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
ll K, A, B; cin >> K >> A >> B;
ll cur = 1;
ll mon = 0;
while (K > 0) {
if (cur < A && (K > A - cur)) {
K -= A - cur;
cur = A;
... | 1 | 78,624,330 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,k,c=0;
cin>>n;
long long A[n];
for(i=0;i<n;i++)
{
cin>>k;
A[k]=i+1;
}
for(i=1;i<=n;i++)
cout<<A[i]<<" ";
return 0;
} | #include<iostream>
#include<queue>
#include<algorithm>
#include<numeric>
#include<string>
#include<map>
#include<bitset>
using namespace std;
using int_greater_PQ = priority_queue<int,vector<int>,greater<int>>;
int main()
{
int N;
cin>>N;
map<int,int>A;
for(int i=0;i<N;++i)
{
int a;
... | 1 | 97,482,636 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.