code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
using namespace std;long long n,m;int main(){cin>>n>>m;cout<<min(n+m/2,m)/2;} | #include <cstdio>
#include <cstring>
const int MAX = 100;
int adj[MAX + 1][MAX + 1];
int main()
{
std::memset(adj, 0, sizeof(adj));
int n;
scanf("%d", &n);
int u, k, v;
for (int i = 0; i < n; ++i)
{
scanf("%d%d", &u, &k);
for (int j = 0; j < k; ++j)
{
scanf("%d", &v);
adj[u][v] = 1;
... | 0 | 32,862,030 |
#include <iostream>
#include <cstdio>
using namespace std;
const int inf = 1001001001;
int n, a, dp[100000];
int main() {
scanf("%d",&n);
fill(dp, dp+n, inf);
for (int i = 0; i < n; i++) {
scanf("%d",&a);
*lower_bound(dp, dp+n, a) = a;
}
printf("%d\n", (int)(lower_bound(dp, dp+n, inf)-dp));
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<tuple<int, int, int>> v(M);
for(int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
v[i] =... | 0 | 30,223,984 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
#define INF 1000000007
int main(){
ll n,a,b;
cin>>n>>a>>b;
if(a>b){
cout<<0<<endl;
}else if(a==b){
cout<<1<<endl;
}else if(a!=b&&n==1){
cout<<0<<endl;
}
else{
ll MAX=b+a*(n-1),MIN=a+b*(n-1);
... | #include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
typedef long long ll;
typedef vector<ll> vl;
#define rp(i, f, t) for (int i = f; i < t; i++)
#define pr(i, f, t) for (int i = t - 1; i >= f; i--)
#define ca(n, a) rp(ca_i, 0, n) cout << a[ca_i] << ((ca_i == n - 1) ? "\n" : " ");
int main()
{
... | 0 | 20,247,346 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
vector<vector<int>> f(h, vector<int>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
... | #include <iostream>
using namespace std;
int main(){
int n;
int charge;
int cnt = 0;
int coin[] = {500, 100, 50, 10, 5, 1};
while(cin >> n, n != 0){
charge = 1000 - n;
for(int i=0; i<6; i++){
int j = 0;
while(charge - coin[i] * j >= coin[i]){
j... | 0 | 48,665,192 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 97,085,605 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1e9;
const int MOD = 1e9+7;
int main() {
ios::syn... | #include <stdio.h>
bool b[11][100001], c[100001];
int p[100001];
int find(int x)
{
if (p[x] != x) p[x] = find(p[x]);
return p[x];
}
int main()
{
int K;
scanf("%d", &K);
for (int i=0;i<K;i++) p[i] = i;
for (int i=0;i<K;i++) p[find(i)] = find((i*10)%K);
b[0][0] = 1;
for (int i=0;;i++){
for (int j=0;j<K;j++) c[j... | 0 | 4,606,810 |
#include <iostream>
using namespace std;
int main(){
int k, a, b;
cin >> k;
cin >> a >> b;
if(a <= b/k*k) cout << "OK" << endl;
else cout << "NG" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <cassert>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
for (auto &ai: a) cin >> ai;
auto check = [&](long long mid) {
vector<pair<int, int>> v;
v.emplace_back(0, 0);
for (int i = 1;... | 0 | 77,730,568 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include<algorithm>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<set>
#include<map>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -2147483648
#defi... | 0 | 68,465,100 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
#define _GLIBCXX_DEBUG
int mod = 1e9+7;
int main() {
ll s; cin >> s;
ll dp[2010];
dp[0] = 1;
for(int i = 0; i <= s; i++){
if(i >= 3) dp[i] = dp[i-1] + dp[i-3];
dp[i] %= mod;
}
cout << dp... | #if 1
#include <bits/stdc++.h>
#else
#include "../../bits/stdc++.h"
#endif
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (b)-1;i >= (a);i--)
#define REP(i,n) FOR(i,0,(n))
#define RREP(i,n) RFOR(i,0,(n))
using namespace std;
typedef pair<int, int> P;
#define pb push_back
#define mp ... | 0 | 18,031,929 |
#include<iostream>
#define SIZE 100
using namespace std;
int main(void) {
int n, c, v;
int G[SIZE][SIZE];
int A[SIZE][SIZE];
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
A[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> v;
cin >> c;
for (int j = 0; j < c; j++) {
cin >... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
#include <unordered_map>
using namespace std;
int main(){
int H, W, N;
cin >> H >> W >> N;
vector<pair<int, int>> AB(N);
int a, b;
for(int i = 0; i <... | 0 | 40,624,365 |
#include <iostream>
using namespace std;
int main(){
int l[4][3][10];
for(int p = 0; p < 4; p++){
for(int q = 0; q < 3; q++){
for(int r = 0; r < 10; r++){
l[p][q][r] = 0;
}
}
}
int n;
cin >> n;
for(int i = 0; i < n; i++){
int p, q, ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long long unsigned llu;
typedef pair<long long, long long> pll;
const long long inf = 2000000000000000000LL;
#define pi acos(-1.0)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);c... | 0 | 38,103,216 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N, M;
cin >> N >> M;
vector<tuple<int, int, int>> v(M);
for(int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
v[i] =... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 65,685,670 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int H[N];
int A[M],B[M];
for(int i=0;i<N;i++) cin >> H[i];
for(int i=0;i<M;i++){
cin >> A[i] >> B[i];
}
vector<int> R[N+1];
for(int i=0;i<M;i++){
R[A[i]-1].push_back(B[i]);
R[B[i]-1].push_back(A[i]);
}
int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
const int N = 1e5 + 5;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int mx = *max_elemen... | 0 | 7,610,766 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,na,nb;
while(cin>>m>>na>>nb){
if(m==0){
break;
}
int p[m];
for(int i=0;i<m;i++){
cin>>p[i];
}
sort(p,p+m);
reverse(p,p+m);
int k=p[na-1];
int c=k-p[na];
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define vecst vector<string>
#de... | 0 | 77,164,147 |
#include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define j... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
set<string> s;
string w;
char c;
cin >> w;
s.insert(w);
c = w.at(w.size() - 1);
for (int i = 1; i < n; i++) {
string x;
cin >> x;
if (s.find(x) == s.end() && x.at(0) == c) {
... | 0 | 51,112,713 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e18+10;
const ll N=1e2+10;
ll d[N][N];
ll V,E;
void init()
{
for(ll i=0;i<V;i++)
{
for(ll j=0;j<V;j++)
{
d[i][j]=INF;
if(i==j) d[i][j]=0;
}
}
}
bool Floyd()
{
for(ll k=0;k<V;k... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include... | 0 | 31,472,919 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
int x3 = x2 - (y2 - y1);
int y3 = y2 + (x2 - x1);
int x4 = x3 - (y3 - y2);
int y4 = y3 + (x3 - x2) ;
std::cout << x3 << " " << y3 << " " <<... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 0 | 90,449,307 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #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()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s,t;
... | 0 | 49,331,699 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int N;
string s;
vector<int> ans;
bool solve(){
FOR(i, 1, N-1){
if(ans[i] == 0){
i... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define DEBUG
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA_ARGS__);cout<<endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <... | 0 | 77,202,054 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int a,b;
cin>>a>>b;
if(a<= 8 && b<= 8){
cout<<"Yay!";
return 0;
}
cout<<":(";
} | #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#include <bitset>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair... | 0 | 56,870,404 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod=1e9+7;
int main(){
int n;
ll a[200000];
cin>>n;
for (int i(0);i<n;i++) cin>>a[i];
ll sum(0);
for (int i(0);i<n;i++) sum+=a[i];
ll mini(1e18);
ll sumi(0);
for (int i(0);i<n-1;i++){
sumi+=a[i];
cerr<<abs(sumi-(sum-sumi))<... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | 0 | 41,182,431 |
#include <iostream>
#include <vector>
using namespace std;
int calcCoins(int price) {
const int coinNums[] = {500, 100, 50, 10, 5, 1};
int result = 0;
int remain = price;
for (int i = 0; i < 6; i++) {
int coinMaisu = remain / coinNums[i];
result += coinMaisu;
remain -= coinMaisu * coinNums[i];
}
return resu... | #include <iostream>
#include <stdio.h>
#define INF 10000
using namespace std;
struct edge {
int from, to, cost;
};
edge es[100];
int d[11];
int n,maxV=0;
int shortest_path(int s){
int sum=0;
for(int i=0;i<maxV+1;i++){
d[i] = INF;
}
d[s] = 0;
while(1){
bool update = false;
... | 0 | 50,056,566 |
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
using Graph = vector<vector<long long> >;
Graph G;
long long n, q;
vector<long long> cnt(200001, 0);
vector<long long> ans(200001 ,0);
void dfs(long long v, long long p){
if(p != -1) ans[v] += ans[p];
ans[v] += cnt[v];
for(auto nex... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define ii pair < int , int >
const int N=1;
map<int , int> mp;
int main()
{
int n;
scanf("%d",&n);
bool q=0;
for(int i=0;i<n;i++){
int x;
scanf("%d",&x);
mp[x]++;
if(mp[x]... | 0 | 3,142,617 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for( ll (i)=0; (i)<(n); ++(i) )
#define rpi(i,n) for( int (i)=0; (i)<(n); ++(i) )
#define rpv(d) for(auto& v:d)
#if __cplusplus < 201703L
std::ostream& co_(){ return std::cout << std::endl; }
std::istream& cn_(){ return std::cin; }... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<typename T> using v2 = vector<vector<T>>;
template<typename T> inline v2<T> init(int r, int c, const T& t){ return v2<T>(r, vector<T>(c, t)); }
#define F first
#define S second
int n, m;
vector<int> a;
ll lcm(int a, int b){
return (ll)a*b... | 0 | 21,551,348 |
#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 W, H, x, y;
cin >> W >> H >> x >> y;
double ans = (double) W * H / 2.0;
int center;
if (W % 2 == 0 && H % 2 == 0 && W / 2 == x && H / 2 == y) center = 1;... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | 0 | 47,396,148 |
#include <bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef complex<double> com;
#define endl '\n'
#define eb emplace_back
#def... | #include <bits/stdc++.h>
#define NIL -1
int N;
int main()
{
char com[][5] = {
{},
{'.', ',', '!', '?', ' '},
{'a', 'b', 'c'},
{'d', 'e', 'f'},
{'g', 'h', 'i'},
{'j', 'k', 'l'},
{'m', 'n', 'o'},
{'p', 'q', 'r', 's'},
{'t', 'u', 'v'},
{'w... | 0 | 12,780,199 |
#include <cstdio>
int main()
{
char ch = ' ';
int cnt = 0;
while (ch != '\n') {
ch = getchar();
if (ch == 'x') {
cnt++;
}
}
if (8 <= cnt) {
puts("NO");
} else {
puts("YES");
}
return 0;
} | #include <iostream>
using namespace std;
#define MAX 2000000
#define INFINITY (1<<30)
int gHeap[MAX + 1],gSize;
void maxHeapify(int i){
int left,right,largest;
left = 2 * i;
right = 2 * i + 1;
if(left <= gSize && gHeap[left] > gHeap[i]){
largest = left;
}
else{
largest = i;
}... | 0 | 8,034,232 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll cnt1=0,cnt2=0;
ll n,k;cin >>n>>k;
for (int i = 1; i <= n; ++i) {
if(k... | 0 | 18,213,343 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
void b_uneven_number(void) {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
string n_str = to_string(i);
if ((n_str.size() & 0x1) == 0x0) continue;
cnt++;
}
cout << cnt << endl;
}
int main()
{
... | #include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(void)
{
char c;
while(1){
cin.get(c);
if(c=='.') break;
stack<char> s;
if(c=='(' || c=='[') s.push(c);
else if(c==')' || c==']') s.push(c);
while(1){
cin.get(c);
if(c=='.') {
cin.get(c);
if(c=='\n') break;
... | 0 | 6,008,512 |
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
#include<complex>
using namespace std;
void grading(int m, int f, int r){
if(m == -1 || f == -1) {cout << "F" <<endl;return;}
if(m+f >= 80... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
const int INF = 2147483647;
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll n;
cin >> n;
map<ll,ll> m;
rep(i,n){
ll a;
cin >> a;
m[a]++;
... | 0 | 78,158,357 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
vector<int> L;
int N, A, B, C;
const int INF = 1 << 30;
int rec(int index, int a, int b, int c)
{
if (N == index)
{
if (!a || !b || !c)
{
... | 0 | 21,573,426 |
#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 argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin>>s;
if(s[5]=='1'||s[6]>'4')cout<<"TBD"<<endl;
else cout<<"Heisei"<<e... | #define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<iostream>
using namespace std;
typedef long l... | 0 | 34,274,947 |
#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(x) x.begin(),x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const ll INF = 1e18;
const int mod = 1e9+7;
const int MAX = 1e6;
stru... | 0 | 48,510,059 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m; scanf("%d %d", &n, &m);
priority_queue<ll> que;
for(int i = 0; i < n; i++){
ll x; scanf("%lld", &x);
que.push(x);
}
for(int i = 0; i < m; i++){
int x = que.top(); que.pop();
que.push(x/2);
}
l... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<int, int>;
using V = vector<int>;
using VV = vector<vector<int>>;
int Inf = (1<<30);
ll inf = (1LL<<60);
const int MOD = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
V a(n);
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
ll cou... | 0 | 2,738,537 |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MA... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 81,865,712 |
#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;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i... | 0 | 64,693,786 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> lines(h);
string s;
int cnt = 0;
for (int hi = 0; hi < h; hi++) {
cin >> s;
if (s.find("#") != string::npos) {
lines.at(cnt) = s;
cnt++;
}
}
... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | 0 | 98,744,215 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int counter=0;
string a;
cin>>a;
for(int i=0;i<3;i++){
if(a.at(i)=='a'){
counter++;
break;}}
for(int i=0;i<3;i++){
if(a.at(i)=='b'){
counter++;
break;}}
for(int i=0;i<3;i++){
if(a.at(i)=='c'){
counter++;
break;}}
if(counter==3)
cout<<"Yes"<<endl;
else
cout<<"No"... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
int n;
vector<pair<double,double> > p;
bool comp(pair<double,double> &a,pair<double,double> &b){
return atan2(a.second,a.fir... | 0 | 8,746,898 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int D;
cin >> D;
int A = 25-D;
cout << "Christmas";
for (int i = 0; i < A; i++)
cout << " " << "Eve";
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 5,653,699 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define mod 1000000007
#define MOD 998244353
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
int dy8[8] = {1... | #include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int b, f, r, v;
int room[4][3][10] = {{{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0}},
{{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0,0}},
{{0,0,0,0,0,0,0,0,... | 0 | 16,937,348 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define N 100005
#define MOD 1000000007
#define dd double
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep1(i,b) for(int i=1;i<=b;i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template <class T> inline bool chmin(T &a, T b) {if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a,... | 0 | 63,443,841 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int N;
cin >> N;
vector<int> a(N+1);
rep(i,N+1) {
cin >> a[i];
}
vector<long int> d_max(N+1), d_min(N+1), max(N+1);
bool tf = true;
reverse(a.begin(), a.end());
rep(i,N+1... | #include <bits/stdc++.h>
using namespace std;
long long n, x, y, arr[100005];
int main () {
cin>>n;
for(int i=1; i<=n; i++){
cin>>arr[i];
}
sort(arr+1, arr+n+1);
for(int i=n; i>0; i--){
if(arr[i]==arr[i-1]){
if(x==0){
x=arr[i];
i--;
}
... | 0 | 58,724,195 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
int N, K;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> N >> K;
int ans = 1000000;
rep(i, N+1) {
int ans_cand = 1;
rep(j, i) ans_cand *= 2;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e17;
ll mod = 1e9 + 7;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
... | 0 | 98,998,081 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PB push_back
#define INF (1LL<<61LL)
typedef pair<int, int> pii;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
while (cin >> n >> k, n) {
int a[100005];
for (int i = 0; i < n; ++i)
cin >> a[i];
int... | #include<bits/stdc++.h>
typedef long long int ll;
using namespace std;
int main()
{
ll a,b,c,k;
cin>>a>>b>>c>>k;
for(int i=0;i<k;i++)
{
if(a>=b)
{
b*=2;
}
else if(b>=c)
{
c*=2;
}
}
if(a<b && b<c)cout<<"Yes\n";
else cout<... | 0 | 49,011,060 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n, i;
float a, b, c;
cin >> n;
for (i = 0; i<n; i++){
cin >> a >> b >> c;
if (hypot(a, b) == c || hypot(b, c) == a || hypot(a, c) == b) cout << "YES" << endl;
else cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
#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 ans=1;
int m=n;
while(1){
if(m%360==0){
cout<<ans<<endl;
return 0;
}
ans++;
m+=n;
m%=360;... | 0 | 89,883,471 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 1002
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef pa... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define M (ll)1000000007
#define MM (ll)1e8
#define INF (ll)1e18
#define arep(i, x, n) for (long long i = x; i < n; i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
int main() {
ll h;
... | 0 | 56,013,543 |
#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()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s;
... | #include<bits/stdc++.h>
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ff(i,a,b) for(register int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<st... | 0 | 21,926,742 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n,tc=0,hc=0;
string taro,hanako;
cin >> n ;
for (int i=0;i<n;i++){
cin >> taro >> hanako ;
if(taro>hanako)tc+=3;
else if(taro<hanako)hc+=3;
else {
tc++;
hc++;
}
}
cout << tc << " " << hc << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int solve(vector<int> &inters){
const size_t N= inters.size();
if(N==1){ return 0; }
else{
int ret= 0;
for(size_t i=0; i< N-1-i; i++){
ret+= abs(inters.at(i)- inters.at(N-1-i));
}
return ret;
}
}
int main(){
string S;
cin >> S;
string T;
... | 0 | 27,201,384 |
#include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for(int i = 0; i < n; i++)
#define Rep(i, n) for(int i = 1; i < n; i++)
const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;
using i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 12,656,012 |
#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>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define int long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
int N,M,ans=0,k=0;... | 0 | 42,099,573 |
#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){
if(a % b == 0) return b;
else return gcd(b, a%b);
}
ll lcm(... | #include <iostream>
#include <cstring>
using namespace std;
int main() {
string teks;
getline(cin,teks);
int n=teks.size();
for (int i=n-1; i>=0; i--) {
cout << teks[i];
}
cout << endl;
return 0;
} | 0 | 20,381,927 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n,q;
cin >> n >> q;
vector<vector<int>> to(n);
rep(i,n-1){
int x,y;
cin >> x >> y;
x--;y--;
to[x].push_back(y);
to[y].push_back(x);
}
queue<... | #include<cctype>
#include<string>
#include<algorithm>
#include<iostream>
#include<set>
#include<regex>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<ioman... | 0 | 57,601,015 |
#include<iostream>
using namespace std;
const int coins[] = {500, 100, 50, 10, 5, 1};
int main(){
int m;
while(cin >> m){
if(m==0)break;
m = 1000 - m;
int res = 0;
for(int i=0;i<6;i++){
while(m >= coins[i]){
res++;
m -= coins[i];
}
}
cout << res << endl;
}
} | #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 | 20,458,570 |
#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++)
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n,a,cnt=0;
map<int, int>mp;
cin >> n;
rep(i, n) {
ci... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_e... | 0 | 79,461,560 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
vector<bool>p(m,false);
vector<int>x(n,0);
int r;
string s;
int ac=0,pen=0;
for(int i=0;i<m;i++)
{
cin>>r>>s;
if(p[r-1]==false && s=="AC")
{
p[r-1]=true;
ac++... | 0 | 23,144,202 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main()
{
int N,K;
cin >> N >> K;
string S;
cin >> S;
vector<int> A;
int now = 1;
int cnt = 0;
rep(i,S.size())
{
if (S[i] != '0' + now)
{
A.push_back(cnt);
cnt =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, h;
cin >> n >> h;
int max_a = 0;
vector<pair<int, int>> vec(n);
for (auto &v : vec) {
int a, b;
cin >> a >> b;
v = make_pair(a, b);
max_a = max(max_a, a);
}
sort(vec.begin(), vec.end(),
... | 0 | 32,158,827 |
#include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;
int main() {
Int n;
cin >> n;
vector<pair<string, Int>> v(n);
for (Int i = 0; i <... | #include <cstdio>
#include <cstdlib>
typedef struct tree_{
int parent;
int depth;
int noc;
int *child;
}tree;
void setDepth(tree *node, int id, int depth){
node[id].depth = depth;
for(int i=0;i<node[id].noc;i++)setDepth(node,node[id].child[i],depth+1);
return;
}
int main(){
int i, j, n, ... | 0 | 86,129,993 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int i;
string s;
getline(cin,s);
for(i=0;i<s.size();i++){
if('a'<=s[i]&&s[i]<='z') s[i]-=32;
else if('A'<=s[i]&&s[i]<='Z') s[i]+=32;
cout<<s[i];
}
cout<<endl;
return 0;
} | #include<iostream>
#include<string>
#include<numeric>
#include<set>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define ceil(a,b) (((a)+(b)-1)/(b))
#define dist(a,b) max((a)-(b),(b)-(a))
#define yn(i) print((i)?"Yes":"No")
#define rep(i,n) for(int i=0;i<(n);i++)
#define... | 0 | 80,508,807 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000007;
const long long INF = 1LL << 60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retu... | #include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <vector>
#include <queue>
#include <stack>
#include <math.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){return b!=0?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a*... | 0 | 67,143,867 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T, class H> void rsz(V<T> &v, H h) { v.resize(h); }
template<class T, class H, class... R> void rsz(V<T> &v, H h, R... r) { v.resize(h); for (a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb pu... | 0 | 68,077,231 |
#include <cstdio>
using namespace std;
int main()
{
while(true) {
int n;
scanf("%d", &n);
if(n == 0)
break;
int change = 1000 - n;
int ans = 0;
for(int digit = 1; digit < 1000; digit *= 10) {
int cur = change / digit % 10;
ans += (cur / 5) + (cur % 5);
}
printf("%d\n", ans);
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define repreverse(i, start, end) for (long long i = start; i >= end; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define len(x) ((long long)(x).size())
#define lcm(a, b) ((a) / __gcd((a),... | 0 | 93,468,058 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n)... | 0 | 28,274,288 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair < int, int >;
using Ti = pair < Pi , int >;
constexpr int INF = (1 << 30) - 1;
constexpr int dy[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dx[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
template < typename T > T gcd(T a, T b) { return ( b ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0;i<(n);++i)
int main() {
int K; cin >> K;
vector<ll> A(K);
REP(i,K) cin >> A[i];
ll ans1, ans2;
ll low = 0;
ll high = 1e18;
ll mid;
while(high-low>1) {
mid = (high+low) / 2;
ll ... | 0 | 51,122,005 |
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,maps[20][20];
void da(int x,int y){
if(x>a || y>b) return;
if(maps[y][x]==2) return;
if(x==a && y==b){d++;return;}
da(x+1,y);
da(x,y+1);
}
int main(){
while(1){
d=0;
cin>>a>>b;
if(a+b==0)break;
cin>>c;
int x,y;
f... | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; ... | 0 | 8,233,193 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 50;
const int mod = 1e9 + 7;
bool d[maxn];
int main(){
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++){
int v, u;
cin >> v >> u;
d[v] ^= 1;
d[u] ^= 1;
}
for (int i = 1; i <= n;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
using ll = long long;
using namespace std;
using P = pair<long, int>;
#define fi first
#define se second
#define MAX 100010
int main() {
int n;
cin >> n;
long a[MAX], ma=0;
vector<int> cans;
for (int i=0; i... | 0 | 44,384,598 |
#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;
int main() {
int x;
cin >> x;
if (x >= 1200) {
cout << "ARC" << endl;
}
else {
cout << "AB... | #include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i = 0;i < (n); ++i)
#define all(v) v.begin(),v.end()
#define sort_1(v) sort(v.begin(),v.end())
#define sort_2(v) sort(v.begin(),v.end(),greater<ll>())
typedef long long ll;
typedef long double la;
using namespace std;
int main(){
string s;
c... | 0 | 55,127,008 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
int main(){
string S;
cin >> S;
if (S == "A"){
cout << "T" << endl;
}
else if (S == "T")
{
cout << "A" << endl;
}
else if (S == "G")
{
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 = 1; i <= (int)(n); i++)
typedef int64_t Int;
const int INF = 1e8;
int H, W, A, B;
vector<vector<int>> ans(1010, vector<int>(1010, 9));
int main(){
cin >> H >> W >> A >> B;
rep(y,H){
... | 0 | 67,775,519 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
int main() {
ll a, b, k;
cin >> a >> b >> k;
if (a + b < k) {
a = 0;
b = 0;
}
else if (a < k) {
k -= a;
a = 0;
b -= k;
... | #include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
temp... | 0 | 26,155,874 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,int> pdi;
typedef pair<double,double> pdd;
typedef pair<double,ll> pdl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;
using V=vector<int>;
using Vl=vector<ll>;
using VV=vector<vector<int>>;
usi... | 0 | 32,443,121 |
#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<<" ";ne... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
int main(){
string s;
cin >> s;
int l = 0;
int r = s.size() - 1;
int ans = 0;
while(r > l){
if(s[l] == s[r]){
r --;
l ++;
}else{
if(s[l] == 'x'){
l ++; ans ++;
}else if (s[r... | 0 | 15,477,491 |
#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) (x&-x)
#define pb push_back
#define empb emplace_back
#define all(x) (x).begin(),(x).end()
#define clr(a,b) memset(a,b,sizeof(a))
#define caze(T) for(cin>>T;T;T--)
#define inf (1<<29)
#define Endl ('\n')
#define fi first
#define se second
#define db double
... | #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>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | 0 | 64,882,668 |
#include <iostream>
using namespace std;
int main() {
long long s;
cin >> s;
int minDiff = 999;
for (long long i=1; s/i>=100; i*=10) {
int threeNumbers = s/i - (s/(i*1000))*1000;
minDiff = min(minDiff, abs(753-threeNumbers));
}
cout << minDiff << endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).... | 0 | 65,037,474 |
#include <iostream>
#include <vector>
using namespace std;
using ll = int64_t;
int main() {
ll n, x, m;
cin >> n >> x >> m;
vector<int> order(m);
vector<ll> value(m);
int ord = 1;
ll ans = 0;
while (n > 0) {
if (order[x] > 0) {
ll len = ord - order[x];
ll val = ans - value[x] + x;
an... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,l,r,i,ans = 0;
cin >> N;
for (i = 0; i < N; i++){
cin >> l >> r;
ans = (ans + ((r - l) + 1));
}
cout << ans << endl;
} | 0 | 246,054 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int n, k;
int a[100000];
signed main()
{
while (true) {
cin >> n >> k;
if (n == 0 && k == 0) break;
rep(i,n) cin >> a[i];
int mx;
int sum = 0;
rep(i,k) {
sum += a[i];
}
mx = sum;
for (int i=0; i<=n-k -1; i++) {
... | #include <iostream>
#include <cstdio>
using namespace std;
typedef int data_t;
typedef struct tag_node {
tag_node *before_;
data_t data_;
tag_node *next_;
} node_t;
class List
{
node_t *head_;
node_t *FindNodeFromBefore(data_t) const;
node_t *FindLastNode(void) const;
public:
List(void);
void Insert(... | 0 | 9,850,431 |
#include<iostream>
using namespace std;
int main(){
string s, t;
cin >> s >> t;
int ans = 0;
for(int i = 0; i < s.length(); i++){
ans += s[i] != t[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N,M; cin >> N >> M;
priority_queue<long long> que;
for(int i = 0; i < N; i++){
long long a; cin >> a;
que.push(a);
}
for(int i = 0; i < M; i++){
long long b = que.top();
que.pop();
que.push(b... | 0 | 11,349,872 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#def... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a[5];
for (int i = 0; i < 5; i++) {
cin >> a[i];
}
sort(a, a + 5);
for (int i = 4; i >= 0; i--) {
cout << a[i] << " \n"[i == 0];
}
return 0;
} | 0 | 76,982,622 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int short int
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
int n;
cin >> n;
V<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
V<ll> s(n);
s[0] = a[0];
for (int i... | 0 | 52,808,710 |
#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
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 10e10
#define rep(i,n) for(int i=0; i<n; i++)
#define repr(i,n,m) for(int i=m; i<n; i++)
#define MOD 1000000007
#define pb push_back
#define debug(x) cout << x << endl;
#define END cout << endl;
#define sorti(x) sort(x.begin(), x.end())
cons... | 0 | 61,052,675 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SZ(x) (int)(x).size()
#define ZERO(a) memset(a,0,sizeof(a)... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int> m1,m2;
int v;
rep(i,n){
cin>>v;
if(i%2==0) m1[v]++;
else m2[v]++;
}
int a=0,b=0,c=0,d=0,an,bn,cn,dn... | 0 | 86,093,432 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define begin begin()
#define end end()
void _main(){
long long a;
long double... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void frog(int *A,int n)
{
ll t[n+1];
for(int i=1;i<=n;i++)
{
if(i==1)
t[i]=0;
else if(i>=3){
t[i]= min( (t[i-1]+abs(A[i]-A[i-1])),
(t[i-2]+abs(A[i]-A[i-2])) );
}
else t[... | 0 | 50,283,085 |
#include <bits/stdc++.h>
const int INF=1e9,MOD=1e9+7;
const long long LINF=1e18;
using namespace std;
#define int long long
#define fin {cout<<-1<<endl;return 0;}
int pw(int n,int k){
int res=1;
while(k){
if(k&1)res*=n;
n*=n;
k>>=1;
}
return res;
}
signed main(){
int N;cin>>N;
std::vector<int> x... | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <utility>
#include <stdlib.h>
#include <fstream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <assert.h>
#include <unordered_map>
#include <unordered_set>
#include <math.h>... | 0 | 80,802,258 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
int main(void){
ll a;
long double b;
cin >> a >> b;
... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 7,820,737 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long S;
ignore = scanf("%lld", &S);
int x2 = 1e9;
int y3 = (S + x2 - 1) / x2;
int x3 = 1;
int y2 = x2 * 1ll * y3 - S;
printf("0 0 %d %d %d %d\n", x2, y2, x3, y3);
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
const int mod =1'000'000'007;
int main(){
int n, m;
cin >> n >> m;
vi h(n);
rep(i,n) cin >> h.at(i);
... | 0 | 83,978,198 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int N;
vector<i64> X,Y;
int main() {
cin >> N;
X.resize(N);
Y.resize(N);
for(int i = 0;i < N;i++) {
cin >> X[i] >> Y[i];
}
vector<i64> vec;
{
... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, ... | 0 | 63,822,428 |
#include<iostream>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
for(;;) {
int n, m, p;
cin >> n >> m >> p;
if(n == 0) break;
m--;
int s = 0;
int mx = 0;
for(int i = 0; i < n; i++) {
int x;
cin >> x;
s += x;
if(i == m) {
mx = x;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define FASTIO cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
#define loop(i,a,b) for(int i=a; i<b; i++)
#define INF 10000000000099ll
#define mod 1000000007
#define prDouble(x) cout<<fixed<<setprecision(10)<<x
ll solve(vecto... | 0 | 51,979,584 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b... | #include<bits/stdc++.h>
#define INF 9999999
#define ll long long
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
int dp[n];
vector<int>ar(n);
for(int i=0; i<n; i++)
cin>>ar[i];
dp[0]=0;
for(int i=1; i<n; i... | 0 | 36,718,052 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, p; cin >> n >> p;
string s; cin >> s;
if (p == 2 || p == 5)
{
int d;
long long ans = 0;
for (int i = 0; i < n; i++)
{
d = s[i] - '0';
if (d % p == 0) ans += i + 1;
}
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <climits>
const int MAX_H = 251;
int main(){
int H = 0;
int tree[MAX_H] = {0};
std::cin >> H;
for (int i = 1; i <= H; i++) {
std::cin >> tree[i];
}
for (int i = 1; i <= H; i++) {
std::cout << "node " << i << ": key = "<< tree[i] << ",... | 0 | 82,669,654 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <bitset>
#include <queue>
#include <map>
#include <utility>
#include <functional>
#include <iomanip>
#include <unordered_map>
#include <set>
u... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | 0 | 1,689,947 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
string a[100], b[100];
bool check(int i, int j)
{
if ((n - i) < m || (n - j) < m)
{
return false;
}
for (int ax = i, bx = 0; bx < m; ax++, bx++)
{
for (int ay = j, by = 0; by < m; ay++, by++)
{
if (a[ax][ay] ... | #include <iostream>
using namespace std;
int main(){
long int a[200000],n,cha;
cin>>n;
for(long int i=0;i<n;i++){
cin>>a[i];
}
long int back = 0;
for(long int j=1;j<n;j++){
back += a[j];
}
long int front = a[0];
cha = abs(back - front);
for(long int k=1;k<n-1;k++)... | 0 | 79,570,048 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
#include<deque>
#include <iomanip>
#include<utility>
us... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define PB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define MAX(a,b) (a>b)?a:b
#define MIN(a,b) (a>b)?b:a
#define REP(n) for(int i=0; i<n; i++)
#define REPj(n) for(int j=0; j<n; j++)
#define REPS(... | 0 | 2,566,594 |
#include <iostream>
using namespace std;
const int mxN = 205;
int a[mxN], b[mxN];
int main() {
int n;
cin >> n;
for(int i = 1; i < n; ++i)
cin >> b[i];
int tot = 0;
b[0] = b[n] = 1e9 + 9;
for(int i = 1; i <= n; ++i)
tot += min(b[i], b[i - 1]);
cout << tot;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; const int inf = 0x3fffffff; const ll INF = 0x3fffffffffffffff;
template<class T> inline bool chm... | 0 | 77,476,419 |
#include <bits/stdc++.h>
using namespace std;
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; }
#define ll long long
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
int N... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define MAX_N 50
typedef long long ll;
using namespace std;
ll comb(ll n, ll k) {
ll w = min(n - k, k);
if (n <= 1 || w == 0) {
return 1;
}
ll a = n;
for (int i = n - 1; i > n - w; --i) {
a *= i;
}
ll b = 1;
for (int i... | 0 | 47,610,733 |
#include<iostream>
using namespace std;
string a="qwertasdfgzxcvb";
main(){
string b;while(cin>>b&&b!="#"){
int c=-1,d=-1;
for(int i=0;i<b.size();i++){
int e=1;
for(int j=0;j<a.size();j++)if(a[j]==b[i])e=0;
if (d!=e)c++;
d=e;
}
cout<<c<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 3,048,765 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const double EPS = 1e-10;
const ll INF = 100000000;
const ll MOD = 1000000007;
int n;
ll a[200000];
bool solve(int m) {
vector<P> v;
for (int i = 1; i < n; i++) {
if (a[... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool In(){
char z;
cin>>z;
if(z=='N')return false;
return true;
}
int main(){
long long t=1000000000;
while(true){
cout<<"? "<<t<<"\n"<<flush;
if(In()){
if(t==1000000000){
long long x=500000000;
while(true){
cout<<"? ... | 0 | 48,686,391 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, x; cin >> a >> b >> x;
if(a > x)
cout << "NO\n";
else if((a + b) < x)
cout << "NO\n";
else if(a == x)
cout << "YES\n";
else if((a + b) >= x)
cout << "YES\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 31,125,753 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
string input;
while (true) {
cin >> n;
if (n == 0) { break; }
int count = 0, left = 0, right = 0, last = 0;
for (int i = 0; i < n; i++) {
cin >> input;
if (input == "lu" && left == 0) { left = 1; }
... | #include <iostream>
#include <vector>
using namespace std;
int n, a[100000];
vector<int> v[100000];
long long f(int x, int y){
long long s = 0, b;
if(v[x].size() == 1)return a[x];
for(int i=0;i<v[x].size();i++){
int z = v[x][i];
if(z != y){
long long w = f(z, x);
if(w... | 0 | 24,841,395 |
#include <iostream>
#include <queue>
#include <map>
using namespace std;
#define INF -1
typedef pair<int, int> P;
char mas[1000][1000];
int h, w, n, px, py, cnt = 0, life = 1;
int d[1000][1000];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int bfs(){
queue<P> que;
for(int i = 0; i < h; ++i){
for(int j = ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
bool cmp(pair<ll, ll> x, pair<ll, ll> y) {
if (y == make_pair(0ll, 0ll)) return false;
if (x == make_p... | 0 | 99,545,829 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<string> s(n);
vector<int> cnt(4);
rep(i,n) {
string s;
cin >> s;
... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 89,841,414 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string w;
int m, h, i, k, s;
while( true )
{
cin >> w;
if(w == "-")
break;
k = 0;
s = w.size();
cin >> m;
for(i = 0; i < m; ++i){
cin >> h;
k += h;
}
for(i = 0; i < s; ++i)
cout << w[(i+k)%s];
cout << "\n";
}
ret... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,a;
vector <int> v;
while(cin >> n,n){
for(int i = 0;i < n;i++){
cin >> a;
v.push_back(a);
}
sort(v.begin(),v.end());
int sum = 0;
for(int i = 1;i < n-1;i++){
sum += v[i];
}
... | 0 | 18,764,832 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n, k; cin >> n >> k;
string s; cin >> s;
int cnt = 1;
V<int> v;
if(s... | 0 | 39,784,325 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.