code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 89,885,220 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string S,T;
cin >> S >> T;
int sl, tl;
sl = (int) S.length();
tl = (int) T.length();
if (sl + 1 != tl) {
cout << "No" << endl;
return 0;
}
for (int i=0; i<sl; i++){
if (S.at(i) != T.at(i)){
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
int count =0;
cin>>s;
string ans="AC";
if(s[0]!='A')
{
ans="WA";
}
int a=s.length();
for(int i=1;i<a;i++)
{
if(isupper(s[i]))
{
if(i==1|| i==a-1||s[i]!='C')
{
... | 0 | 53,964,154 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n) != EOF) {
int cnt = 0;
for (int a = 0; a <= 9; a++) {
for (int b = 0; b <= min(n - a, 9); b++) {
for (int c = 0; c <= min(n - a - b, 9); c++) {
if (0 <= n - a - b - c && n - a - b - c <= 9) cnt++... | #include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int H, W, D; cin >> H >> W >> D;
vector<vector<int>> a(H, vector<int... | 0 | 96,532,198 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
getline(cin, s);
for (int i = 0; i < s.size(); i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
s[i] += 'A' - 'a';
}
else if (s[i] >= 'A' && s[i] <= 'Z') {
s[i] += 'a' - 'A';
}
}
cout << s << endl;
return 0;
} | #include <stdio.h>
int main (){
long long int n;
long long int t=1;
scanf("%lld",&n);
long long int A[n];
for(int i=0; i<n; i++){
scanf("%lld", &A[i]);
}
for(int j=0; j<n; j++){
if(A[j] == 0){
printf("0");
return 0;
}
}
for(int k=0;... | 0 | 61,745,296 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int ans;
if (B <= C || D <= A) ans = 0;
else ans = min(B, D) - max(A, C);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ... | 0 | 84,267,263 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N + 1);
int a;
for(int i = 0; i < N; i++){
cin >> a;
A.at(a)++;
}
int b = 0;
for(int i = 0; i < A.size(); i++){
if(A.at(i) != 0){
b++;
}
}
i... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL 1LL << 40
#define INF 1 << 31
#define MOD 1000000007
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
typedef pair<int, int> P;
typedef vector<i... | 0 | 19,577,658 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int K,A,B;
cin >> K >> A >> B;
for(int i=A;i<B+1;i++){
if(i%K==0){
cout << "OK" << endl;
return 0;
}
}
cout << "NG" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 30,878,057 |
#include<algorithm>
#include<bitset>
#include<climits>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define ep emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v)... | 0 | 46,660,360 |
#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
typedef long long ll;
int main()
{
ll k,x;
scanf("%lld%lld",&k,&x);
if(k*500>=x){
printf("Yes");
}
else{
printf("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
int cnt = 0;
long long sumM = 0;
for (int i = 0; i < N; i++) {
int B;
cin >> B;
A[i] -= B;
if (A[i] < 0) {
sumM +... | 0 | 82,665,112 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int current, target;
cin >> current >> target;
cout << target * 2 - current << endl;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 100100... | 0 | 68,837,867 |
#include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | #include<bits/stdc++.h>
using namespace std;
void c_p_c()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main()
{
int a, b;
cin >> a >> b;
int p = a * b;
if (p & 1)
cout << "Odd";
else
cout <... | 0 | 52,937,112 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,r) for(int i = 0; i < (r); i++)
#define pb push_back
#define ALL(a) a.begin(), a.end()
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define uint unsigned long long
#define endl '\n'
template<typename T> ostream &operato... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#defin... | 0 | 1,993,958 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int c;
string s;
cin>>s;
if(s=="RSR"||s=="RSS"||s=="SSR"||s=="SRS")c=1;
else if(s=="RRR"){c=3;}
else if(s=="SSS"){c=0;}
else c=2;
cout<<c;
return 0;
} | #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 dp[101][4][2];
int main() {
string N;
int K;
cin >> N >> K;
int L = N.size();
dp[0][0][0] = 1;
rep(i, L) rep(j, 4) rep(l, 2) {
int nd = N[i] - '0';
rep(d, ... | 0 | 65,476,401 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N=2e5+9;
const int mod=1e9+7;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int x,y;
cin>>x>>y;
for(int i=0;i<=x;i++){
for(int j=0;j<=x;j++){
... | #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>
#incl... | 0 | 40,018,455 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int l = S.size();
int Ans = 1000;
for ( int i=0; i<=l-3; i++ ) {
int num = ( S[i]-'0' )*100 + ( S[i+1]-'0' )*10 + ( S[i+2]-'0');
Ans = min( Ans, abs( num-753 ) );
}
cout ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 27,034,790 |
#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... | #include<bits/stdc++.h>
using namespace std;
int n;
vector<vector<int>> adj;
vector<pair<int, int>> DP;
const int inf = (int)1e9 + 7;
void dfs(int i, int p)
{
long long n1 = 1, n2 = 1;
for (auto x : adj[i])
{
if (x == p)
continue;
dfs(x, i);
n1 *= (long long) (DP[x].first + DP[x].second);
n2 *= DP[x].fir... | 0 | 17,309,947 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int left = a + b;
int right = c + d;
string lr = "";
if (left > right){
lr = "Left";
} else if (left == right){
lr = "Balanced";
} else {
lr = "Right";
}
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N;
cin >> N;
vector<int> a(N+1,0);
rep(i,N) cin >> a[i];
ll ans = 0;
rep(i,N){
ans += a[i]/2;
a[i] %= 2;
if(a[i] & (a[i + 1]>0)){
... | 0 | 77,021,843 |
#include<iostream>
using namespace std;
int main(){
int n,max=0;
int a[101];
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(max<a[i]-a[j]){max=a[i]-a[j];}
}
}
cout << max;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define il inline
#define INF 0x3f3f3f3f
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define dep(i,a,b) for(int i=(a);i>=(b);--i)
#define pb push_back
const int mod = 1e9 + 7;
const int maxn = 1e3 + 10;
const int maxm = 2e5 +... | 0 | 48,050,912 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) f... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 100100... | 0 | 24,584,310 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int divisors(int n)
{
int ret = 0;
for (int i = 1; i * i <= n; ++i)
{
if (n % i == 0)
{
ret++;
if (n / i != i)
ret++;
}
}
return ret;
}
int ma... | 0 | 81,449,513 |
#include <bits/stdc++.h>
#define endl "\n"
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 fi first
#define se second
#def... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <set>
#include <map>
#define INF 100000
using namespace std;
typedef long long int ll;
int main(){
vector<int> era(10000000,0);
for (... | 0 | 9,255,996 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define gcd __gcd
#define rep(i,s,end) for(int i = (s); i < (end); ++i)
#define rep0(i, end) for(int i = 0; i <= (end); ++i)
#define rep1(i, end) for(int i = 1; i <= (e... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fill(x,v) memset(x,v,sizeof(x))
#define FOR(i,a,b) for(int i = int(a); i < int(b); ++i)
#define trace(x) cout << #x << " = " << x << endl
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define N 100050
using namespace std;
typedef long l... | 0 | 45,298,480 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;cin>>s;
int n = s.size();
sort(s.begin(),s.end());
rep(i,n-1)if(s[i+1]==s[i]){
cout<<"no"<<endl;
return 0;
}
cout<<"yes"<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <fstream>
#include <string>
#include <math.h>
#include <cstdlib>
#include <istream>
#include <sstream>
#include <cctype>
#define fore(i,x,y) for(long long i=x;i<y;i++)
typedef long long ll;
using namespace std;
int main()
... | 0 | 32,208,063 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll x,y;
cin >> x >> y;
if(x*y>0){
if(y>=x) cout << y-x << endl;
else cout << x-y+2 << endl;
}
else if(x*y==0){
if(y<0 || x>0) cout << abs(x+y)+1 << endl;
else cout << abs(x+y) << endl;
... | #include <iostream>
using namespace std;
int main()
{
int x, y;
while (cin>>x>>y) {
if (x==0 && y==0) continue;
if (x > y) {
cout << y << ' ' << x << endl;
} else {
cout << x << ' ' << y << endl;
}
}
return 0;
} | 0 | 23,963,973 |
#include <iostream>
using namespace std;
int main()
{
string x;
while (cin >> x, x != "0") {
int y = 0;
while (!x.empty()) {
y += x[0] - '0';
x = x.substr(1);
}
cout << y << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, mod = 1e9+7;
vector<ll> x, y;
ll f(vector<ll> &v){
int p = v.size()-1;
vector<ll> a(p, 0), b(p, 0);
a[0] = v[0];
b[0] = v[0];
for(int i=1; i<p; ++i){
b[i] = b[i-1] + (i+1)*v[i];
b[i] %= mod;
a[i] = a[i-1] + b[i];
a[i] %= mod;
}
... | 0 | 4,077,676 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <deque>
using namespace std;
int main() {
long long N, P;
string S;
cin >> N >> P;
cin >> S;
long long ans = 0;
if (P == 2) {
for (int i = 0; i < N; i++) {
int s = S[i] - ... | 0 | 48,947,755 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) ... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define all(x) x.begin(),x.end()
#define YES {cout << "YES\n"; return;}
#define NO {cout << "NO\n"; return;}
const int INF=INT_MAX;
const ld PI=ac... | 0 | 52,693,705 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<n; i++)
#define rep2(i, s, n) for (int i=s; i<n; i++)
int main() {
int a,b;
cin >> a >> b;
int cnt = 0;
rep2(i, a, b+1) {
string wk = to_string(i);
if (wk[0]==wk[4] && wk[1]==wk[3]) {
cnt++;
}
}
cout << cnt << e... | #include <iostream>
#include <utility>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
typedef pair<int, int> pii;
const int N_SIZE = 100;
int dp[N_SIZE + 1][N_SIZE + 1];
void solve(int n, pii rc[])
{
REP(i, n)
dp[i][i] = rc[i].first * rc[i].second;
REP(i, n - 1)
dp[i][i + 1] = dp[i][i] ... | 0 | 68,977,540 |
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <deque>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
template<typename T1,typename T2> inline void chmin(T1 ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n;
cin >> n;
vector<queue<char>> s(n);
for(int i = 0; i < n; i++){
string a;
cin >> a;
for(char b : a){
s.at(i).push(b);
}
}
for(int i = 1; i < n; i++){
int t = ... | 0 | 363,627 |
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
#define mod 1000000007
int N,M,ans=0;
pair<int,int>AB[111111];
priority_... | #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+1,0);
rep(i, N){
cin >> a[i];
}
int s = 0;
int ans = 0;
rep(i, N){
if(a[i] == a[i+1]){
... | 0 | 93,388,903 |
#include <stdio.h>
int main(void){
int n;
int i=1;
scanf("%d", &n);
while (n != 0){
printf("Case %d: %d\n", i, n);
scanf("%d", &n);
i++;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int N,K;
cin >> N >> K;
vector<int> A(N+1);
for(int i = 0;i < N;i++) cin >> A[i];
int limit = min(K,100);
for(int i = 0;i < limit;i++) {
vector<int> B(N+1);
for(int j = 0;j < N;j++) {
int l = max(0,j-A[j]);
... | 0 | 38,982,118 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
#define all(a) a.begin(), a.end()
#define mp(a, b) make_pair(a, b)
const int MOD = 1e9+7;
const int INF = 1001001001;
const ll ... | #include <bits/stdc++.h>
#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(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#... | 0 | 55,749,337 |
#include <iostream>
using namespace std;
int main(){
int x=10000;
int input[x];
int temp=1;
int count=0;
while(temp!=0){
cin >> temp;
input[count] = temp;
++count;
}
for(int i; i<count-1; ++i){
cout << "Case " << i+1 << ": " << input[i] << endl;
}
} | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main(){
string s;
cin >> s;
int n;
cin >> n;
string q;
int a, b;
for (int i = 0; i < n; i ++) {
cin >> q >> a >> b;
if (q == "print") {
string t = s.substr(a, b - a + 1);
cout << t << endl;
} else if (q == "rev... | 0 | 57,395,059 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int,int>;
using pq = priority_queue<int>;
typedef long long ll;
int main()
{
int n,a; cin >>n >> a;
if (n % 500 <= a)
cout << "Yes\n";
else
co... | #include<bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define M1 (ll)1000000007
#define M2 (ll)998244353
#define Pi 3.141592653
#define exp 2.71828
#define ll long long
#define ull unsigned long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define di deque... | 0 | 50,268,880 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string str,com,rep;
char work;
int n,a,b;
cin >> str;
cin >> n;
for(int i=0; i<n; ++i){
cin >> com >> a >> b;
if(com == "replace"){
cin >> rep;
for(int k=a; k<=b; ++k){
str[k] = rep[k - a];
}
}else if(com == "reverse"){
... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = m... | 0 | 38,591,277 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& vec) {
for (T& x: ve... | #include<iostream>
using namespace std;
int main(){
char a[1001],b[1001];
long least,var,lena=0,lenb=0,l=1;
cin>>a>>b;
for(;b[lenb];lenb++);
for(;a[lena];lena++);
for(int i=0;i<=lena-lenb;i++){
var=0;
for(int j=0;j<lenb;j++){
if(a[i+... | 0 | 58,261,381 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <bits/stdc++.h>
using namespace std;
long long n;
int x, m;
int next(int a) {
return (long long) a * a % m;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> x >> m;
vector<int> a;
vector<bool> used(m, 0);
int cur = x;
for (; !used[cur]; cur = next(cur)) {
... | 0 | 74,619,819 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
vector<int> par;
vector<ll> dfromp;
ll dfr(int x) {
if (par[x] != x) {
return dfromp[x] + dfr(par[x]);
}
else {
return 0;
}
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
dfromp[x] = ... | #include "bits/stdc++.h"
using namespace std;
char c1[] = { ' ', '.', ',', '!', '?', };
char c2[] = { 'c', 'a', 'b', };
char c3[] = { 'f', 'd', 'e', };
char c4[] = { 'i', 'g', 'h', };
char c5[] = { 'l', 'j', 'k', };
char c6[] = { 'o', 'm', 'n', };
char c7[] = { 's', 'p', 'q', 'r', };
char c8[] = { 'v', 't', 'u', };
cha... | 0 | 43,839,571 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
int t[n],x[n],y[n];
for(int i=0;i<n;i++)cin>>t[i]>>x[i]>>y[i];
for(int i=0;i<n;i++){
int dis,time;
if( i==0 ){
dis = x[i]+y[i];
time = t[i];
}
else{
time = t[i]-t[i-1];
dis = abs(x[i]-x[i-1])+abs(y[i]-y[i-1]);
}
if(dis>ti... | #include <stdio.h>
int main()
{
int h, w, i, j;
while (1) {
scanf("%d %d", &h, &w);
if (h == 0 && w == 0) {
break;
}
else if (h != 0 && w != 0) {
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
if (i != 0 && i != (h-... | 0 | 94,617,449 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<x<<endl
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll inf = 1e18;
const int N = 2e5 + 10;
int main(){
... | 0 | 67,724,332 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define endl '\n'
int t=1;
void solve(){
int n,l;
cin >> n >> l;
for(int i=0;i<=n;i++){
if((l+2*i)==4*n){cout << "Yes" <<endl;return;}
}
cout << "No" <<endl;
}
int32_t main(){
ios_base::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string s;
cin >> s;
if(s.size()<4)cout << "No" << endl;
else{
bool a=true;
if(s.at(0)!=... | 0 | 7,981,311 |
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <queue>
#define MOD (1000000007l)
#define rep(i, n) for(long i = 0; i < n; i++)
using namespace std;
long gcd(long a, long b) {
while... | #include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int pos[(1<<26)+20];
char s[maxn];
int dp[maxn];
int main()
{
scanf("%s",s+1);
int len=strlen(s+1);
memset(pos,-1,sizeof(pos));
for (int i=1;i<=len;i++)dp[i]=len;
pos[0]=0;
int x=0;
for (int i=1;i<=len;i++){
s[i]-='a';
x^=(1<<s[i]);
dp[i]=... | 0 | 33,624,666 |
#include <bits/stdc++.h>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int,int> fd[] = {make_pair(1,0),make_pair(-1,0),make_pair(0,1),make_pair(0,-1)};
si... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | 0 | 99,801,771 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int n;
int c[500]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
int divNum = -1;
for(int i = 0; i < n; i++){
int target = i + 1;
int tmpCnt = 0;
while(target%2==0){
target/=2;
tmpCnt++;
if(target==0)break;
}
... | 0 | 18,305,750 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
int x;
cin >> x;
int div = x / 100;
int rem = x % 100;
bool ok = false;
if (x < 100) ok = false;
else if (rem == 0) ok = true;
else if (x >= div * 100 && x <= div * 105) {
ok = true... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b){if (a>b){a = b; return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if (a<b){a = b; return true;}r... | 0 | 32,761,736 |
#include <bits/stdc++.h>
#define sz(v) (int)v.size()
#define debug(var) cout << #var << ": " << var << endl;
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int h, w, m;
cin >> h >> w >> m;
vector<int> cntrow(h + 1), c... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T;
char c = 'W';
for (int i = 0; i < N * 2; i++){
if (S[i] != c){
T += 'L';
c = 'B' + 'W' - c;
} else {
T += 'R';
c = 'B' + 'W' - c;
}... | 0 | 98,650,305 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No \
cout << "No" << endl; \
return 0;
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
t... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 59,914,517 |
#include <iostream>
int main()
{
unsigned n, x;
while (std::cin >> n >> x, n) {
unsigned count{};
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++) {
for (int k = 1; k < j; k++) {
if (i+j+k == x) {
count++;
break;
}
}
}
}
std::cout << count << std::endl;
}
return... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define Rep(i, a, b) for(ll i = a; i <= b; i++)
#define repr(i, a, b) for(ll i = b-1; i >= a; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
using ll = long long;
#... | 0 | 95,205,268 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
int N; cin>>N;
vector<int> a(N+1,0),ck(N+1,1);
rep(i,N) cin>>a[i+1];
int now=1, count=0;
ck[1]=0;
bool flg = false;
while(ck[a[now]]){
now = a[now];
ck[no... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main()
{
ll n, p;
cin >> n >> p;
string s;
cin >> s;
if (p == 5 || p == 2)
{
ll cnt = 0;
for (ll j = 0; j < s.length(); j++)
{
auto num = s[j] - '0';
if (num % p == 0)
... | 0 | 38,612,926 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<ll> a(N), b(N);
REP(i, N) cin >> a[i];
REP(i, N) c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
using namespace std;
int main() {
int n; cin >> n;
int cur = 1;
int ans = 0;
vector<int> a(n+1);
vector<bool> l(n+1);
rep(i,n) cin >> a[i+1];
rep(i,n) l[i+1] = false;
while(1){
if(l... | 0 | 8,524,921 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a == b && b == c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 17,105,565 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main() {
int N; cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
vector<long long> s(N+1, 0);
map<long long, long long> nums;
for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];
for (int i =... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define show(x) {for(auto i: x){cout << i << " ";} cout<<endl;}
#define showm(m) {for(auto i: m){cout << m.x << " ";} cout<<endl;}
typedef long l... | 0 | 53,054,943 |
#include <iostream>
using namespace std;
int w, h;
char tile[21][21];
const int mx[] = {0, 0, 1, -1};
const int my[] = {1, -1, 0, 0};
int func(int x, int y){
if(x < 0 || x >= w || y < 0 || y >= h || tile[y][x] == '#'){
return 0;
}
int res = 1;
tile[y][x] = '#';
for(int i = 0; i < 4; ++i){
for(int j = 0; j < 4;... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <queue>
#include <map>
#include <fstream>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(x) (x).begin(),(x).end()
#de... | 0 | 20,429,418 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | #include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll mod = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
ll calc(ll n){
for(ll i = 2; ;i++)
if(i*(i+1)/2 > n)
return i-1;
}
void solve(){
ll n;
... | 0 | 52,703,742 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define PRINT(x) cout<<(x)<<endl
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
const int MAX_N = 100;
int n;
int r[MAX... | 0 | 39,817,339 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int min1 = min(a, b);
int min2 = min(c, d);... | #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma warning(disable:4786)
#pragma warning(disable:4996)
#define ll long long
#define ... | 0 | 19,471,064 |
#include<bits/stdc++.h>
using namespace std;
int dp[1002][1002];
int main(){
int T;
cin>>T;
while(T--){
#ifdef LCS
string s;
cin>>s;
int len=s.size();
int *dp=new int[len+1];
dp[0]=1;
int ans=1;
for(int i=1;i<len;i++){
char ch=s[i];... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define fo(i,a,b) ... | 0 | 35,073,480 |
#include <algorithm>
#include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#include <iostream>
#include <vector>
using bint = boost::multiprecision::cpp_int;
template <class T>
void combination(const std::vector<T>& seed, const int& target_size, std::vector<std::vector<int>>& ans)
{
std::vector<int> ind... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define REP(i,a,b) for(int i=(int)(a); i<(int)(b); i++)
#define RREP(i,a,b) for(int i=(int)(a); i>=b; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,n,0)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef lo... | 0 | 51,385,514 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <cassert>
typedef long long ll;
using namespace std;
#define mod 1000000007... | 0 | 64,921,403 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define rrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INFL = 1000000000000000010;
int INF = 2000000000;
ll MOD = 998244353;
int main() {
while(true){
int N,K;
cin >> N >> K;
if(N == 0 && K == 0)break;
vector<int> a(N);
vector<int> wa(N+1);
wa.at(0) ... | 0 | 98,410,291 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(i=l;i<n;i++)
using namespace std;
int main(){
int d,s,i,n;
while(scanf("%d",&d)!=EOF){
s=0;
n=600/d;
rep(i,1,n){
s+=d*i*d*i*d;
}
cout<<s<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define fi first
#define se second
signed main()
{
string S;
bool izryt = false, flag = true;
stack < char > st;
cin.ignore();
while(getline(cin, S), izryt || S != ".") {... | 0 | 11,865,424 |
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
using na... | #include <iostream>
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int debt = 100000;
int n;
std::cin >> n;
for (int i = 0; i < n; ++i) {
debt += debt / 20;
if (debt % 1000 != 0) {
debt += 1000 - (debt % 1000);
}
}
std::cout << debt <<... | 0 | 82,198,405 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
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;... | 0 | 47,108,799 |
#include <iostream>
#include <string>
#include <vector>
#include <stdio.h>
#include <math.h>
const int MOD = 1000000007;
using namespace std;
int main(){
int a,b;
float x;
cin >> a >> b;
x = float(a + b)/2;
cout << ceil(x) << endl;
} | #include <iostream>
using namespace std ;
long long int arr[60] ;
int main()
{
long long int k ;
cin >> k ;
if (k == 0) {
cout << 2 << endl;
cout << 1 << " " << 1;
return 0;
}
for(int i = 0 ; i < 50 ; i++)
arr[i] = i ;
for(int i = 0 ; i < 50 ; i++)
arr[i] ... | 0 | 11,272,738 |
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #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(){
string s;cin>>s;
int cnt=0;
for(char c:s){
cnt+=c-'0';
}
puts(cnt%9==0?"Yes":"No");
} | 0 | 73,620,348 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x, t;
cin >> x >> t;
int ans=x-t;
if(ans<0) cout << 0 << endl;
else cout << ans << endl;
} | #include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<algorithm>
#include<cstring>
using namespace std;
int canReach[2][16001];
bool DP(vector<int> v,int t,int start){
memset(canReach,0,sizeof(canReach));
canReach[0][8000+start]=1;
if(v.size()==0)
retur... | 0 | 7,671,509 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
bool ans = false;
vector<vector<int> > A(3,vector<int>(3));
for (size_t i = 0; i < 3; i++)
{
for (size_t j = 0; j < 3; j++)
{
cin >> A.at(i).at(j);
}
}
int N = 0;
cin >> N;
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define VI vector<int>
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
int n,m;
cin >> n >> m;
vector<vector<... | 0 | 6,635,918 |
#include <bits/stdc++.h>
using namespace std;
priority_queue<int, vector<int>, less<int>> a, b, c, d;
int main() {
int x, y, A, B, C;
cin >> x >> y >> A >> B >> C;
int t;
for (int i = 1; i <= A; i++) {
cin >> t;
a.push(t);
}
for (int i = 1; i <= B; i++) {
cin >> t;
... | #include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
typedef long long ll;
typedef... | 0 | 70,999,047 |
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
#include <cstdint>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Graph =... | #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)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 87,443,425 |
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<queue>
#include<stack>
#include<algorithm>
#include<string>
#include<math.h>
#include <iomanip>
#include <numeric>
#define _USE_MATH_DEFINES
using namespace std;
int main()
{
int n,m;cin>>n>>m;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | 0 | 57,078,573 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(int x,int y){
while(y != 0){
ll tmp = y;
y = x % tmp;
x = tmp;
}
return x;
}
int main(){
ll a,b,g;
cin >> a >> b;
if(a<b){
g = gcd(b,a);
}else{
g = gcd(a,b);
}
cout << a... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#def... | 0 | 46,813,422 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define rrep(i,n) RFOR(i,n,0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >>... | #include <bits/stdc++.h>
using namespace std;
const int x[10] = {-1,2,5,5,4,5,6,3,7,6};
void chmax(int &a, const int &b) { if (a < b) a = b; return; }
int main(){
int n, m; cin >> n >> m;
vector<int> data(m);
for (int i = 0; i < m; i++) cin >> data[i];
sort(data.begin(),data.end(),greater<int>());
v... | 0 | 384,701 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define rpd(i,s,e,d) for(int i=(s);i<(int)(e);i+=(d))
int gcd_all(vi &A){ int g = 0; for(int a:A) g = gcd(g, a); return g; }
int sum_array(vi &C, int start, int end, int step){
int c = 0;
rpd(i, start, end, step) c += C[i];
return c;
}
bool is_pai... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <utility>
using namespace std;
typedef long long signed int ll;
constexpr ll inf = INT64_MAX / 2;
int main() {
in... | 0 | 37,244,194 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(); cout.tie(0)
#define MAXX 1005
int n , k;
string s;
int main()
{
_FastIO;
cin >> n;
cin >> s;
cin >> k;
char c = s[k - 1];
for(int i = 0; i < n;... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cassert>
#include<vector>
#include<queue>
#include<set>
using namespace std;
const int INF = 100000;
const int MAX_N = 50000;
const int MAX_M = 20;
int C[MAX_N + 1];
int T[MAX_M + 1][MAX_... | 0 | 38,827,646 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#d... | #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=... | 0 | 10,685,640 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int y , m , d,n;
void solve(){
bool birthDay = false;
int ans = 0;
int maxDay;
for(int year = 1; year < 1000 ; year++){
for(int month = 1 ; month <= 10 ; month++){
if(year % 3 == 0) maxDay = 20;
els... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, m, n) for (ll(i) = (ll)(m); i < (ll)(n); ++i)
#define REP2(i, m, n) for (ll(i) = (ll)(n)-1; i >= (... | 0 | 10,507,715 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
ll n;
cin >> n;
if(n%2 == 1) {
cout << 0 << endl;
return 0;
}
ll ans = 0;
ll cnt = 10;
while(cnt <= n){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 | 98,552,465 |
#include <iostream>
using namespace std;
int isPrime(int n);
int dp[1000000]={};
int main(){
int n;
for(int i=2;i<=1000000;i++){
if(isPrime(i)) dp[i]=dp[i-1]+1;
else dp[i]=dp[i-1];
}
while(cin >> n){
cout << dp[n]<< endl;
}
}
int isPrime(int n){
for(int i=2;i*i<=n;i++){
if(n%i==0) return... | #include <bits/stdc++.h>
using namespace std;
int main() {
long a, b, m;
cin >> a >> b >> m;
int minrei = 100000;
vector<int> reizoko(a);
for (int i = 0; i < a; i++) {
cin >> reizoko.at(i);
minrei = min(minrei,reizoko.at(i));
}
int minden = 100000;
vector<int> denshi(b);
... | 0 | 92,957,899 |
#include<bits/stdc++.h>
#define pb push_back
#define sz(v) (v).size()
#define all(v) (v).begin(),(v).end()
#define inf 1000000007
#define mod inf
using namespace std;
template <typename T> void chmax(T &x,T y){x=x>y?x:y;return;}
template <typename T> void chmin(T &x,T y){x=x<y?x:y;return;}
typedef long long ll;
typedef... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll =long long;
using namespace std;
using graph=vector<vector<int>>;
using field=vector<string>;
using p =pair<int,int>;
const ll mod=1000000007;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
int main(){
ll n,Y;
cin>>n>>Y;
... | 0 | 14,199,194 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n) ;i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin()... | 0 | 80,267,937 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void solve() {
string s, t;
cin >> s >> t;
sort(all(s));
sort(all(t), greater<char>());
if (s < t) cout << "Yes" << '\n';
else cout << "No" << ... | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define STRMAX 256
int main(void)
{
char str[STRMAX];
char out[STRMAX];
int num;
int num2;
int i,j,k;
while (1) {
memset(str, '\0', sizeof(str));
scanf("%s", str);
if (str[0] == '-') {
break;
}
else {
scanf("%d", &num);
for (i=0; i<n... | 0 | 64,816,219 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef pair<double,double> PD;
typedef priority_queue<P,vector<P>,greater<P> >... | 0 | 37,777,993 |
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
int main(){
int W,H,x0,y0;
char t[20][20];
bool visit[20][20];
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
typedef pair<int,int>P;
queue<P>Q;
while(cin>>W>>H){
if(W==0||H==0)break;
for(int i=0;i<H;++i){
... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 56,697,434 |
#include <iostream>
using namespace std;
int many(int, int);
int main()
{
int a, b, c;
cin >> a;
cin >> b;
while (a != 0 || b != 0) {
c = many(a, b);
cout << c << endl;
cin >> a;
cin >> b;
}
return 0;
}
int many(int x, int y)
{
int n, m, r, p, q = 0;
for (n = 1; n <= x; n++) {
for (m = 1; m <= x; m+... | #include <iostream>
#include <set>
#include <map>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <climits>
#include <math.h>
#include <cassert>
#include <unordered_map>
using namespace std;
#pragma warning(disable ... | 0 | 52,350,145 |
#include<iostream>
#include<string>
#include<cmath>
#include<array>
#include<vector>
#include<numeric>
using ll = long long;
using std::cin;
using std::cout;
using std::endl;
int main(){
ll N;
cin>>N;
cout.precision(20);
std::vector<ll> xs,ys;
ll rN=0;
for(ll i=0;i<N;++i){
ll x,y;
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
bool comp1(pair<pair<int,int>,int>a,pair<pair<int,int>,int>b)
{
return a.first.first<b.first.first;
}
bool comp2(pair<pair<int,int>,int>a,pair<pair<int,int>,int>b)
{
return a.first.second<b.first.second;
}
int parent[100005];
int sz[100005];
int... | 0 | 58,897,905 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int A[2000010];
int C[100010];
int main (){
int n;
cin>>n;
for(int i=0;i<100000;i++) C[i]=0;
for(int i=0;i<n;i++) {
cin>>A[i];
C[A[i]]++;
}
int flag=0;
for(int i=0;i<100000;i++){
for(int j=C[i];j>0;j--) if(flag) {
cout<<" "<... | #include <iostream>
using namespace std;
struct Dice{
int f[7];
int n[100];
int right[7][7] = { {0, 0, 0, 0, 0, 0, 0},
{0, 0, 3, 5, 2, 4, 0},
{0, 4, 0, 1, 6, 0, 3},
{0, 2, 6, 0, 0, 1, 5},
{0, 5, 1, 0, 0, 6, 2},
{0, 3, 0, 6, 1, 0, 4},
{0, 0, 4, 2, 5, 3, 0} };
void move(char dir){
... | 0 | 69,596,505 |
#include <iostream>
using namespace std;
bool uruu(int y) {
return y % 3 == 0;
}
int main() {
int n; cin >> n;
int days[11] = {20, 19, 20, 19, 20, 19, 20, 19, 20, 19};
int Days[11];
for (int i = 0; i < 10; ++i) {
Days[i] = days[i];
}
for (int i = 0; i < 10; ++i) {
days[i+1] += days[i];
}
for (int t = 0; t ... | #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 | 12,303,520 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& opera... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 300005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x) x... | 0 | 64,089,262 |
#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
struct ch {
char num,eng;
};
void bubblesort(struct ch str[], int n);
void selectionsort(struct ch str[], int n);
int main()
{
int n,i,j;
ch str1[100],str2[100];
cin >> n;
for (i = 0; i < n; i++) {
cin >> str1[i].eng >> str1[i].num;
}
f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int Maxn = 5005;
const ll Inf = 1000000000000000000ll;
int n, k;
int P[Maxn];
int C[Maxn];
bool tk[Maxn];
vector <int> seq;
ll res = -Inf;
int main()
{
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &P[i]);
f... | 0 | 87,471,658 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
string s; cin >> s;
for (char i = 'a'; i <= 'z'; ++i)
if (s.find(i) == -1)
{
cout << i << endl;
return 0;
}
cout << "None" << endl;
} | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Graph= vector<vector<ll>>;
struct edge{ll to ; ll cost ;} ;
using graph =vector<vector<edge>> ;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll... | 0 | 55,265,979 |
#include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) \
do { \... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i = 0; i < (ll) n; i++)
#define xrep(i,x,n) for(ll i = (ll) x; i < (ll) n; i++)
#define vl vector<long long>
#define vs vector<string>
int main() {
ll a,b; cin >> a >> b;
ll A = a,B = b;
rep(i,b-1){
A *= 10;
... | 0 | 99,468,054 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
long long gcd(long long a, long long b) {
if ... | #include <queue>
#include <iostream>
#include <algorithm>
#define ll long long
#define INF 100000000000000
using namespace std;
ll *par, *rk;
void init(ll n){
n++;
par = new ll[n];
rk = new ll[n];
for(ll i = 0; i < n; i++){
par[i] = i;
rk[i] = 0;
}
}
ll ufind(ll x){
if(par[x] == x)
return x;
r... | 0 | 99,278,611 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int n;
cin >> n;
vector<int> d(n);
rep(i,n) cin >> d[i];
int ans=0;
for(int i=0; i<n-1; i++){
... | #include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef stack<int> SI;
t... | 0 | 13,017,807 |
#include<string>
#include<iostream>
int main(){
std::string str;
std::cin>>str;
if(str=="abc"||str=="acb"||str=="cab"||str=="bac"||str=="bca"||str=="cba")
std::cout<<"Yes"<<std::endl;
else std::cout<<"No"<<std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes c... | 0 | 39,479,194 |
#include <iostream>
#include <iomanip>
#include <string>
#include <string.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <functional>
#include <random>
#define rep(i, n) for(int i = ... | #include <bits/stdc++.h>
#define int long long
#define Rep(i,a,b) for(ll i = a; i <= b; ++i)
#define rep(i,b) Rep(i,0,b-1)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POS... | 0 | 8,524,570 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main()
{
ll n , gcd , x;
cin >> n;
for(ll i = 0 ; i < n ; i++)
{
cin >> x;
if(!i)
gcd = x;
gcd = __gcd ( x , gcd);
}
cout << gcd << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
long long ans;
cin >> ans;
n--;
while(n--) {
long long x;
cin >> x;
ans = ans / __gcd(x, ans) * x;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solv... | 0 | 21,186,757 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using pll = pair<ll,ll> ;
void mysort(vector<pll> &a){sort(a.begin(),a.end()) ;}
void myrev(vll &a){reverse(a.begin(),a.end()) ;}
int main(){
ll n,k ;
cin >> n >> k ;
ve... | 0 | 11,851,539 |
#include <iostream>
#include <string>
using namespace std;
inline void reverse(char* dst, const char* rbegin, const char* rend) {
int i = 0;
for (const char* p = rbegin; p != rend; --p)
dst[i++] = *p;
dst[i] = '\0';
}
int main() {
string str;
int q;
cin >> str;
cin >> q;
string op;
int a;
int b;... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Tree{
private:
struct Element{
int point;
int rank;
};
vector<Element> Content;
public:
Tree(int contentsnum);
int FindSet(int x);
void Link(int x, int y);
void Unite(int x ,int y);
bool Same(int x, int y);
};
Tree::Tree(i... | 0 | 95,326,379 |
#include <iostream>
#include <iomanip>
#include <math.h>
#include <fstream>
#include <string>
#include <time.h>
#include <ctime>
#include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <stack>
#include <queue>
#include <cstdlib>
using namespace std;
void tra... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N, M, ... | 0 | 36,909,254 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
using namespace std;
#define rep(i, s, n) for(int i = s; i < n; i++)
int main() {
string s, t;
cin >> s >> t;
int dp[s.size()+1][t.size()+1];
rep(i, 0, s.size()+1) {
dp[i][0] = i;
}
rep(i, 0, t... | #include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
#define MAX 10000100
LL pow(LL x, LL n){
LL ans = 1;
while(n>0){
if((n&1)==1){
ans = ans * x;
}
x = x * x;
n >>= 1;
}
return ans;
}
int main() {
LL n;
... | 0 | 63,616,213 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.