code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
using namespace std;
int main(){
int N,M,P,player[100];
int sum_ticket;
while(1){
cin >>N>>M>>P;
if(N==0 && M==0 && P==0)break;
sum_ticket=0;
for(int i=0 ; i < N ; i++){
cin >>player[i];
sum_ticket+=player[i];
}
if(player[M-1] != 0){
cout <<(sum_ticket*... | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | 0 | 61,671,390 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
using namespace std;
void selectionSort(vector<int> &a)
{
int cnt = 0;
for (int i = 0; i < a.size(); i++)
{
int mini = ... | #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>
#include <cctype>
#in... | 0 | 68,938,355 |
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
typedef long long ll;
const ll mod=1000000007;
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
int main() {
long long a;cin>>a;
double b;cin >>b;
long long bl = 100*b+0.0001;
long long c = (a*bl)/100;
cout << c << endl;
retur... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define PRINT(v) for (auto x : (V)) cout <<x <<" " <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4... | 0 | 73,465,300 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, m;
cin >> n >> m;
if (2*n > m) {
cout << m/2 << endl;
} else {
cout << n + (m-2*n)/4 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
cin>>s;
if (s.size()>=4) {
if (s[0]=='Y'&&s[1]=='A'&&s[2]=='K'&&s[3]=='I') {
cout<<"Yes"<<endl;
} else {
cout<<"No"<<endl;
}
} else {
cout<<"No"<<endl;
}
} | 0 | 28,655,284 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << "\n";
return;
}
template <typename First, typename... Rest>
void c... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
int taroP = 0;
int hanakoP = 0;
string taro,hanako;
cin >> n;
for (int i = 0; i < n ; ++i) {
cin >> taro;
cin >> hanako;
if (taro == hanako) {
taroP += 1;
hanakoP += 1;
... | 0 | 24,006,218 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> S;
rep(i,0,M-1) {
int k;
cin >> k;
vector<int> s(k);
rep(j,0,k-1) {
cin >> s[j];
--s[j];
}
sort(s.begin(), s.end());
S.push_b... | #include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | 0 | 68,058,619 |
#include<bits/stdc++.h>
#define SIZE 100008
#define mod (ll)(1e9+7)
#define INF 0x3f3f3f3f
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define abs(a) (a>0?a:-a)
#define all(a) a.begin(),a.end()
#define pb push_back
#define pi pair<int,int>
#define sort(a) sort(all(a))
#define reverse(a) reverse(all(a))
#defin... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<pair<ll,ll>> vii;
typedef pair<ll,ll> pii;
typedef map<ll,ll> mii;
#define MOD7 1000000007
#define MOD9 1000000009
#define pi 3.1415926535
#define Test... | 0 | 87,708,105 |
#include<bits/stdc++.h>
using namespace std;
string S; int x, y, cnt, flag; bool dp[8009][32009]; vector<int> v1, v2, v3;
bool solve(vector<int>vec,int g ) {
for (int i = 0; i <= vec.size(); i++) {
for (int j = 0; j <= 32000; j++) { dp[i][j] = false; }
}
dp[0][16000] = true;
for (int i = 0; i < vec.size(); i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i=0; i<13; i++) {
if (i<4) {
cout << s.at(i);
}
else if (i==4) {
cout << " ";
}
else {
cout << s.at(i-1);
}
}
cout << endl;
} | 0 | 11,587,914 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,i;
cin >> n;
vector<int> a(n);
for(i=0;i<n;++i){
cin >> a[i];
}
int ans=0;
for(i=0;i<n-1;++i){
if(a[i]==a[i+1]){
ans++;
if(a[i]==a[i+2] && i<n-2){
i++;
}
}
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<vector>
using namespace std;
int bs(vector<int> arr, int x, int a, int b) {
if(a == b) return a;
else {
int c = (a+b)/2;
if(arr[c] < x && arr[c+1] >= x) return c+1;
else if(arr[c] >= x) return bs(arr, x, a, c);
else return bs(arr, x, c, b);
}
}
int main() {
int N, len... | 0 | 29,846,454 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (n); i++)
const ll INF = 1LL << 60;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
... | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> ... | 0 | 36,981,296 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <cmath>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
s += s;
for (int i=0; i<t.length(); i++) {
int check = 0;
for (int j=0; j<t.length(); j++) {
if (s[i+j]!=t[j]) check = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll zero = 0;
const ll INF = 10000000000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(void){
int N;
cin >> N;
vector<int> a(101, 0);
int tmp;
for(int i = 1 ; i <= N; i++){
tmp = i;
for... | 0 | 59,150,884 |
#include<cstdio>
using namespace std;
int main(void){
int in[100],data,ans[100],cnt,work=0;
int i,j;
for(i=0;i<100;i++){
ans[i]=0;
in[i]=0;
}
for(i=0;i<100;i++){
if(scanf("%d",&data)==EOF) break;
in[data]++;
}
for(i=1;i<100;i++)
if(in[work]<in[i]) work=i;
ans[0]=work;
cnt=0;
for(i=1;i<100;i++){
... | #include <cstdio>
void solvex(int x, int y){
if(x > 9)return ;
printf("%dx%d=%d\n",y,x,x*y);
solvex(x+1,y);
}
void solvey(int y){
if(y > 9)return ;
solvex(1, y);
solvey(y+1);
}
int main(){
solvey(1);
return 0;
} | 0 | 20,634,491 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define f(i,a,n) for(int i=a ; i<n ; i++)
#define rf(i,n,a) for(int i=n ; i>=a ; i--)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#def... | 0 | 92,744,170 |
#include<iostream>
using namespace std;
int main() {
string a= "";
cin >> a;
for(int j = (int)a.size()-1;j>=0;j--){
cout << a.substr(j, 1);
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n!=0){
vector<int> a(n);
for(int i=0;i<n;i++)
cin>>a[i];
sort(a.begin(), a.end(),greater<int>() );
int df=1000001;
for(int i=0;i<n-1;i++){
if(df>=a[i]-a[i+1]){
df = a[i]-a[i+1];
}
}
cou... | 0 | 58,020,804 |
#include "bits/stdc++.h"
using namespace std;
int main(){
int n;
cin>>n;
int ans=100000;
for(int i=0;i<n;i++){
ans=(ans*1.05);
int ans2=ans/1000;
ans2*=1000;
if(ans!=ans2){
ans=ans2+1000;
}else{
ans=ans2;
}
}
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
const int TopIndex = 1;
const int DummySize = 1;
void Exchange(vector<int>& Heap, int& InsertIndex, int& ParentIndex)
{
swap(Heap[InsertIndex], Heap[ParentIndex]);
InsertIndex = ParentIndex;
ParentIndex = InsertIndex / 2;
}
void Insert(vect... | 0 | 89,344,915 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
if(n>=1&&n<=100&&k>=1&&k<=pow(10,5)){
if(n*500>=k)
cout<<"Yes"<<endl;
else if(n*500<k)
cout<<"No"<<endl;}
return 0;} | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
struct edge {
int to;
ll cost;
};
vector<edge> tree[100010];
ll cost_k[100010];
void dfs(int v, int par, ll dist) {
cost_k[v] = dist;
for (int i = 0; i < (int)tree[v].size(); i++) {
if (tree[v][i].to == par)continue;
dfs(tre... | 0 | 40,173,035 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
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 int64_t INF = 1LL << 60;
int main() {
string s;
cin>>s;
int c... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
ll mod = 1000000007;
ll ans = 1<<29;
int main() {
ll n,k;
cin>> n >> k;
vector<pair<ll,ll>> P (n);
rep(i,n){
... | 0 | 94,628,373 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
bool compPair(const pint& arg1, const pint& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
templa... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define umap unordered_map
#define... | 0 | 77,124,179 |
#include<iostream>
#include<stdio.h>
#include <ctype.h>
using namespace std;
int main()
{
char c;
char alpha_count[26]={0};
int n=0;
while (cin >> c) {
if(isalpha(c)){
c = tolower(c);
}
alpha_count[c-'a']++;
}
for(int i=0; i<26; i++) {
printf("%c : %d\n", i+'a', alpha_count[i]);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define sz size()
#define mk make_pair
#define clr clear()
#define B begin()
#define E end()
#define EM empty()
#define mem(a,b) memset(a,b,sizeof(a))
#define rep(i,n) for(i=0;i<n;i++)
#define Rep(i,n) for(i=1;i<=n;i++)
#define all(cont) cont.begin(),cont.end()
#define pb pu... | 0 | 9,894,450 |
#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>
#include... | #include <bits/stdc++.h>
using namespace std;
#define rall(x) x.rbegin() , x.rend()
#define all(x) x.begin() , x.end()
#define fi first
#define se second
#define pb push_back
using ll = long long;
using ii = pair <ll , ll>;
void in(ll &x);
#define singleCase
ll n,a,b;
void work() {
in(n); in(a); in(b);
if (a > b ... | 0 | 63,012,761 |
#include <bits/stdc++.h>
using namespace std;
int main () {
string n;
cin >> n;
cout << (n[0] == '1' ? 9 : 1) << (n[1] == '1' ? 9 : 1) << (n[2] == '1' ? 9 : 1);
} | #include<stdio.h>
#include<string.h>
int main(){
int a=0,b=0,n,i,j,sa,sb,flag;
char as[101],bs[101];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %s",as,bs);
sa=strlen(as);
sb=strlen(bs);
if(sa<sb)flag=sb;
else flag=sa;
for(j=0;j<flag;j++){
if(as[j]>bs[j]){
a+=3;
break;
}
... | 0 | 61,405,357 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#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);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 6,132,930 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin >> n;
if(n/100 == 9){
cout << 1;
}else{
cout << 9;
}
if((n/10)%10 == 9){
cout << 1;
}else{
cout << 9;
}
if(n%10 == 9){
cout << 1 << endl;
}else{
cout << 9... | #include <algorithm>
#include <iostream>
#include <stack>
#include <set>
#include <cstdio>
#include <cstring>
using namespace std;
int ans[100005];
int res[100005];
int kun[100005];
int a[200005][2]={0};
int main(){
int n;
cin>>n;
long long a[200005];
long long res=0;
for(int i=0;i<n;i++){
c... | 0 | 66,756,853 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;cin>>N>>M;
int array[N]={0};
for(int i=0;i<M;i++){
int a,b;cin>>a>>b;
array[a-1]++;
array[b-1]++;
}
bool ans=1;
for(int i=0;i<N-1;i++){
if(array[i]%2)ans=0;
}
if(ans)cout<<"YES"<<endl;
else ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
int main(){
int n, m; cin >> n >> m;
vector<int> S(n);
rep(k, m){
int tmp; cin >> tmp;
rep(i, tmp){
int a; cin >> a; a--;
S[a] |= 1 << k;
}
}
int p = 0;
re... | 0 | 48,545,967 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int main()
{
int L, R;
ci... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a/gcd(a,b) * b;
}
ll zyou(ll a,ll b){
ll res = 1;
for(int i = 1;i<=b;i++){
res *= a;
}
ret... | 0 | 71,935,565 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
string abcd;
cin >> abcd;
vector<int> n(4);
rep(i,4) n[i] = abcd[i] - '0';
if(n[0]+n[1]+n[2]+n[3]==7) printf("%d+%d+%d+%d=7",n[0],n[1],n[2],n[3]);
else if(n[0... | #include<bits/stdc++.h>
using namespace std;
int main() {
float a, b;
cin >> a >> b;
if(12.5 * a >= 10 * b + 10 || 10 * b >= 12.5 * a + 12.5) {
cout << -1 << "\n";
}
else if(10 * b >= 12.5 * a) {
cout << 10 * b << "\n";
}
else {
if(12.5 * a == (int)(12.5 * a)) {
... | 0 | 67,842,050 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long h,w,d,q;
cin >> h >> w >> d;
vector<long> x(h*w);
vector<long> y(h*w);
vector<long> aaa(h*w);
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) {
long num;
cin >> num;
x[num-1]=j;
y[num-1]=i;
}
}
for(int i=d;i<h*w;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) {
int x;
cin >> x;
a[x-1]++;
}
sort(a.begin(), a.end());
vector<int> s(n+1);
rep(i,n) s[i+1] = ... | 0 | 52,820,327 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
struct task{
int cost;
int... | #include <iostream>
#include <cstdio>
#include <vector>
#include <deque>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
const int MAX_N = 100100;
ll H,W,N;
ll ans[10];
map<pair<int, int>, int> m;
int main(){
cin... | 0 | 43,564,719 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
llint n;
string s;
void solve(){
cin >> s;
if(s=="keyence"){
cout << "YES" << endl;
}
else{
bool ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
for (int bit = 0; bit < (1 <<... | 0 | 38,456,823 |
#include <iostream>
using namespace std;
const int N=200010;
int u[N],v[N];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<n;++i){
cin>>u[i]>>v[i];
}
long long res=0;
for(int i=1;i<=n;++i){
res=res+(long long )(n-i+1)*i;
}
for(int i=1;i<n;++i){
if(u[i]>v[i]) swa... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 46,365,113 |
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define pi 3.141592653589... | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | 0 | 29,980,384 |
#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;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
using ld=long double;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ordered_set tree<pll, null_type,less... | 0 | 89,790,963 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> light(N);
for(int i = 0; i < N ; i++){
cin >> light.at(i);
}
int next = 1;
bool check = false;
int counter = 0;
for(int i = 0; i < N ; i++){
counter++;
next = light.at(next - 1);
... | #include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Pair vector<pair<ll,ll>>
#define vec vector <ll>
#define all(a) a.begin(),a.end()
#define mo 1000000007
#... | 0 | 4,656,901 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(int i = 0; i < n; i++)
int main() {
ll a,b,c,k;
cin >> a >> b >> c >> k;
if (a-b > 1000000000000000000) {
cout << "Unfair" << endl;
}
else if (k%2 == 1) {
cout << b - a << endl;
}
else {
cout << a - b ... | #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;
template<class T>bool chmax(T &a,const T &b){
if(a>b)return false;
a=b;
return true;
}
template<class T>bool chmin(T &a,const T &b){
if(a<b)return false;
a=b... | 0 | 25,372,964 |
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define sz(x) (int)x.size()
#defi... | #include<bits/stdc++.h>
#define ll long long
#define mp make_pair
#define F first
#define S second
#define db double
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
using namespace std;
ll mod=1e9 +7;
ll expo(ll base,ll exponent,ll mod){
ll ans=1;
while(exponent!=0){
if(exponent&1) ans=(1... | 0 | 91,488,673 |
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int nowp,ans[10000];
char ch;
bool check(int x)
{
printf("? ");
for(int i=1;i<nowp;++i)
printf("%d",ans[i]);
printf("%d",x);
for(int i=1;i<=12-nowp;++i)
printf("0");
printf("\n");
fflush(stdout)... | #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 | 74,997,032 |
#include <iostream>
using namespace std;
int main(void){
int k, x;
cin>>k>>x;
int ans=500*k;
if (ans>=x) {
cout<<"Yes"<<endl;
}
else {
cout<<"No"<<endl;
}
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long n;
cin >> n;
long long a[n+1], b[n+1];
for(long long i = 0; i <= n; i++){
cin >> a[i];
}
if(n == 0){
if(a[0] == 1){
cout << 1 << endl;
return 0;
}
... | 0 | 25,819,765 |
#include <cstdio>
int main()
{
int a;
scanf("%d", &a);
if(a==25)
{
printf("Christmas");
}
else if(a==24)
{
printf("Christmas Eve");
}
else if(a==23)
{
printf("Christmas Eve Eve");
}
else if(a==22)
{
printf("Christmas Eve Eve Eve");
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | 0 | 91,314,527 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(33);
ll n,k;
cin>>n>>k;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
vector<ll> v;
for(int i=0;i<n;i++){
ll sum = 0... | #include<bits/stdc++.h>
using namespace std;
#define N_MAX 100001
#define NIL -1
struct node{
int parent, sibiling, child;
};
int n;
node T[N_MAX];
int D[N_MAX];
void insert(){
int i, j;
int s, p, c, m, tmp_s;
for(i=0; i<n; i++) T[i].parent=T[i].sibiling=T[i].child=NIL;
for(i=0; i<n; i++){
scanf("%d %d", ... | 0 | 89,484,558 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
#include<stack>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 93,251,413 |
#include <bits/stdc++.h>
#define arep(a,i,n) for(ll i=(a);i<(n);i++)
#define rep(i,n) for(ll i=0;i<(n);i++)
#define cinf(x,n) for(ll i=0;i<(n);i++)cin>>x[i];
#define coutf(x,n) for(ll i=0;i<(n);i++)cout<<x[i]<<endl;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
ll cn... | #include <cstdio>
#include <iostream>
#define REP(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
char buf[30000+10];
int main(void) {
int n;
cin >> n >> buf;
char d[3];
int res = 0;
for(d[0] = '0'; d[0] <= '9'; ++d[0]) {
for(d[1] = '0'; d[1] <= '9'; ++d[1]) {
for(d[2] = '0'; d[2] <= '9'; ++... | 0 | 80,139,931 |
#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;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 84,232,076 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int X; cin >> X;
int G = lcm(360, X);
printf("%d\n", G / X);
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b, c, k;
cin >> a >> b >> c;
cin >> k;
int sum = 0;
if (k <= a)
{
sum += k * 1;
}
else
{
sum += a * 1;
k -= a;
if (k <= b)
{
sum += k * 0;
}
else
... | 0 | 16,318,918 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> pix(h, vector<char>(w));
vector<vector<char>> lpix(2*h, vector<char>(w,'.'));
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin >> pix.at(i).at(j);
}
}
for(int i=0; i<h; i++){
for(i... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <cmath>
#include <memory.h>
#include <iomanip>
#include <cassert>
using namespace std;
#define maxn 100002
#define FOR(i, l, r) for (int i=l; i<=r; ++i)
#define FORD(i, r, l) for (int i=r; i>=l; --i)... | 0 | 61,552,405 |
#include <stdio.h>
int main(){
int a, b;
scanf("%d %d", &a, &b);
if(a*b%2==0) printf("Even");
else printf("Odd");
return 0;
} | #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 n;
... | 0 | 5,237,979 |
#include<iostream>
using namespace std;
long long N,A,S,ans;
int main(void){
cin>>N;
for(int i=0;i<N;i++){cin>>A;if(A)S+=A;else ans+=S/2LL,S=0LL;}
cout<<ans+S/2LL<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define faster ios_base::sync_with_stdio(0);cin.tie(0);
#define mem(a,v) memset(a,v,sizeof(a))
const ll INF=... | 0 | 37,745,973 |
#include <bits/stdc++.h>
#define maxn 100001
#define maxa 2000005
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
#define ll long long
#define pii pair<ll, ll>
#define piii pair<pii, ll>
#define ft first
#define sd second
#define pb push_back
#define rep(i, a, n) for(ll i = a; i < n; i++)
#d... | #include<iostream>
#include <vector>
using namespace std;
const int N = 2e5 + 10;
int ans=0,res=0;
int n , m ;
int vist[N];
bool cycle;
vector<vector<int> > v(N);
void dfs(int n , int p){
vist[n] = true;
for(int i = 0; i < v[n].size() ;i++){
int cur = v[n][i];
if(!vist[cur])
{ans++;d... | 0 | 73,334,916 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll ... | #include <iostream>
using namespace std;
class Rands {
public:
int a, b, c, x, countNext;
Rands(int _a, int _b, int _c, int _x):
a(_a),
b(_b),
c(_c),
x(_x),
countNext(0) {
}
int getNext() {
++countNext;
int oldX = x;
x = (a * x + b) % c;
return old... | 0 | 6,413,587 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> P;
constexpr int INF = 1e9;
constexpr int MOD = 1e9+7;
int main() {
string r;
cin >> r;
int cnt = 0,ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> p;
#define MOD 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<p> v(N);
for(ll i = 0; i < N; i++) {
ll t, d;
cin >> t >> d... | 0 | 33,583,726 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b,c,ans,cou;
cin>>a>>b>>c;
cou=0;
vector<vector<char>> data(a, vector<char>(b));
for(int64_t i=0;i<a;i++){
for(int64_t j=0;j<b;j++){
cin>>data.at(i).at(j);
}
}
for(int64_t i=0;i<pow(2,a);i++){
for(int64_t j=0;j<pow(2,b);j++){
int64_t... | 0 | 62,534,627 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin>>n,n){
vector<int>V(n);
for(int i=0;i<n;i++)cin>>V[i];
sort(V.begin(),V.end());
int sum=0;
for(int i=1;i<n-1;i++)sum+=V[i];
sum/=(n-2);
cout<<sum<<end... | #include<bits/stdc++.h>
#include<cmath>
#define pb push_back
#define ld long double
#define mp make_pair
#define vl vector<ll>
#define vd vector<double>
#define vld vector<long double>
#define ll long long int
#define pl pair<ll, ll>
#define all(a) a.begin(), a.end()
#define forr(i, n) for(ll i=0; i<n; i++)
#define f... | 0 | 59,903,987 |
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x)... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <utility>
#include <bitset>
using namespace std;
typedef long long ll;
const ll inf = 4e18;
const ll mod = 1e9+7;
#define print(X) cout << X << endl
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all... | 0 | 23,660,626 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int result = 0;
result += M * (M - 1) / 2;
result += N * (N - 1) / 2;
cout << result << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vi = vector<ll>;
using vvi = vector<vi>;
int64_t gcd(int64_t a, int64_t b) {return b?gcd(b, a%b):a;}
int64_t l... | 0 | 27,413,487 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
struct UnionFind {
vector< int > data;
UnionFind(int sz) {
data.assign(sz, -1);
}
bool unite(int x, int y) {
x = find(x), y = find(y);
if(x == y) return (false);
if(data[x] > data[y]) swap(x, y);
data[x] += data[y];
d... | 0 | 66,905,160 |
#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
int mmx = 0;
set<int> st;
for (int i = 0; i < n; i++)
{
int x;
scanf("%d", &x);
if (mmx < x)
mmx = x;
st.insert(x);
}
int val = mmx / 2;
auto it = st.lower_bound(val);
int id = 0;
if (it... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vpii;
typedef vector<pair<ll,ll> > vpll;
const int MOD=1e9+7;
const int MAX=1e5+5;
const double PI= acos(-1.0);
const long double EPS=1e-10;
const int64_t INF=1e18+10;
#define fasti... | 0 | 8,044,942 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pii pair<int,int>
#define reset(x,n) memset((x),(n),sizeof(x))
#define all(n) (n).begin(),(n).end()
#define pb push_back
#define IOS ios::sync_with_stdio(0),cin.tie(0);
bitset<10010> ok[5005];
int stick[] = {0,... | 0 | 94,567,453 |
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 1, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define pb push_back
#define PI 3.141592653589793
#de... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <stack>
#include <map>
#include <iomanip>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
int main(){
v... | 0 | 46,769,278 |
#include <cstdio>
#include <iostream>
using namespace std;
int main(){
long long f[50];
f[0]=1;
f[1]=1;
for(int i=2; i<45; ++i) f[i]=f[i-1]+f[i-2];
int n;
scanf(" %d", &n);
cout << f[n] << endl;
} | #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>;
ll gcd(ll a,ll b){
int c,d,e;
c=max(a,b);
d=min(a,b);
while(1){
c=c%d;
if(c==0){
break;
}
e=d;
d=c;
c=e;
}... | 0 | 48,569,422 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
typedef map<string, int> msi;
int main(){
double l;cin>>l;
double edge = l / 3;
double ans = edge * edge * edge;
printf("%.7lf", ans);
return 0;
} | #include <iostream>
int sum = 0;
void switchState(int n, int m, int d, int s[10][10], int k[10], int p[10], int states[10], int number){
if(d == n){
for(int i = 0; i < m; i++){
number = 0;
for(int j = 0; j < k[i]; j++){
if(states[s[i][j] - 1] == 1){
... | 0 | 29,872,091 |
#include <iostream>
using namespace std;
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
int a, b; cin >> a >> b;
int min8 = (a * 100 + 7) / 8;
int max8 = ((a + 1) * 100 + 7) / 8 - 1;
int min10 = (b * 100 + 9) / 10;
int max10 = ((b + 1) * 100 + 9) / 10 - 1;
if (min8 < min10) {
if (max8 < min10) cout... | #include <cstdio>
using namespace std;
const int N=100005;
int p,dis[N],q1[N],l1,r1,q2[N],l2,r2;
bool vi[N][2],flag;
int read()
{ char x=getchar();
while(x<48||x>57) x=getchar();
int ans=0;
while(x>=48&&x<=57)
{ ans=(ans<<1)+(ans<<3)+(x^48);
x=getchar();
}
return ans;
}
void add(int num)
{ int x;
x=(num+1)%p;
... | 0 | 36,644,745 |
#include <iostream>
int main(void){
long long b = 0, ans = 0;
std::string S;
std::cin >> S;
for (char c: S){
if (c == 'B'){
++b;
} else {
ans += b;
}
}
std::cout << ans << std::endl;
return 0;
} | #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 rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 94,635,688 |
#include <iostream>
using namespace std;
int main()
{
int n;
while (cin >> n) {
int d = n;
long long res = 0;
while (d < 600) {
long long y = d * d;
res += n * y;
d += n;
}
cout << res << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vec... | 0 | 34,909,717 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | #include<cstdio>
int c[10001]={};
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
int a;
scanf("%d",&a);
c[a]++;
}
for(int i=0;i<10000;i++){
for(int j=0;j<c[i];j++){
printf("%d%c",i,(n==1)?'\n':' ');
n--;
}
}
return 0;
... | 0 | 76,289,614 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
ll gcd(ll a,ll b){return b ? gcd(b,a%b) : a;}
ll lcm... | 0 | 6,816,253 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<queue>
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using namespace std;
int main()
{
int N; cin >> N;
ll cnt = 0;
vector<ll> A(N), B(N);
for(int i=0; i<N; i++) cin >> A[i] >> B[i];
for(int i=N-1; i>=0;... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<long double, long double>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001... | 0 | 25,076,047 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int) x.size())
#define pb push_back
#define mp make_pair
#define F first
#define S second
typede... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | 0 | 52,184,913 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
const llong mod = (llong)(1e9) + 7;
st... | #include<iostream>
using namespace std;
int K[102][102], V, E;
int main() {
int k, i, j, s, t, d;
cin >> V >> E;
for(i = 0; i < V; i++)
for(j = 0; j < V; j++) {
if (i == j) K[i][j] = 0;
else K[i][j] = 0x7FFFFFFF;
}
for(i = 0; i < E; i++) {
cin >> s >> t >> d;
K[s][t] = d;
}
for(k... | 0 | 92,760,247 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
char a, b; cin >> a >> b;
cout << ((a == b) ? "H" : "D") << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<long long int> a(n),b(n);
rep(i,n) cin >> a.at(i) >> b.at(i);
long long int ans=0;
int num;
for(int i=n-1; i>=0; i--){
a.at(i)+=ans;
num=a.a... | 0 | 80,355,384 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int M=1e9+7;
void print(vector<int>& v){
for (int i:v) cout<<i<<" ";
cout<<endl;
}
void printv(vector<vector<int>>& v){
for (auto x:v) print(x);
}
void add(int &a, int b){
a+=b;
if (a>=M) a-=M;
}
void sub(int &a, int b){
a-=b;
if (a<0) a+=M;... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REP1(i, n) for(int i = 1; i <= (n); i++)
#define REPD(i,a,b) for (int i=(a);i<(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> v... | 0 | 26,978,559 |
#include <bits/stdc++.h>
using namespace std;
string s, t;
int main(){
cin>>s>>t;
if(t.find(s)==0) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 13,919,520 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
using namespace std;
#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i... | #include<bits/stdc++.h>
using namespace std;
long long N, M, X;
long long C[20];
long long A[20][20];
int main(){
cin >> N >> M >> X;
for(long long i = 0; i < N; i++) {
cin >> C[i];
for(long long j = 0; j < M; j++) {
cin >> A[i][j];
}
}
long long ans = LONG_MAX;
for(long long pat = 0; pat < (1<<N); pat++)... | 0 | 9,802,951 |
#include <iostream>
using namespace std;
long long K, rec[60], ans[60];
const long long N = 50;
int main() {
cin >> K;
long long div = K / N, mo = K % N;
for (long long i=0;i<N;i++)
rec[i] = div + (i < mo);
for (long long i=0;i<N;i++) {
long long sum = 0;
for (long long j=... | #include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
#define debug cout << "Ok" << endl;
using namespace std;
void solve(){
return;
}
int3... | 0 | 40,181,348 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int mod = 1e9 + 7;
ll dp[100005][2];
int main() {
string s;
cin >> s;
int n = s.size();
dp[0][0] = 1;
rep(i, n) {
{
if (s[i] == '0') {
dp[i + 1][0] = dp[i][0];
... | 0 | 94,686,573 |
#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(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
string s = " ";
string t;
cin >> t;
s += t;
int N = (int)t.size();
bool is = true;
int a = N/2;
rep(i, a){
if(s[1+i] != s[N-i]) is = false;
}
int b... | 0 | 33,864,434 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int table[26];
char buf[30];
int main(){
for(int i = 0; i < 26; i++){
table[i] = 0;
}
scanf("%s",... | #include<iostream>
#include<vector>
#include<queue>
using namespace std;
int main() {
int N,M,i,a,b;
cin>>N>>M;
vector<vector<int> > E(N+1, vector<int>());
for (i=0;i<M;i++) {
cin>>a>>b;
E[a].push_back(b);
E[b].push_back(a);
}
vector<int> ans(N+1, -1);
queue<int> R;
ans[0]=ans[1]=0;
R.push... | 0 | 57,788,749 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
long long longest=0;
long long k,n;
cin>>k>>n;
vector<long long> arr;
for(int i=0;i<n;i++) {
long long num;
cin>>n... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int A = 0;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) == 'a') {
A++;
}
}
int B = 0;
for (int j = 0; j < S.size(); j++) {
if (S.at(j) == 'b') {
B++;
}
}
int C = 0;
for (int k = 0; k < S.si... | 0 | 21,211,880 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
cin >> n;
while(n--){
int a[3];
cin >> a[0] >> a[1] >> a[2];
bool tf=false;
for(int b=0; b<3; b++){
for(int c=0; c<3; c++){
if(b==c) continue;
for(int d=0; d<3; d+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,... | 0 | 24,735,902 |
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x... | #include <bits/stdc++.h>
using namespace std;
bool next_term(vector<int> &f){
f[0]++;
for(int i=0; i<f.size() - 1; i++){
if(f[i] == 2) f[i+1]++;
f[i] %= 2;
}
return (f.back() != 2);
}
bool satisfied(vector<int> &s, int x){
for(auto si : s){
if( si < x ) return false;
}
... | 0 | 14,924,628 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
int n;
cin >> n;
vector<int> a(n... | #include <bits/stdc++.h>
#define f(i, a, b) for (int i = a; i < (b); ++i)
#define rep(i, n) f(i, 0, n)
using namespace std;
using ll = long long;
int main(void) {
int x, n;
cin >> x >> n;
int p[n];
rep(i, n) cin >> p[i];
int i = 0;
while (true) {
int A = x - i, B = x + i;
bool a = true, b = true;
... | 0 | 95,001,626 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
#include<unordered_map>
using namespace std; ... | #include <iostream>
#include <stdio.h>
#include <stdint.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <string>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <deque>
using namespace::std;
int ri()
{
int x;
scanf("%d", &x);
return ... | 0 | 35,249,697 |
#include <bits/stdc++.h>
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,n,s) for(int i=(s);i<(n);i++)
#define rrep(i,n) for(int i=(n-1);i>=0;i--)
#define rreps(i,n,s) for(int i=s;i>=n;i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
template<class T> bool chmax(T &a, c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pair;
typedef vector<ll> vll;
typedef vector<vector<ll>> Graph;
typedef vector<string> vs;
typedef vector<pair<ll, ll>> Pll;
typedef queue<ll> qll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n... | 0 | 72,369,884 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n); for(int i = 1;i<n;++i)
using ll = long long;
using P = pair<int,int>;
int main(){
ll x,y;
cin >> x >> y;
if(x % y == 0){
puts("-1");
return 0;
}
rep(i,100000){
if(x*i % y != 0){
cout << x*i << endl;
return 0;
}
}
r... | #include <iostream>
using namespace std;
constexpr int MAX=1000000;
constexpr int NIL=-1;
struct Node{int parent, left, right;};
Node T[MAX];
int n, D[MAX];
void print(int u){
int i, c;
cout << "node " << u << ": ";
cout << "parent = " << T[u].parent << ", ";
cout << "depth = " << D[u] << ", ";
if(T[u].p... | 0 | 96,698,585 |
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair
#define F first
#define S ... | #include <bits/stdc++.h>
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
int n;
cin >> n;
... | 0 | 57,096,208 |
#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){
char c;
cin >> c;
if(isupper(c))
... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int mod=1e9+7;
const int N = 2e5+5;
vector<ll>ans,veca,vecb;
vector<int>adj[N];
vector<double>aka;
vector<pair<int,double>>dp[N];
vector<bool>vis;
void init(int n){
ans.clear();veca.clear();aka.clear();vis.clear();
vecb.clear(),vecb.resize(n... | 0 | 98,552,486 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
const int MX=100010,INF=1001001001,mod=1e9+7;
int dp[MX];
bool ng[MX];
int main(){
int n,m;
cin>>n>>m;
set<int>se;
rep(i,m){
int a; cin>>a;
ng[a]=true;
}
rep(i,MX)dp[i]=0;... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 56,925,777 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | #include <iostream>
#include <utility>
#include <tuple>
#include <string>
#include <cstdint>
#include <vector>
#include <array>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cassert>
using namespace std;
using i64 = int64_t;
i64 n, k, dp[302][302];
vector<i64> h;
int mai... | 0 | 92,852,256 |
#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() {
ll N, K;
cin >> N >> K;
ll sum = 0;
for (ll i = K; i <= N + 1; i++) {
sum += (N - i + 1) * i + 1;
sum %= 1000000007LL;
}
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | 0 | 71,407,261 |
#include <iostream>
using namespace std;
int main()
{
long long c[51];
long long k,a,b;
int j=0;
scanf("%lld",&k);
a=k/50;
b=k%50;
cout<<"50"<<endl;
if(k%50==0)
{
for(long long i=50+a-1;i>=a;i--)
cout<<i<<" ";
}
else
{
for(long long i=50+a;i>=a;i--)
... | #include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf emplace_front
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pii pair<int,int>
#define psi pair<string,int>
#define vi vector<int>
#define vpii vector<pii>
#de... | 0 | 7,152,367 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
char a,b;
cin >> a >> b;
(int)(a -= 'A');
(int)(b -= 'A');
if(a > b) cout << ">" << endl;
if(a == b) cout << "=" << endl;
if(a < b) cout << "<" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
if (x % y == 0) {
return y;
} else {
return gcd(y, x % y);
}
}
long long lcm(long long x, long long y) {
return x / gcd(x, y) * y;
}
int main() {
long long num;
long long tmp1;
long long ... | 0 | 30,226,473 |
#include <iostream>
#include <cmath>
int main() {
int N;
int X;
int T;
std::cin >> N;
std::cin >> X;
std::cin >> T;
std::cout << (int) (std::ceil((double) N / X) * T) << std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#... | 0 | 99,889,057 |
#include<cstdlib>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
#include<cmath>
using namespace std;
const int MAXN = (int) 1e3 + 10;
const int INF = (int) 0x3f3f3f3f;
typedef long long LL;
char s1[MAXN],s2[MAXN];
int dp[MAXN][MAXN];
void work()... | #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;
unordered_map<int,bool> mp1;
unordered_map<int,bool> mp2;
r... | 0 | 97,762,156 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin>>s;
cout<<s.insert(4," ")<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
int counting(int N_H, int N_W, vector< vector<int> > &Graph, queue< pair<int, int> > &PaintingPos)
{
int count = 0;
pair<int, int> pos_y_x;
queue< pair<int, in... | 0 | 14,826,387 |
#include<iostream>
#include<string>
using namespace std;
int main( )
{
string s, p;
getline( cin, s );
getline( cin, p );
s += s;
int j=0;
for( int i=0; i<s.length()/2; i++ ) {
if( s[i] == p[j] ) {
while( s[ i+j ] == p[j] ) { j++; }
if( p.length() == j ) {
break;
} else {
j = 0;
}
}
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll INF = 10000000000000000;
vector<int> x4 = {0, 1, 0, -1}, x8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<... | 0 | 80,897,305 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B;
cin >> A >> B;
if (A + B == 3){
cout << 3 << endl;
}
else if (A + B == 4){
cout << 2 << endl;
}
else if (A + B == 5){
cout << 1 << endl;
}
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | 0 | 50,695,483 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <fstream>
#include <sstream>
#include <map>
using namespace std;
const unsigned long long BASE = 1e9 + 7;
int main()
{
int n;
cin >> n;
int * b = new int[n];
int sum = 0;
for (int i = 0; i < n - 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, s = 0;
float sum = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
{
cin >> a[i];
sum += a[i];
}
sum /= n;
if (sum - floor(sum) <= 0.5) d = floor(sum);
else d = ceil(sum);
for (int i = 0;... | 0 | 59,145,962 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> P;
const ll MOD=1000000007LL;
const double INF=1000000000;
const int MAX=100001;
int main(){
ll n,l,t;
cin>>n>>l>>t;
ll w[100010],x[100010];
vector<ll> v;
for(int i=0;i<n... | 0 | 4,142,814 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#inclu... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | 0 | 14,318,736 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
if (s == "AAA" || s == "BBB")
cout << "No" << '\n';
else
cout << "Yes" << '\n';
return 0;
} | #include <iostream>
using namespace std;
int main()
{
char a;
cin >> a;
if (a == 'a'){
cout << 'b';
}else if (a == 'b'){
cout << 'c';
}else if (a == 'c'){
cout << 'd';
}else if (a == 'd'){
cout << 'e';
}else if (a == 'e'){
cout << 'f';
}else if (a ... | 0 | 6,977,572 |
#include<bits/stdc++.h>
using namespace std;
const int N=510;
int n,m,d;
const char s[]="RGBY";
int main(){
cin>>n>>m>>d;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;++j){
putchar(s[(N+i+j)/d%2*2+(N+i-j)/d%2]);
}
puts("");
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
vector<int>arr(n);
for(int i=0; i<n; i++) cin>>arr[i];
int total = k;
int mn = total;
for(int i=1; i<n; i++){
mn = min(mn,total-(arr[i]-arr[i-1]));
}
mn = min(mn,total-(k-arr[n-1])-arr[0]);
cout<<mn;
} | 0 | 36,177,306 |
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
ll x, y;
cin >> x >> y;
if (x % y == 0ll) {
cout << -1 << endl;
} else {
for (ll i = 2ll; x * i < 1000000000000000000ll; i++) {
if (x * i % y != 0) {
cout << x * i << endl;
... | #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 | 88,606,302 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.