code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#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 repa(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<... | #include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;r... | 0 | 99,438,916 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
const ll mod=1e9+7;
int main(void){
ll s;
cin>>s;
ll f[s+1];
rep(0,i,s+1)f[i]=0;
f[0]=1;
rep(0,i,s+1){
rep(3,j,s+1)if(i+j<s+1)f[i+j]=(f[i]+f[i+j])%mod;
}
cout<<f[s];
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647 >> 1);
static const ll LLINF = (9223372036854775807 >> 1);
static const int MAX = 1e5... | 0 | 37,920,322 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s, t;
cin >> s;
cin >> t;
char memo[26] = {};
char memo1[26] = {};
string ans = "Yes";
for(int i = 0; i < s.length(); i++){
if(memo[t[i]-'a'] == 0){
memo[t[i]-'a'] = s[i];
}else if(memo[... | 0 | 84,315,877 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(obj) (obj).begin(), (obj).end()
#define bit(n) (1LL << (n))
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int ... | 0 | 36,446,319 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
#include <fstream>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#de... | 0 | 84,895,971 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=l;i<=r;++i)
const int N=1e5+5;
vector<int>lk[N];
int sg[N];
void dfs(int x,int fr)
{
for(auto y:lk[x])
if(y!=fr)
{
dfs(y,x);
sg[x]^=sg[y]+1;
}
}
int main()
{
int n;
cin>>n;
rep(i,1,n-1)
{
int x,y;
scanf("%d%d",&x,&y);
lk[x].push... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 5,854,467 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<deque>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vecto... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, ans{};
string S;
cin >> N >> S;
vector<vector<int>> v(10);
for (int i = 0; i != N; ++i)
v[S[i]-'0'].push_back(i);
for (int i = 0; i != 10; ++i) {
if (v[i].empty()) continue;
for (int k = 0; k != 1... | 0 | 96,905,758 |
#include <iostream>
#include <string>
#include <vector>
int main(void){
int n, m, frag, max = 0, i, j;
std::string str;
std::cin >> n;
std::vector<std::string> s(n);
std::vector<int> c(n);
for(i=0; i<n; i++){
std::cin >> str;
for(j=0, frag=0; j<i; j++){
if(s.at(j) == str){
c.at(j)++;
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, m, x, y; cin >> n >> m >> x >> y;
... | 0 | 1,063,194 |
#include<iostream>
#include<queue>
#include<string.h>
using namespace std;
char map[1005][1005];
char map1[1005][1005];
int a[1005][1005];
int m,n,q,num=0;
int main()
{
int x,y;
cin>>m>>n>>q;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>map[i][j];
if(map[i][j]=='S')
{
x=i;
y=j;
ma... | #include<iostream>
#include<string>
using namespace std;
int main()
{
string s;
cin >> s;
if (!(s.at(0) == 'A' && s.at(1) >= 'a'))
{
cout << "WA";
return 0;
}
bool Ced = false;
for (int i = 2; i < s.size(); i ++)
{
if (s.at(i) == 'C')
{
if (!Ced)
{
if (i != s.size() ... | 0 | 13,153,241 |
#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++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long l... | #include<iostream>
#include<vector>
#include<algorithm>
using ull = unsigned long long;
int main() {
ull n;
std::cin >> n;
ull A[10001]{};
for (ull i{}; i < n; ++i) {
ull t;
std::cin >> t;
++A[t];
}
auto count{0};
for (ull i{}; i < 10001; ++i) {
for (ull j{}; j < A[i]; ++j) {
std::cout << i << (count<... | 0 | 58,174,207 |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const int maxn = 2e6 + 10;
const double... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LB long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii pair<double,double>
#define LOWBIT(x) x... | 0 | 54,337,948 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
int intinput() {
int x;
cin >> x;
return x;
}
vector<int> forintinput(int n) {
vector<int> x(100000);
for(int i = 0;i < n;i++) cin >> x[i];
return x;
}
int main(){
char a;
cin >> a;
int cnt = 0;
if(a == 'a'){
cnt++;
}
if(a == 'b'){
cnt++;
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define DECIMAL(n) std::cout << std::fixed;std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14... | 0 | 8,191,228 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n,a,b;
cin>>n>>a>>b;
ll var1=n%(a+b);
ll var2=n/(a+b);
ll ans=var2*a + min(var1,a);
cout<<ans;
return 0;
} | #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... | 0 | 67,299,948 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
for(int i=N;i<1000;i++) {
if((i/100) == ((i/10)%10) && (i/100) == (i%10)) {
cout << i << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n , k;
int add (int a , int b) {
a = (a % k + k) % k;
b = (b % k + k) % k;
return (a + b) % k;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> k;
vector<int> a(n + 1);
for (int i = 1 ;i <= n ;i++)
cin >> a... | 0 | 12,298,612 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#def... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const double PI = 3.14159265358979;
int dist[8][8];
s... | 0 | 4,113,033 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <unordered_map>
using namespace std;
#define TEST
#ifdef TEST
#define dout cout
#else
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n){
for(int i = 0; n > i; i++)par[i] = i;
}
int root(int n){
if(par[n] == n)return n;
return par[n] = root(par[n]);
}
void unit... | 0 | 62,292,908 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
using ll = long long;
ll n;
cin >> n;
vector<ll> a(n);
ll sum = 0;
for(int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
ll x = n * (n+1) / 2;
if(sum % x != 0)
{
cout << "NO" << endl;
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 93,886,431 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if(A[0]!=A[1] && A[0]!=A[2] && A[1]!=A[2]){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define dupl(s) s.erase(unique(s.begin(), s.end()), s.end());
#include <bits/stdc++.h>
using namespace std;
int sum(vector<int> s){return accumulate(s.begin(),s.end... | 0 | 86,809,927 |
#include <stdio.h>
#include <iostream>
#include <climits>
#include <map>
#include <cmath>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <vector>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <utility>
#include <queue>
using namespace std;
#define ll long long
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii > vii;
typedef vector<pll > vll;
#define pb push_back
#define mp make_pair
#define ar array
#define mod 1000000007
#define F first
#de... | 0 | 22,143,090 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
int main() {
int N, M; cin >> N >> M... | #include <bits/stdc++.h>
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define rep(i,n) FOR(i,0,n)
using namespace std;
typedef long long ll;
ll w,h,p,num[2],ans;
vector<pair<ll,bool>>vec;
int main(){
cin>>w>>h;
num[0]=h+1;
num[1]=w+1;
rep(i,w+h){
cin>>p;
vec.push_back({p,i<w});
}
... | 0 | 51,784,642 |
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll... | #pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
using namespace std;
#define BOOST
#ifdef BOOST
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/range/adaptor/reversed.hpp>
using namespace boost;
using ml = boost::multiprecision::... | 0 | 32,580,530 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e12
#define mo 1000000007
ll dp[101][100001];
ll a[101];
ll n,k;
ll solve()
{
for(ll j=0;j<=a[1];j++)
{
dp[1][j] = (j<=a[1])?1:0;
}
for(ll i=2;i<=n;i++)
{
for(ll j=0;j<=k;j++)
{
if(j==0)
{
dp[i][j] = dp[i-1][j];
}
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define sz(x) ((x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end... | 0 | 17,596,419 |
#include <cstdio>
#include <algorithm>
typedef long long LL;
const int MN = 100005;
int N, K, A[MN];
LL S1p[MN], S1s[MN];
LL S2p[MN], S2s[MN];
LL Sum[MN], Ans;
int main() {
scanf("%d%d", &N, &K);
for (int i = 1; i <= N; ++i) scanf("%d", &A[i]), Sum[i] = Sum[i - 1] + A[i];
for (int i = 1; i <= N; ++i)
S1p[i] = S1p[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(int i = a; i < b; i++)
typedef pair<int,int> pii;
ll C2(ll k){
ll cnt = 0;
while(k % 2 == 0){
cnt++;
k /= 2;
}
return cnt;
}
map<long long, int> prime_factor(long long n){
map< long long, int... | 0 | 56,969,181 |
#include <iostream>
#include <string>
#include <utility>
using namespace std;
void printArray(string c[], int n) {
string sep = "";
for (int i = 0; i < n; i++) {
cout << sep << c[i];
sep = " ";
}
cout << endl;
}
bool isStable(string c[], string stableArray[], int n) {
bool stable = t... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | 0 | 80,090,741 |
#include <cstdio>
#include <iostream>
#include <type_traits>
#include <vector>
using namespace std;
class DisjointSet {
private:
vector<int> p, height;
public:
DisjointSet(int size) {
p.resize(size, 0);
height.resize(size, 0);
for (int i = 0; i < size; ++i)
p[i] = i;
}
int find(int v) {
if (p[v] != v)
... | #include<bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
#define FOR(i , a , b) for(int i = (a) ; i < (b) ; i++)
#define REP(i , n) for(int i = 0 ; i < n ; i++)
#define REPR(i , n) for(int i = n ; 0 <= i ; i--)
#define ROP(i, n) for(int i = 1 ; i <... | 0 | 3,388,002 |
#include <bits/stdc++.h>
typedef long long int lli;
#define mod 1000000007
#define MOD 1003
#define li long int
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int arr[n+1];
for (int i=0;i<n;i++) cin>>arr[i];
int dp[n+1];
for (int i=0;i<n+1;i++) dp[i... | #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>;
int main() {
string s;
cin >> s;
rep(bit,(1<<3)){
ll sum = s[0]-'0';
string ans= "";
ans += s[0];
rep(i,3){
if (bit & (1<<i)) {
sum += s[i... | 0 | 83,298,633 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
long long K;
cin >> S >> K;
long long cont = 0;
long long contS = 0;
long long contE = 0;
if(K == 1){
for(int i = 0; i < S.size();i++){
if(i != S.size()-1){
if(S[i] == S[i+1]){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int n, k, ans = 1;
cin >> n >> k;
rep(i, n) {
if(ans * 2 <= ans + k) {
ans = ans * 2;
}
else {
ans = ans + k;
}
}
cout << ans << endl... | 0 | 83,928,224 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i,n) for(int i=0;i<n;... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define itn long long
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rrep(i,n) for(int i=(int)(n);i>=0;--i)
#define debug(x) cout << #x << "=" << (x) << endl;
const ll MOD=1e9+7;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;}... | 0 | 18,814,358 |
#include<iostream>
using namespace std ;
int main()
{
int A,B,K ;
cin>>A>>B>>K ;
for(int i=0;i<K;i++){
if(i%2==0){
if(A%2!=0){
A-- ;
B+=(A/2) ;
A/=2 ;
}else{
B+=(A/2) ;
A/=2 ;
}
}else{
if(B%2!=0){
B-- ;
A+=(B/2) ;
B/=2... | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 201010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
templ... | 0 | 56,267,840 |
#define _GLIBCXX_DEBUG
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<string>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define rep2(i,s,n) fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<string> S(N);
for (int i = 0; i < N; i++) {
cin >> S[i];
}
auto f = [&](int a, int b) {
vector<string> T = S;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N;... | 0 | 27,362,467 |
#include <bits/stdc++.h>
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 1000000000
#define PB ... | #include<iostream>
#include<string.h>
using namespace std;
#define MAX_N 1000000
int main(){
int dp[MAX_N];
int n,m,c[100];
memset(dp,-1,sizeof(dp));
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>c[i];
}
for(int i=1;i<=m;i++){
dp[c[i]]=1;
}
for(int i=1;i<=20;i++){
for(int j=1;j<=n;j++){
if(dp[j]!=-1){
fo... | 0 | 59,341,315 |
#include <bits/stdc++.h>
#define rep(i, ns, ne) for (int i = ns; i < ne; ++i)
using namespace std;
int main() {
string s, ans;
cin >> s;
rep(i, 0, s.size()) {
if (s[i] == '0') {
ans += "0";
} else if (s[i] == '1') {
ans += "1";
} else {
if (!ans.empty()) {
ans.pop_back();
... | #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)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 39,744,656 |
#include <bits/stdc++.h>
#define FOR(i, c) for (int i = 0; i < c; i++)
#define MOD 1000000007
using namespace std;
int cb(int n, int i) {
int res = 1;
for (int j = 0; j < i; j++) {
res = res*(n-j)/(j+1);
}
return res;
}
int main() {
int n , m;
cin >> n >> m;
cout << cb(m, 2) + cb(n, 2) << endl;
ret... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | 0 | 42,213,348 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <string>
#include <bitset>
using namespace std;
#define rep(I,N) for(int I = 0; I < (int)(N);... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
if(n < 105){
cout << 0 << endl;
return 0;
}
int r = 0;
for(int i = 105;i <= n;i += 2){
int cnt = 0;
for(int j = 1;j * j < i;j++){
if(i % j == 0){
cnt++;
... | 0 | 25,495,560 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
while (m--) {
int a, b;
cin >> a;
cin >> b;
mp[a]++;
mp[b]++;
}
for (auto &x :mp) {
if ((x.second) % 2 != 0) {
cout << "NO" << endl;
... | #include<iostream>
#include<cmath>
#include<numeric>
#include<functional>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<iomanip>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define ll long long
#define INF 2147483647
using namespace std;
us... | 0 | 34,920,571 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
using namespace std;
int main(void) {
int n, x;
while(cin >> n >> x){
if( n == 0 && x == 0 ) break;
long long int cnt = 0;
for(int i=1; i<=n; i++){
for(int j=i+1; j<=n; j++){
if( i >= x -... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
int heights[10];
for(int i = 0; i <= 9 ; i++){
cin >> heights[i];
}
sort(heights , heights + 10);
cout << heights[9] << endl << heights[8] << endl << heights[7] << endl;
return 0;
} | 0 | 35,973,083 |
#include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repn(i,a,b) for(int i=a;i>=b;i--)
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define pb p... | #include<bits/stdc++.h>
using namespace std;
#define DIV 1000000007
long long N, K;
long long mini[200005];
long long maxi[200005];
int main(){
cin >> N >> K;
for(long long i = 0; i < N+1; i++) {
mini[i+1] = i + mini[i];
mini[i+1]%=DIV;
}
for(long long i = 0; i < N+1; i++) {
maxi[i+1] = (N - i) + maxi[i];
m... | 0 | 36,917,442 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
ll solve(ll W, ll H) {
ll mi = min(W, H);
for (ll i = 1; i < W; i++) {
ll wi = W - i;
ll C1 = i * H;
ll C2 = wi*(H/2);
ll C3 = wi*((H/2) + (H%2 == 1));
... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 0 | 91,274,373 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll n,m;
cin >> n >> m;
if(n==2 || m==2){
cout << 0 << endl;
}
else if(n==1 && m==1){
cout << 1 << endl;
}
else if(n==1){
cout << max((ll)0,m-2) << endl;
}
else if(m==1){
cout << max(... | #include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cmath>
#include <iomanip>
#include <deque>
#include <queue>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <sstream>
typedef ... | 0 | 35,849,062 |
#include <iostream>
#include <cctype>
using namespace std;
int main() {
string str;
getline(cin, str);
for (int i=0; i<str.length(); i++) {
char c = str[i];
if ('A' <= c && c <= 'Z') {
cout << (char)tolower(c);
} else if ('a' <= c && c <= 'z') {
cout << (char)toupper(c);
} else ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
void doit(){
... | 0 | 80,952,419 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
ll gcd(ll a, ll b){ if(b==0){ return a; } return ... | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n;
scanf("%d", &n);
for(int i=0;i<n;i++){
vector<int> t(3);
for(auto&e:t){
scanf("%d",&e);
}
sort(t.begin(),t.end());
... | 0 | 33,612,530 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | 0 | 12,566,771 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int> p(n);
for(int i=0;i<n;i++){
int a;
cin >> a;
p[i]=a;
}
sort(p.begin(),p.end());
int ans=0;
for(int i=0;i<k;i++){
ans = ans + p[i];
}
cout << ans << endl;
} | #define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
ll N;
cin >>... | 0 | 100,574,165 |
#include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(),in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
vector<int> prime(int n)... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <map>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <memory>
using namespace std;
#if 1
#define PRINT(x) ... | 0 | 64,827,729 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | #include <iostream>
using namespace std;
#define LIM 20
int w,h,sx,sy,ans;
bool field[LIM][LIM];
char buff[LIM];
bool flg=true;
void input(void);
void dump(void);
void dfs(int, int);
void solve();
int main(void)
{
while(true){
input();
if(!flg)break;
dfs(sx,sy);
solve();
}
r... | 0 | 76,819,003 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,m,x,y,i=0; cin>>n>>m;
vector< pair<int,int> > adj[n+5];
for(int i=1;i<=m;i++){
cin>>x>>y;
adj[x].push_back(make_pair(y,i));
}
for(int i=1;i<=n;i++)sort(adj[i].begin(),adj[i].end());
vector<pair<in... | #include <iostream>
#include <cmath>
#include <climits>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
#include <numeric>
#include <set>
#include <queue>
#include <bitset>
using namespace std;
#define ll long long
#define ld long double
#d... | 0 | 23,912,942 |
#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)
int N, M;
void func()
{
cin >> N >> M;
if (M >= N)
cout << "unsafe" << endl;
else
{
cout << "safe" << endl;
}
}
int main()
{
func();
} | #pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
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++)
#define rev(i, n) for(int i = (... | 0 | 2,818,605 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#def... | 0 | 38,479,061 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main()
{
int x, y, a, b;
cin >> x >> y;
b = (y - 2 * x);
if (b % 2 == 1)
{
cout << "No";
return 0;
}
b /= 2;
a = x - b;
if (a >= 0 && b >= 0)
cout << "Yes";
else
... | #include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define M 1000000007
using namespace std;
int main()
{
ll n,x,y,sum=0;
c... | 0 | 60,167,328 |
#include <bits/stdc++.h>
using namespace std;
long long n,a,b;
int main()
{
cin >> n >> a >> b;
if ((b - a) % 2 != 0) cout << "Borys\n";
else cout << "Alice\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long pow_mod(long long n, long long k, long long m) {
if ( k == 0 ) { return 1; }
if ( k%2 == 0 ) {
long long t = pow_mod(n, k/2, m);
return t*t % m;
}
return n * pow_mod(n, k-1, m) % m;
}
long long comb_mod(long long n, ... | 0 | 11,100,217 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
int n;
cin >> n;
vector<ll> t(n);
ll ... | #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... | 0 | 79,649,311 |
# include <iostream>
# include <cstdio>
using namespace std;
int main(void)
{
char a[100];
scanf("%s",a);
if (a[2]==a[3]&&a[4]==a[5]) printf("Yes\n");
else printf("No\n");
return 0;
} | #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... | 0 | 22,225,088 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(void) {
int H, W;
cin >> H >> W;
vector<string> s(H);
for (int i = 0; i < H; i++)
{
cin >> s[i];
}
deque<pii> deq;
vector<vector<int>> cost(H, vector<int>(W, IN... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
Int n;
cin>>n;
vector<Int> d(n);
for(Int i=0;i<n;i++) cin>>d[i];
map<Int, Int> r;
for(Int i=0;i<n;i++) r[d[i]]=i;
vector<vector<Int> > G(n);
auto NO=[](){cout<<-1<<endl;exit(0);};
auto add_edge=[&](Int x,Int y){
G[x... | 0 | 81,866,321 |
#include <iostream>
#include <array>
int main ()
{
std::array<int, 250> heap;
int n;
std::cin >> n;
for (int i=0; i<n; ++i)
{
std::cin >> heap[i];
}
for (int i=0; i<n; ++i)
{
std::cout << "node " << i+1;
std::cout << ": key = " << heap[i] << ", ";
auto parent = (i+1)/2;
... | #include <bits/stdc++.h>
#define endl '\n'
#define db double
#define ld long double
#define ll long long
#define ull unsigned long long
#define sqr(x) (x) * (x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a/gcd(a,b)) * b)
#define pf(x) push_front(x)
#define pb(... | 0 | 22,277,364 |
#include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <complex>
#include <map>
#include <climits>
#include <sstream>
using namespace std;
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
#define MAX_K 100000
int k;
ll a[MAX_K];
bool isOK(ll n, bool ... | 0 | 28,249,983 |
#include "bits/stdc++.h"
#define all(x) x.begin(), x.end()
#define rep(i,n) for (i64 i = 0; i < (n); ++i)
#define reps(i,s,t) for (i64 i = (s); i <= (t); ++i)
#define repr(i,s,t) for (i64 i = (s); i >= (t); --i)
#define LF '\n'
#ifdef DBG
#define trace(...) _trace(#__VA_ARGS__, __VA_ARGS__);
#else
#def... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
if (a < b)
{
swap(a, b);
}
while (b > 0)
{
int r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
int mx = 0;
for (int i = 0; ... | 0 | 82,970,747 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int c=a+b;
if(c%2==0){
cout << c/2;
}
if(c%2==1){
cout << c/2+1;
}
} | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <functional>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <cmath>
#include <cstdio>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
... | 0 | 100,459,764 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define MAX 100000
void inarray(int a[], int n){
for(int i = 0; i < n; i++) cin >> a[i];
}
int main(){
int n,m; cin >> n >> m;
int sum = 0;
for(int i = 0; i < m; i++){
int a; cin >> a;
sum += a;
... | #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)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 93,888,635 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define tab " "
#define lli long long int
void read(){
int d;
vector<int> D;
for(int i = 0; i < 3; ++i){
cin >> d;
D.push_back(d);
}
sort(D.begin(), D.end());
cout << D[0]+D[1] << endl;
}
int main(void){
read();
... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
using namespace std;
#define int long long
#define f(i,a,b) for(i=a;... | 0 | 4,050,121 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) f... | #include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll n,m,p[100005],cnt[100005],x,ac=0,pen=0;
string s;
cin>>n>>m;
rep(i,n+1){
p[i]=0;
cnt[i]=0;
}
rep(i,m){
... | 0 | 17,649,319 |
#include<iostream>
#include<string>
#include<ctype.h>
using namespace std;
int main(){
string a;
char check;
getline(cin,a);
for(int i=0;i<a.size();i++){
if(isalpha(a[i])!=0){
check=a[i];
a[i]=tolower(a[i]);
if(check==a[i])
a[i]=toupper(a[i]);
}
cout<<a[i];
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | 0 | 81,899,659 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N,A,B;
cin>>N>>A>>B;
ll a=N/(A+B);
ll b=N%(A+B);
if(b<A) {
cout<<A*a+b<<endl;
}
else {
cout<<a*A+A<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | 0 | 59,840,000 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b,ll m){
ll res=1;
while(b){
if(b%2) res=res*a%m;
a=a*a%m;
b/=2;
}
return res;
}
ll inv(ll a,ll m){
return mpow(a,m-2,m);
}
l... | #include <bits/stdc++.h>
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define prique(T) std::priority_que... | 0 | 75,283,533 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll Pow(ll a, ll n) {
if (n == 1) return a;
if (n % 2 == 1) return (a * Pow(a, n-1));
ll t = Pow(a, n/2);
return (t*t);
}
int main() {
int N, P;
cin >> N >> P;
bool odd = false;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
vector<int> arr(n);
for(int i=0;i<n;i++)
cin>>arr[i];
vector< int> dp(n,INT_MAX);
dp[0]=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<=i+k;j++)
{
if(j<n)
{
... | 0 | 21,464,355 |
#include<bits/stdc++.h>
#define eb emplace_back
#define pb push_back
#define size(s) (int)s.size()
#define int long long
#define vi vector<int>
#define vs vector<string>
#define vv vector<vector<int>>
#define pii pair<int,int>
#define m_p(x,y) make_pair(x,y)
#define vp vector<pair<int,int>>
#define setbits(x) __builtin... | #include <iostream>
#include <vector>
using namespace std;
vector<int> a(200005);
vector<int> b(200005);
vector<int> e[200005];
void dfs(int x){
b[x] = 1;
for(int &v : e[x]) {
if(v == x)
continue;
if(b[v]==0){
a[v] += a[x];
dfs(v);
}
}
return;... | 0 | 74,731,366 |
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <tuple>
#include <cstring>
using std::cin;
using std::cout;
using std::endl;
using std::get;
using std::make_tuple;
using std::max;
using std::queue;
using std::string;
using std::tuple;
using std::memcpy;
using i3 = tuple<int, int, in... | #include<bits/stdc++.h>
typedef long long ll;
#define ff first
#define ss second
using namespace std;
void fast()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
ll gcd(ll a,ll b)
{
if(b==0)
return a;
else
gcd(b,a%b);
}
ll lcd(ll a,ll b)
{
return (a*b)/gcd(a,b);
}
int main()
{
in... | 0 | 96,534,347 |
#include<bits/stdc++.h>
#define pi 2*acos(0.0)
#define ll long long
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx,ny) nx>=0 && nx<n && ny>=0 && ny<m
#define ee endl
#d... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
ll solve(string S) {
int N = S.size();
reverse(S.begin(), S.end());
ll cnt = 0;
while (true) {
ll prev = cnt;
rep(i,N-1) {
if (S[i] == 'W' && S[i+1] == 'B... | 0 | 76,580,468 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int h, w = 0;
int ct = 0;
vector<string> map;
void count(int y,int x){
map[y][x] = 'X';
if (y != 0){
if (map[y-1][x] == '.'){
count(y-1,x);
}
}
if (y != h-1){
if (map[y+1][x] == '.'){
count(y+1,x);
}
}
if (x != 0){
if (... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
int mod;
const int A = 1e5 + 2;
int add(int x, int y) {
return ((x + y) % mod + mod) % mod;
}
int mul(int x, int y) {
return (1LL * x * y) % mod;
}
int fp(int x, int y) {
if (!y) return 1;
... | 0 | 14,034,898 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
auto ans = (int) 1e9;
for (int i = 0; i < n - 1; ++i) {
ans = m... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | 0 | 47,647,765 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
using pii = pair<int, int>;
int main() {
int k;
string s;
cin >> k >> s;
if (s.size() <= k) {
cout << s << endl;
return 0;
} else {
for (int i = 0; i < k; i++) {
cout << s[i];
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
namespace Solver {
int N, M;
vector<pair<int, int>> DP;
inline bool Read() {
cin >> N >> M;
if (N == 0) return false;
DP.resize(N, make_pair<int, int>(0, 0));
for (int i = 0; i < N; i++) cin >> DP... | 0 | 68,361,752 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string t;
ll rp, sp, pp;
ll cal_score(char hand) {
if (hand == 'r') return pp;
if (hand == 's') return rp;
if (hand == 'p') return sp;
return 0;
};
int main() {
int n, k;
cin >> n >> k >> rp >> sp >> pp >> t;
ll score = 0;
for (int i ... | 0 | 85,870,009 |
#include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
if(a==1 || b==1){
if(a==1 && b==1)cout<<"Draw";
else if(a<b)cout<<"Alice";
else if(a>b)cout<<"Bob";
}
else {
if(a>b)cout<<"Alice";
else if(a==b)cout<<"Draw";
else if(a<b)co... | 0 | 75,713,921 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int N, M;
cin >> N >> M;
vec<vec<int>> G(N);
rep(i, M){
int a,b;
cin >> ... | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <cstring>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using PP = pair<ll, pair<ll,ll>>;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
ll n, y;
int main() {
... | 0 | 65,009,332 |
#include <iostream>
#define mod 1000000007
using namespace std;
int main(){
int h,w;
cin>>h>>w;
char grid[h+1][w+1];
int dp[h+1][w+1];
for (size_t i = 0 ; i <= h; i++) {
grid[i][0] = '.';
dp[i][0] = 0;
}
for (size_t i = 0 ; i <= w; i++) {
grid[0][i] = '.';
dp[... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 17,664,320 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <iostream>
using namespace std;
long long n,s,i,x,b[1000000];
int main()
{
cin >> n;
for (i=1; i<n; i++)
cin >> b[i];
s=b[1];
for (i=2; i<n; i++)
s+=min(b[i-1],b[i]);
s+=b[n-1];
cout<<s;
return 0;
} | 0 | 33,706,445 |
#include<bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (int)(n); i++)
#define put(i) cout<<fixed<<i<<endl
using namespace std;
using ll = long long;
int main(){
ll n, m; cin >> n >> m;
vector<ll> oks(n+1,true);
for(long long i = 0; i < m; i++){
ll a; cin >> a;
oks[a] = false;
... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 31,397,300 |
#ifdef LOCAL
#endif
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<P> VP;
typedef vector<vecto... | #include <iostream>
#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_map>
#include <unordered_set>
#include <bitset>
#inclu... | 0 | 2,018,556 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
vector<int> num(3);
for(int i=0; i<3; ++i) cin >> num[i];
sort(num.rbegin(), num.rend()... | #include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const... | 0 | 66,309,167 |
#include<iostream>
#include<string.h>
using namespace std;
int main(){
int n;
cin>>n;
double a=100;
for(int i=0;i<n;i++){
a*=1.05;
if((a-(int)a)>0)a+=(1-(a-(int)a));
}
cout<<(int)a<<0<<0<<0<<endl;
} | #include<iostream>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, m; cin >> n >> m;
int averge = m * 2 - n;
cout << averge << endl;
return 0;
} | 0 | 74,416,493 |
#include <iostream>
#include<time.h>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
ll gcd(ll a, ll b) {return b?gcd(b, a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a, b)*b;}... | 0 | 87,892,088 |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<stack>
#include<queue>
#include<sstream>
#include<string>
#include<cassert>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i... | #include<iostream>
using namespace std;
int main()
{
int a[10];
for (int i = 0; i < 10; i++)
{
cin >> a[i];
for (int j = 0; j < 10; j++)
{
if (a[0] < a[i])swap(a[i], a[0]);
}
for (int j = 0; j < 10; j++)
{
if (a[1] < a[i])swap(a[i], a[1]);
}
for (int j = 0; j < 10; j++)
{
if (a[2] < a[i])s... | 0 | 11,383,092 |
#include <iostream>
using namespace std;
int main() {
int num[26] = {0};
char input, res;
while (cin>>input)
{
if (input >= 65 && input <= 90)
num[input - 65]++;
else if (input >= 97 && input <= 122)
num[input - 97]++;
}
for (int i = 0; i < 26; i++)
{
res = 'a' + i;
cout << res << " : " << num[i] <... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | 0 | 72,061,523 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<pair<int,int> >A;
for(int i=0;i<N;i++){
int a;
cin >> a;
A.push_back(make_pair(a,i+1));
}
sort(A.begin(),A.end());
for(... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
struct Unionfind{
vector<int> parent;
void init(int forestSize){
parent.resize(forestSize);
for(int i=0;i<forestSize;i++){parent.at(i)=i;}
}
int root(int v){
if(parent.at(v)==v){return v;}
else{return par... | 0 | 94,448,033 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #pragma GCC optimize("Ofast",3,"inline")
#include<bits/stdc++.h>
using namespace std;
#define fir first
#define sec second
#define m_p make_pair
#define y1 ygftgfgcdtfgxffgx
#define y2 yfdsesgvtyghftfvv
#define x1 xvyr6cf6fgcfgf676
#define x2 xcr6rfc5r66y6r6fr
#define up_bound upper_bound
#define low_bound lower_bound
... | 0 | 16,540,721 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define fast_io(); std::ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
long long gcd(long long a, long long b){
long long r;
if(a<b) std::swap(a,b);
if(b<1) return b;
while((r=a%b)!=0){
a =... | #include <iostream>
#include <queue>
using namespace std;
const int INF = -1;
const int MaxH = 1000;
const int MaxW = 1000;
const int MaxN = 10;
int h,w;
char ma[MaxH][MaxW];
int dx[4] = {1,0,-1,0};
int dy[4] = {0, 1, 0, -1};
int N;
int res;
int cx[10], cy[10];
int t[MaxH][MaxW];
typedef pair<int,int> P;
int dfs(int st... | 0 | 16,022,888 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
vector<int> d(n);
rep(i, n) cin >> d[i];
sort(d.begin(), d.end());
int a = d[n / 2 - 1];
int b = d[n / 2];
int ans = b - a;
cout << ans << endl;
retu... | #include<iostream>
using namespace std;
int main(){
int W, H, N;
cin >> W >> H >> N;
int left = 0;
int right = W;
int bottom = 0;
int top = H;
for(int i=0; i<N; i++){
int x, y, a;
cin >> x >> y >> a;
switch(a){
case 1:
left = max(left, x);
break;
case 2:
right = m... | 0 | 13,791,979 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std:... | 0 | 9,184,909 |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | #include<bits/stdc++.h>
#include<stdio.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define ll long long
#define scl(n) scanf("%lld",&n)
#define scll(n, m) scanf("%lld%lld",&n, &m)
#define scc(c) scanf("%c",&c)
#define fr... | 0 | 23,369,086 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
if(a == b){puts("Yes"); return 0;}
int len = (int)a.length();
for(int i = 0; i < len;++i){
char last = a[len - 1];
string temp = a.substr(0,len - 1);
a = last + temp;
if(a == b){
puts("Yes");
retu... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string A, B;
cin >> A >> B;
enum class Comparison : int32_t { kEquals = 0, kGreater, kLess };
Comparison result;
if (A.length() > B.length()) {
r... | 0 | 39,338,651 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s; cin >> s;
int k; cin >> k;
for (int i = 0; i < k; i++)
{
char c = s[i];
if (c != '1')
{
cout << c << endl;
return 0;
}
}
cout << 1 << endl;
} | #include <cstdio>
#include <math.h>
#include <utility>
using namespace std;
int main ()
{
int H, W;
int count = 0;
pair<int, int> data[5000];
while (1) {
scanf("%d", &H);
scanf("%d", &W);
if (H == 0 && W == 0) {
break;
}
data[count].first = H;
data[count].second = W;
count++;
... | 0 | 18,894,649 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int count = 3;
if (a == b && b == c && a == c) count=1;
else if (a != b && b != c && a != c) count=3;
else count=2;
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> cnt(n, 0);
int a, b;
for (int i = 0; i < m; i++){
cin >> a >> b;
a--; b--;
cnt[a]++; cnt[b]++;
}
int odd = 0;
for (int i = 0; i < n; i++) if (cnt[i] % 2) odd++;
if (... | 0 | 78,601,313 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <cstdlib>
#include <cctype>
#include <ctime>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <utility>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
int n,k,r,s,p;
string t;
cin >> n >> k >> r >> s >> p >> t;
vector<char> hand(n,'n');
int ans=0;
for(int i=0;i<n;i++){
int point;
char now_hand;
if(t[i]=='r'){
... | 0 | 57,206,281 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
const int INF = 1 << 29;
using Edge = pair <int, ll>;
using Graph = vector<vector<Edge>>;
set<pair<int, int>> use;
vector<ll> dijkstra(const Graph &G, int s){
vector<ll> dis... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 51,091,183 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <fstream>
#inclu... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int cnth[300010], cntw[300010];
int a[300010], b[300010];
pii p[300010];
bool cmp(int &x, int &y) {
return cnth[x]>cnth[y];
}
bool cmp2(int &x, int &y) {
return... | 0 | 49,156,110 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main() {
int N; cin >> N;
vector<ll> a(N); vector<ll> b(N);
vector<ll> gap(N);
ll tarinai=0;
ll ans=0;
for(int i=0;i<N;i++) cin >> a... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a,... | 0 | 46,714,075 |
#include <iostream>
#include <vector>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
#define free freopen ("input.txt", "r", stdin);freopen ("output.txt", "w", stdout);
#define Fast ios::sync_with_stdio... | #include<iostream>
#include<algorithm>
using namespace std;
int n,cnt[111],m=111,M;
main()
{
cin>>n;
for(int i=0;i<n;i++)
{
int a;cin>>a;
cnt[a]++;
if(m>a)m=a;
if(M<a)M=a;
}
bool flag=M%2&&cnt[m]==2||M%2==0&&cnt[m]==1;
for(int i=m+1;i<=M;i++)
{
flag&=cnt[i]>=2;
}
flag&=m*2>=M;
cout<<(flag?"P":"Imp")... | 0 | 36,291,286 |
#include<stdio.h>
main(){
int x;
int y=0;
int a[10000];
for(int i=0; i<10000;i++){
scanf("%d",&x);
if(x==0) break;
a[i]=x;
y+=1;
}
for(int i=0;i<y;i++){
printf("Case %d: %d\n",i+1,a[i]);
}
return 0;
} | #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 db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | 0 | 24,375,750 |
#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=1e9+7;
int32_t main()
{
IOS;
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int ans=0;
for(int i=1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 49,256,485 |
#include <bits/stdc++.h>
const long long MOD = 1e9+7;
using namespace std;
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int A,B;
cin >> A >> B;
if (A==1 && B==2) {
cout << 3 << endl;
} else if (A==2 && B==3) {
cout << 1 << endl;
} else if (A==3 && B==1) {
cout << 2 << endl;
} else if (A==2 && B==1)... | #include <iostream>
#include <string>
using namespace std;
struct Dice{
int s[6];
void roll(char ope){
int b;
if(ope == 'E'){
swap(s[0],s[2]);
swap(s[0],s[5]);
swap(s[0],s[3]);
}
if(ope == 'W'){
swap(s[0],s[3]);
swap(s[0... | 0 | 15,575,551 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<ll> T(N);
for(int i=0; i<N; i++) cin >> T[i];
ll ans = 1;
for(int i=0; i<N; i++) ans = lcm(ans, T[i]);
cout << ans << endl;
return 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int (i)=0;(i)<(n);(i)++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
bool custom1 (pair<int, int> a, pair<int, int> b) {
return (a.first < b.first);
}
bool custom2(pair<int, int>... | 0 | 32,638,444 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.