code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include<iostream>
#include<cstring>
using namespace std;
bool a[10000000];
int main()
{
int n;
while(cin>>n)
{
int js=0;
for (int i=2;i<=n;i++)
if (!a[i]) {js++;for (int j=i+i;j<=n;j+=i) a[j]=true;}
cout<<js<<endl;
}
} | #include <bits/stdc++.h>
#define ll long long
#define ulli unsigned long long int
#define ld long double
#define endl "\n"
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v(n);
for (int& x: v) {
cin >> x;
}
sort(v.begin(), v.end());
int ans = v[n/2] - v[n/2 - 1];
... | 0 | 99,326,249 |
#include <iostream>
#include <algorithm>
#include <vector>
template <typename Iterator>
auto findMaximumSum (Iterator begin , Iterator end) -> long long
{
long long res = * begin;
auto tmp = res;
for (auto ite = begin + 1; ite != end; ++ ite)
{
tmp += * ite;
res = std::max (res , tmp);
... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 0 | 23,631,230 |
#include <iostream>
using namespace std;
int main(){
int n;
while(~scanf("%d",&n)){
int res = 0;
for(int a=0;a<=9;a++)
for(int b=0;b<=9;b++)
for(int c=0;c<=9;c++)
for(int d=0;d<=9;d++)
if(a+b+c+d == n) res++;
printf("%d\n",res);
}
} | #include <iostream>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0)break;
n = 1000 - n;
int ans=0;
if(n >= 500){
n -= 500;
ans++;
}
while(n >= 100){
n-=100;
ans++;
}
if(n >= 50){
n-=50;
ans++;
}
while(n >= 10){
... | 0 | 47,329,576 |
#include<stdio.h>
#include<algorithm>
using namespace std;
int a[200000];
int main()
{
int i,n,flag=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
flag=1;
break;
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
pri... | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
int n;
V<int> a;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
a = V<int>(... | 0 | 100,497,264 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 6,799,934 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#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 S, T;
cin >> S >> T;
int ans = 0;
rep(i,3) {
if (S... | #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... | 0 | 27,338,803 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin >> x;
cout << x*800-x/15*200;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define INF 1007654321
#define PI 3.14159265358979
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repp(i, s, e) for(int i = (s); i <= (e); ++i)
#define sz(x) ((int)x.size())
#define all(x) x.... | 0 | 10,430,523 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> C(n - 1), S(n - 1), F(n - 1);
rep(i, n - 1) {
cin >> C[i] >> S[i] >> F[i];
}
rep(i, n - 1) {
int ans = 0;
ans... | 0 | 47,876,401 |
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<cctype>
using namespace std;
int main(){
string card;int h,m;
string a,b;
while(true){
cin>>card;
if(card=="-")break;
cin>>m;
for(int i=0;i<m;i++){
cin>>h;
a=card.substr(0,h);
b=card.substr(h,card.size... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<long long> V(N);
for(int i=0; i<N; i++) cin >> V[i];
int ans=0;
for(int i=0; i<=K; i++){
for(int j=0; j<=K-i; j++){
if(i+j>N) continue;
vector<long long> S;
int res=0;
for(int k=0; k<i; k++){... | 0 | 45,127,103 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | 0 | 41,393,990 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
vector<ll> h(n);
for (ll i = 0; i < n; i++)
{
cin >> h[i];
}
ll ans = 0;
ll buf = 0;
for (ll i = 0; i < n - 1; i++)
{
if (h[i] >= h[i + 1])
{
buf++;
ans = max(ans, buf);
}
... | #include <bits/stdc++.h>
int main() {
int first[3][10];
int second[3][10];
int thired[3][10];
int force[3][10];
for(int tk = 0; tk < 3; ++tk) {
for(int num = 0;num < 10; ++num) {
first[tk][num] = 0;
second[tk][num] = 0;
thired[tk][num] = 0;
force[tk][num] = 0;
}
}
int n;
... | 0 | 26,487,348 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <math.h>
#include <queue>
using namespace std;
typedef long long int lli;
const long long int MaxN=300005;
const lli mod=1e9+7;
#define fst first
#define snd second
#define mp make_pair
const float pi=3.... | #pragma region header
#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>
#inc... | 0 | 52,208,935 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
const int N = 300030;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
const ll mod = 1e9+7;
int a[5];
... | #include "bits/stdc++.h"
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(X) X.begin(), X.end()
#define sz(X) (int)X.size()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
i... | 0 | 10,718,976 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define All(V) V.begin(), V.end()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
int n; cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(All(v), greater<int... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).ren... | 0 | 21,807,793 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
unordered_map<ll,int> m... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
map<int,int> b;
map<int,bool> f;
int m=0;
for(int _=0;_<n;_++){
int a;
cin>>a;
b[a]++;
f[a]=1;
m=max(a,m);
}
for(auto a:b){
if(a.second>1)
f[a.first]=0;
for(int i=2;a.first*i<=m;i++)
if(b.coun... | 0 | 10,519,849 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<string> a(H);
for (int i = 0; i < H; i++) {
cin >> a.at(i);
}
for (int i = 0; i < H; i++) {
int j = 0;
while (j < W && (a.at(i).at(j) == '.' || a.at(i).at(j) == ' ')) {
j++;
}
if (j == W) {
... | #include <iostream>
#include <cctype>
using namespace std;
char const ch[4] = {'m', 'c', 'x', 'i'};
int const d[4] = {1000, 100, 10, 1};
int sptoi(char*s)
{
int num = 1, ans = 0;
while(*s) {
for (int i = 0; i < 4; i++)
if (*s == ch[i])
ans += d[i] * num;
if (isdigit(*s))
num = *s - '0';
... | 0 | 57,139,420 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORTASC(c) sort(... | #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.at(i);
}
int min = *min_element(A.begin(), A.end());
int max = *max_element(A.begin(), A.end());
int a = 0;
while (min != max)
{
... | 0 | 25,728,413 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s,t;
cin >> s >> t;
for(int i=0;i<=n;i++){
if(s.substr(i,s.size())==t.substr(0,t.size()-i)){
cout << n+i;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int dp[105][4][2];
int main(){
string s;
int k;
cin >> s >> k;
int n = s.size();
dp[0][0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < 4; j++){
for(int m = 0; m < 2; m++){
for(int d = 0;... | 0 | 38,877,586 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string A;
cin >> A;
reverse(A.begin(),A.end());
cout << A <<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<typename T, size_t size> ostream& operator<<(ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os << "[ "; for... | 0 | 23,027,269 |
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
using namespace std;
const int kInf = 1e9+19;
void Solve() {
string s;
cin >> s;
int n = s.length();
unordered_map<int, vector<int>> edges;
vector<int> pref(n + 1);
queue<int> Q;
vector<int> d(n + 1, kInf);
pref[0] = 0;
for (int i ... | #include <iostream>
#include <string>
using namespace std;
int main(void){
int N;
cin >> N;
if(N / 100 == 1){
cout << 9;
}
else{
cout << 1;
}
if((N % 100) / 10 == 1){
cout << 9;
}
else{
cout << 1;
}
if(N % 10 == 1){
cout << 9 << endl;
... | 0 | 65,281,098 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
ll A, B;
scanf("%lld %lld", &A, &B);
ll val;
ll start... | #include <bits/stdc++.h>
using namespace std;
#pragma region
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {c... | 0 | 9,813,769 |
#include<iostream>
using namespace std;main(){int a,b,c,d=0;cin>>a>>b>>c;while(a<=b){if(c%(a++)==0)d++;}cout<<d<<endl;} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans[100009];
struct ss
{
ll v;
ll pos;
}a[100009];
const bool com(const ss &a,const ss&b)
{
if(a.v>b.v)return 1;
else if(a.v==b.v)
{
return a.pos<b.pos;
}
return 0;
}
int main()
{
ll n;
scanf("%lld",&n);
... | 0 | 81,598,115 |
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define E "\n"
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, X, Y, x, y, cur, dat[2000][2];
vector<string> ans;
vector<char> apd;
bool ck(int u, int v, int d)
{
if (abs(u) + abs(v) <=... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <math.h>
#include <iomanip>
#include <string.h>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"... | 0 | 66,842,441 |
#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;
#define SIZE 200005
int N,M;
bool check[SIZE];
int main(){
scanf("%d %d",&N,&M);
for(int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int n;
typedef vector<int> vi;
typedef vector<vi> vii;
#define rep(i, k, n) for (int i = k; i < (int)(n); i++)
int main()
{
cin >> n;
vii hs(n, vi(3));
rep(i, 0, n)
{
cin >> hs[i][0] >> hs[i][1] >> hs[i][2];
}
vii dp(n, vi(3));
dp[0][0] =... | 0 | 32,880,120 |
#include <algorithm>
#include <vector>
#include <string>
#include <ctype.h>
#include <set>
#include <map>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<time.h>
#include<string>
#include<stack>
#include<cmath>
#include<iostream>
#include<cstring>
#include<complex>
#include<bitset>
#include <climits>
#inclu... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#inc... | 0 | 34,322,500 |
# include <bits/stdc++.h>
# define long long long
# define all(vc) vc.begin(),vc.end()
# define allr(vc) vc.rbegin(),vc.rend()
# define pb push_back
# define fi first
# define se second
# define pi pair <long, long>
# define lcm(a, b) (a *... | #include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" << ... | 0 | 57,545,278 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(T& a, T b){if(a>b){a = b;... | 0 | 84,629,498 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define PP pair<int,pair<int,int>>
const int MAX = 1000001;
const int MOD =1000000007;
const int INV2 = (MOD+1)/2;
signed main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
int a[n],b[m];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<m;i++)ci... | #include <iostream>
int main()
{
int a, b, c, d;
std::cin >> a >> b >> c;
if (a >= b) {
d = a;
a = b;
b = d;
}
if (b >= c) {
d = b;
b = c;
c = d;
}
if (a >= b) {
d = a;
a = b;
b = d;
}
std::cout << a << " " << b ... | 0 | 95,774,319 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(false); cin.tie(NULL)
#define testcases freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
#define ui unsigned int
#define ll long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<ll>
#define... | #include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
int main() {
int n;
ostringstream os;
cin >> n;
set<string> dict;
REP(i, ... | 0 | 97,246,052 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,k;
cin >> a >> b >> k;
int x = __gcd(a,b);
for(int i=x; i>=1; i--){
if(x%i==0){
k--;
if(k==0){
cout << i << endl;
}
}
}
return 0;
} | 0 | 49,486,129 |
#include <iostream>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<long long int,long long int>,null_type,less... | #include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
const char* col = "RYGB";
int main()
{
int h, w, d;
cin >> h >> w >> d;
vector<string> bd(h, string(w, '.'));
if (d % 2 == 1) {
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
... | 0 | 69,339,344 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a == b)
{
if( b == c)
{
cout << "Yes";
}
else
cout << "No";
}
else
cout << "No";
} | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,0,n+1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int INF=1e18;
int N,P;
int powMOD(int x,int r,int MOD){
if(r==0)retu... | 0 | 5,112,337 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s, t; cin >> s >> t;
int ans = 0;
for (int i = 0; i < s.size(); i++) if (s[i] != t[i]) ans++;
cout << ans << '\n';
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#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(v) v.begin(), v.end()
typedef long long ll;
const ll inf = 1e11;
int main(){
ll n,m; cin >> n >> m;
vector<ll> a(m);
rep(i,m) cin >> a[i];
sort(a.rbegin(), a.r... | 0 | 63,333,699 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
int main()
{
ios::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#d... | 0 | 100,596,588 |
#include <bits/stdc++.h>
using namespace std;
#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 EACH(i,a,b) for (int i=(a) ;i<=(b);i++)
#define ALL(a) ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using p = pair<int,int>;
static const long long INF = 1000000007;
int main(){
long long min = INF;
int ans = 0;
int n;
cin >> n;
vector<int> vec(n);
rep(i,n) cin >> vec[i];
rep(... | 0 | 93,280,641 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, x;
cin >> a >> b >> x;
if(a + b < x || x < a)cout << "NO" << endl;
else cout << "YES" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
int N;
cin >> N;
vector<int> A_m,A_p;
rep(i,N){
int A;
cin >> A;
if(A>=0) A_p.push_back(A);
else A_m... | 0 | 47,291,694 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
int n, i, j;
string s;
bool checker = true;
cin >> n >> s;
if(n % 2) {
cout << "No" << '\n';
return 0;
}
for(i = 0, j = n / 2; i < n / 2; i++, j++) {
if(s[i] != s[j]) {
... | #include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1e5+5;
int n,rk,L,T;
int pos[maxn];
int read() {
int x=0,f=1;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')f=-1;
for(;ch>='0'&&ch<='9';ch=getchar())x=x*10+ch-'0';
return x*f;
}
int main() {
n=read(),L=read(),... | 0 | 30,255,271 |
#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;
int main() {
int N;
cin >> N;
vector<int>H(N);
rep(i, 0, N){
cin >> H[i];
}
ll ans = 0;
ll preN = 0;
... | #include <bits/stdc++.h>
#define rep(i, n, s) for (int i = 0; i < n; i += s)
#define graph map<int, vector<int>>
#define field vector<vector<int>>
using namespace std;
typedef long long ll;
int dfs(vector<bool> &seen, graph &G, int &v, int &cnt, vector<ll> &point, vector<ll> &ans)
{
seen[v] = true;
cnt += point[v]... | 0 | 5,816,958 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); i++)
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
ll gcd(ll a, ll b){ if(b==0){ return a; } return ... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
const int M=1005;
char ti[M][M];
int isu[M][M];
int n,m,nn;
int dx[]={0,0,-1,1};
int dy[]={-1,1,0,0};
queue<int> qu;
void init_bfs()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(ti[i][j]=='S')
... | 0 | 86,429,969 |
#include<bits/stdc++.h>
using namespace std;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort(ALL(V))
vector<string> split(string,string);
int main()
{
char s,r;
cin >> s >> r;
if(s == r)
{
... | #include <iostream>
using namespace std;
bool ok(int n) {
int a = n % 10;
n /= 10;
int b = n % 10;
n /= 10;
int c = n % 10;
return (a == b && b == c);
}
int main(void) {
int N;cin>>N;
for (int i = N; i <= 999; i++) {
if (ok(i)) {
cout << i << endl;
break;
... | 0 | 29,243,852 |
#include <algorithm>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <ctype.h>
#include <climits>
#include <queue>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
templat... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 0 | 58,651,504 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll i... | #include<bits/stdc++.h>
using namespace std;
#define ms(x,y) memset(x, y, sizeof(x))
#define lowbit(x) ((x)&(-x))
#define sqr(x) ((x)*(x))
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void run_case() {
int n, m;
cin >> n >> m;
priority_queue<int> q;
for(int i = 0; i < n; ++i... | 0 | 4,558,698 |
#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 erep(i, n) for (int i = 0; i <= (n); i++)
#define erep1(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
using ll = long long;
int main() {
int x, n;
cin >> x >> n;
vect... | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
#define allR(v) v.rbegin(), v.rend()
#define PRINT(v) for (auto x : (v)) cout <<x <<" " ; cout <<endl;
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
typedef pair<int,int> Pi;
const... | 0 | 12,815,133 |
#include<iostream>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
bool dp1[17000][4001];
bool ch1[17000][4001];
bool dp2[17000][4001];
bool ch2[17000][4001];
vector<int> vt;
int n, m;
bool func1(int ch, int x)
{
if (x*2 >= vt.size())
{
if (ch == n) {
return 1;
}
... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string ans = "";
for(char c:s){
if(c == '1') ans.push_back('1');
if(c == '0') ans.push_back('0');
if(c == 'B'){
if(ans != "") ans.pop_back();
}
}
cout << ans << endl;
} | 0 | 86,612,715 |
#include <bits/stdc++.h>
using namespace std;
#define print cout <<
int main(){
string N;
cin >> N;
int sum = 0;
for(auto s : N){
int num = (int)(s - '0');
sum += num;
}
if(sum%9==0){
print "Yes" << endl;
}else{
print "No" << endl;
}
} | #include "bits/stdc++.h"
using namespace std;
#define all(v) (v).begin(), (v).end()
#define io ios::sync_with_stdio(0)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rson rt << 1 | 1, mid + 1, r
#define lson rt << 1, l, mid
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#d... | 0 | 78,453,069 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
using Graph = vector<vector<int>>;
int main() {
int a, b;
cin >> a >> b;
int num_min = min(a, b);
int num_max = max(a, b);
rep (i, num_max) ... | #include<cstdio>
#include<cstring>
using namespace std;
#define M 1000000
#define L 12
char H[M][L];
int getChar(char ch){
if(ch=='A') return 1;
else if(ch=='C') return 2;
else if(ch=='G') return 3;
else if(ch=='T') return 4;
else return 0;
}
int getKey(char str[]){
int sum = 0, p=1, i;
for(i=0;i<strlen(str);... | 0 | 8,339,219 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if(s.size() < 4) cout << "No" << endl;
else if(s.substr(0, 4) == "YAKI") cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <climits>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <tuple>
#define ll long long
#define rep(i,s,n) for(ll i = (ll)(s); i < (ll)(n); i++)
#define all(a) (a).begin(),a.... | 0 | 68,671,233 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, double> M;
bool compare_by_b(pair<int, double> a, pair<int, double> b) {
if(a.second != b.second){
return a.second < b.second;
}else{
return a.first < b.first;
... | 0 | 59,896,217 |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, H, W;
cin >> N >> H >> W;
int ans = 0;
for (int i = 0; i < N; ++i) {
int x, y;
cin >> x >> y;
if ((x >= H) && (y >= W)) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long ... | 0 | 12,953,033 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define re... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef p... | 0 | 88,740,483 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
using ll=long long;
const int MOD=1e9+7;
const double pi=3.14159265358979323846;
const int inf=2e9;
const ll INF=1e18;
using P=pair<int,int>;
int dx[4]={1,0,-1,0},dy... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define VDEL(v, n) v.erase(v.begin() + (n))
#define ALL(v) v.begin(), v.end()
#define INTMAX 2147483647
#define INF 200000000
#define TINT(str) atoi(str... | 0 | 46,624,693 |
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<fstream>
#include<string>
#include<sstream>
#include<iomanip>
#include<numeric>
#include<cctype>
#include<random>
#include<bitset>
using nam... | #include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
... | 0 | 4,219,338 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s; i<n; ++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
string s = "RGBY";
int main(){
int h, w, d;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | 0 | 28,034,003 |
#include <iostream>
#include <bitset>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
#include <regex>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
vector<string> dfs(string s, ll depth, vector<char> symbol)
{
... | #include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
vector<string> button = {".,!?@",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"};
int main... | 0 | 89,417,500 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
void solve(){
string s;
cin>>s;
if(s.substr(0,4)=="YAKI")cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
signed main(){
solve();
} | #include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
double ax,ay,bx,by,cx,cy,dx,dy;
int n;
cin>>n;
while(cin>>ax>>ay>>bx>>by>>cx>>cy>>dx>>dy){
if((ax-bx)==0&&(cx-dx)==0){
cout<<"YES"<<endl;
}else if((... | 0 | 53,930,529 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include <bits/stdc++.h>
using namespace std;
bool desc(int a,int b){
return a>b;
}
int main(){
int n;
cin>>n;
int a[n],b[n],d1=0,d2=0;
string aa,bb,df;
for(int i = 1 ; i <= n ; i++){
df+=i+'0';
}
for(int i = 0 ; i < n ; i++){
cin>>a[i]... | 0 | 45,510,170 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f
using namespace std;
queue... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef pair<int, int> P;
typedef pair<long long, long long> LLP;
typedef long long ll;
int main() {
int N, K;
cin... | 0 | 16,947,037 |
#include<iostream>
#include<vector>
using namespace std;
int main(void){
int n,v[50];
cin>>n;
if(n == 0 || n == 1){
cout<<1<<endl;
}else{
v[0] = v[1] = 1;
for(int i = 2 ; i <= n ; i ++){
v[i] = v[i-1] + v[i-2];
}
cout<<v[n]<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vect... | 0 | 95,043,774 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #include<iostream>
using namespace std;
using P = pair<int, int>;
int map[22][22];
P dirs[] = {P(1, 0), P(-1, 0), P(0, 1), P(0, -1)};
int dfs(int h, int w) {
if (!map[h][w]) return 0;
map[h][w] = 0;
int ans = 0;
for (P dir : dirs) {
ans += dfs(h + dir.first, w + dir.second);
}
return ans... | 0 | 11,451,484 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<string> w;
int n;
cin >> n;
string prev;
cin >> prev;
w.push_back(prev);
for (size_t i = 0; i < n - 1; i++)
{
string s;
cin >> s;
if (s[0] != prev[prev.length() - 1])
{
cout << "... | #include <stdio.h>
int main(){
int n,k,a[1000000],top,sum;
while(1){
scanf("%d%d",&n,&k);
if(n==0)return 0;
sum=0;
for(int i=0;i<k;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
top=sum;
for(int i=k;i<n;i++){
scanf("%d",&a[i]);
... | 0 | 55,373,742 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 100100
lli n, k;
int main(void){
cin >> n >> k;
vector<lli> a(N);
rep(i, n){
lli ai, bi;
cin >> ai >> bi;
a[ai]+=bi;
}
lli s = 0;
for(int i = 1; i <= N; i++){
s+=a[i];
if(s >= k){
cout ... | #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
i... | 0 | 65,595,410 |
#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 <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,i,j,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#defin... | 0 | 49,212,135 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VE... | #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,M,X;
cin>>N>>M>>X;
int C[N],A[N][M];
rep(i,N){
cin>>C[i];
rep(j,M){
cin>>A[i][j];
}
}
int ans=100000000;
rep(bit,(1<<N)){
i... | 0 | 89,045,785 |
#include<bits/stdc++.h>
#define INF 9223372036854775807LL
#define inf 1000000007
#define SYOU(x) setprecision(x+1)
#define abs(x,y) (max(x,y)-min(x,y))
#define lol long long
#define mp make_pair
#define fi first
#define se second
using namespace std;
lol a,b,c,d;
signed main(){
cin.tie(0);
ios::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s1, s2;
cin >> s1 >> s2;
int size1 = s1.size();
int size2 = s2.size();
int d[size1 + 1][size2 + 1];
for(int i = 0; i <= size1; ++i) {
d[i][0] = i;
}
for(int i = 0; i <= size2; ++i) {
d[0][i] = i;
}
... | 0 | 91,398,336 |
#include <iostream>
using namespace std;
int main(){
string s;
int w;
cin >> s >> w;
string ans = "";
for(size_t i = 0; i < s.length(); i += w){
ans += s[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
using namespace std;
#define int long long
using ll = long long;
const int MX = 1e6;
const ll inf =... | 0 | 89,359,019 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <stack>
#include <bitset>
#include <map>
#include <cmath>
#include <climits>
#include <queue>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k, d,... | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
ll int MOD=998244353;
#define N 3000000
using... | 0 | 91,636,589 |
#include <bits/stdc++.h>
#define ll long long int
#define inv(name,Type,size) vector<Type> name(size);for(int index=0;index<n;index++) cin>>name[index];
#define F(a,n,i) for(int i=a;i<n;i++)
#define pb push_back
#define endl "\n"
#define mod 10000000007
#define modpro 99824435
using namespace std;
void solve(){
int n;... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n;
long long sum = 0, min, max, a;
scanf("%d", &n);
for(int i = 0; i < n; ++i){
cin >> a;
if(i == 0){
max = a;
min = a;
}
if(max < a){
max = a;
} el... | 0 | 55,926,774 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define scl(n) scanf("%lld", &n)
#define pcl(n) printf("%lld\n", n)
#define pcl1(n) printf("%lld ", n)
#define nln pr... | 0 | 54,215,408 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long int;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MOD = 1000000007;
const int MOD1 = 998244353;
const int maxn = 100010;
const int lim = (int)1e9;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N; cin>>N;
if(N%2==1){
cout<<0<<endl;
}else{
ll cnt=0;
ll t=N;
while(t!=0){
t/=5;
cnt+=(t/2);
}
cout<<cnt<<endl;
}
} | 0 | 86,623,412 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
using namespace std;
int main(){
int a[5];
for(int i=0 ; i<5 ; i++){
cin >> a[i];
}
for(int i=0 ; i<5 ; i++){
for(int j=i; j<5 ; j++){
if(a[i] < a[j] ){
int temp;
t... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<(r);i++)
#define pb push_back
#define fi first
#define se second
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x... | 0 | 7,726,474 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << " : " << (x) << std::endl;
int ma... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 1000000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
typedef int64_t ll;
template<class T> inline bool chmax(T & a, T b) { if (a ... | 0 | 28,835,083 |
#include <stdio.h>
int main(){
char huruf;
scanf("%c",&huruf);
if (huruf >=65 && huruf <=90){
printf("A\n");
}
else{
printf("a");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
int main(){
int n, d, x;
cin >> n >> d >> x;
int cnt = 0;
for(int i = 0; i < n; i++){
int a;
cin >> a;
... | 0 | 35,112,873 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <cstdlib>
#include <typeinfo>
using namespace std;
const int SUP = -1;
typedef pair<int, int> P;
const int MAX_H = 1000;
const int MAX_W = 1000;
char field[MAX_H][MAX_W + 1];
int d[MAX_H][MAX_W];
int H, W, N;
int sx, ... | #include<bits/stdc++.h>
#define Fst first
#define Snd second
#define RG register
#define mp make_pair
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long LL;
typedef long double LD;
typedef unsigned int UI;
typedef unsigned long long ULL;
template<typename T> inline void read(T& x) {
char c =... | 0 | 64,495,733 |
#include <iostream>
#include <string>
#include <stack>
#include <map>
using namespace std;
int main() {
map<char,char> close_of;
close_of['('] = ')';
close_of['['] = ']';
while(true) {
string line;
getline(cin, line);
if(line == ".") break;
bool ok = true;
stack<c... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxc 1000000007
#define maxn 100005
#define maxm 1000006
#define pii pair <int,int>
#define Task ""
tem... | 0 | 23,908,092 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, x, ans;
cin >> n >> x;
ans = n;
function<void(ll, ll)> solve = [&](ll x, ll y) {
ans += 2LL * (y/x) * x;
if( !(y % x)) {
ans -= x;
} else {
... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
using ll = long long;
inline ll cntSeq(string s) {
ll cnt = 0;
ll num = 0;
REP(i, s.size() - 1) {
if (s[i] == s[i + 1]) cnt++;
else {
if (cnt > 0) {
cnt++;
... | 0 | 86,825,234 |
#include <cstdio>
#include <iostream>
using namespace std;
int a, b;
int main(){
cin >> a >> b;
printf("%d %d %.5f\n", a/b, a%b, (double)a/(double)b);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | 0 | 42,928,896 |
#include <bits/stdc++.h>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
s... | #include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<string>
struct Node {
Node* prev;
Node* next;
long long value;
};
Node* nil;
void init() {
nil = (Node*) malloc(sizeof(Node));
nil->prev = nil;
nil->next = nil;
}
void insertNode (long long value) {
Node* n = (Node*) malloc(siz... | 0 | 61,561,386 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
while(true) {
ll n, m; cin >> n >> m;
if (n == 0 && m == 0) break;
vector<pair<ll, ll>> roads;
for(ll i = 0; i < n; i++) {
int d, p; cin >... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define trav(a, x) for (auto& a : x)... | 0 | 12,733,294 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <climits>
int main()
{
long N,M;
std::cin >> N >> M;
if(N>M/2){
std::cout << M/2 << std::endl;
}else{
std::cout << N+(M-2*N)/4 << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int... | 0 | 78,469,490 |
#include <iostream>
using namespace std;
int main (){
int Info1,Math1,Science1,English1,Info2,Math2,Science2,English2,S,T;
cin>>Info1>>Math1>>Science1>>English1;
S=Info1+Math1+Science1+English1;
cin>>Info2>>Math2>>Science2>>English2;
T=Info2+Math2+Science2+English2;
if(S>=T){
cout<<S<<endl;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> II;
typedef vector< II > VII;
typedef vector<int> VI;
typedef vector< VI > VVI;
typedef long long int LL;
typedef vector<LL> VL;
typedef unsigned long long int ULL;
#define PB push_back
#define MP make_pair
#define F first
#define S seco... | 0 | 35,752,321 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void solve() {
int a, b, c, k;
cin >> a >> b >> c >> k;
int tmp = min(a, k);
int ans = tmp;
k -= tmp;
if(!k) drop(ans);
tmp = min(b, k);
k -= tmp;
if(!k) drop(ans);
tmp = min(c, k);
ans... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
string S;
cin>>S;
int length = S.length();
int tmp = 0;
for(int i=0;i<length;i++){
int a = S.at(i) - '0';
tmp += a;
tmp = tmp%9;
}
if(tmp == 0){
cout<<"Yes"<<endl;
}
else{
... | 0 | 89,478,190 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 222;
int n, m;
char a[200][200];
int s[200][200];
int get(int xa, int ya, int xb, int yb) {
int sum = s[xb][yb];
sum -= s[xa - 1][yb];
sum -= s[xb][ya- 1];
sum += s[xa - 1][ya - 1];
return sum;
}
int dp[200][200];
int main () { ... | 0 | 42,831,392 |
#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 S;
cin >> S;
string ans = "No";
if (S == "abc" || S == "acb" || S == "bca" || S == "bac" || S == "cab" || S == "cba") ans ="Yes";
cout << ans << endl;
ret... | #include<iostream>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
using ll = long long int;
int n;
ll k;
vector<ll> A;
vector<ll> S;
int main(){
cin >> n >> k;
A.resize(n+3);
for(int i = 1; i <= n; i++){
cin >> A[i];
A[i] %= k;
}
S.resize(n+3);
S[0] = 0;
... | 0 | 20,559,452 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define int long long i... | 0 | 86,812,454 |
#include <cstdio>
#include <vector>
#define MAX 10
using namespace std;
vector<int> sort(vector<int> &array);
int main(){
vector<int> array;
int n;
for(int i = 0; i < MAX; i++){
scanf("%d", &n);
array.push_back(n);
}
sort(array);
for(int i = 0; i < 3; i++){
printf("%d\n", array[i]);
}
return 0;
}
vector<i... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<ll,ll>>>;
#define rep(i,n) for (int i... | 0 | 37,302,429 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin >> n >> a >> b;
long int sum;
long int ans=0;
int num;
for(int i=1; i<=n; i++){
sum=0;
num=i;
for(int j=0; j<5; j++){
sum+=num%10;
num/=10;
}
if(a<=sum && sum<... | 0 | 48,171,982 |
#include <iostream>
class UnionFindTree {
int *parents;
int *ranks;
public:
UnionFindTree(int n) {
parents = new int[n];
ranks = new int[n];
for (int i = 0; i < n; i++) {
parents[i] = i;
ranks[i] = 0;
}
}
... | #include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=500000004;
con... | 0 | 92,132,240 |
#include <bits/stdc++.h>
using namespace std;
int n, a[201], ans;
int main() {
scanf("%d", &n); n <<= 1;
for(int i = 1;i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
for(int i = 1;i <= n; i += 2)
ans += a[i];
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 26,770,029 |
#include <bits/stdc++.h>
#define pragma
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define aisort sort(a,a+n)
#define adsort sort(a,a+n,greater<ll>())
#define PI 2 * acos(0)
typedef pair<ll, ll> pii;
typedef pair<ll, pii> piii;
typedef vector<ll> vi;
type... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 0 | 10,034,552 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> pii;
namespace IO{
template<typename T>inline void read(T &x){
x=0;ll f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | 0 | 70,025,677 |
#include<bits/stdc++.h>
using namespace std;
void func(int nn,int mm);
int n,s;
int box[10];
int sum,cnt;
int main(void){
int i;
for(i=0;i<=9;i++) box[i]=i;
while(1){
cin>>n>>s;
if(n==0&&s==0) break;
sum=0;
cnt=0;
func(0,0);
cout<<cnt<<endl;
}
return 0;
}
void func(int nn,int mm){
int i;
if(mm==n){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
if (b==0) return a;
else{
return gcd(b,a%b);
}
}
int main() {
ll a,b,c;
cin >> a >> b >> c;
if(0< -b+c && -b+c <= a){
cout << "safe" << endl;
}
else if(a+b>c){
cout << "delicious" << endl;
... | 0 | 56,711,322 |
#include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
char now;
bool ok = false;
map<string, int> a;
... | #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;
for(int i = 0; i < N-1; i++) {
if(a[i] == a[i+1]) {
if(a[i] == a[i+1]) {
cnt++;
i+... | 0 | 85,847,184 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
string s;
cin >> s;
ll n = s.size();
ll cnt = 0;
ll ans = 0;
for(i = 0;i < n;++i){
if(s.at(i) == 'W'){
ans += i... | #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 | 90,473,552 |
#include <iostream>
#include <vector>
#include <string>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main(void){
while(1){
vector<char> conv_from, conv_to;
int n,m;
char tmp;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++) {
cin >> tmp;
conv_from.push_back(tmp);
cin >> tm... | #include <iostream>
#include <vector>
using namespace std;
struct node {
int parent;
int depth;
vector<int> children;
string type;
node(){
parent = -1;
depth = 0;
}
};
node nodes[100001];
int deep(int i){
if(nodes[i].parent == -1){
return 0;
}
return deep(nodes[i].parent) + 1;
}
int main(){
int n;
cin... | 0 | 19,651,208 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
int max,count;
max=0;
count=0;
for(int i=0; i<s.length();i++){
if(s[i]=='R'){
count++;
if(max<count){
max=count;
}
}
else
count=0;
}
cout<<max;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
temp... | 0 | 31,919,005 |
#include <cstdio>
const char map[4] = {'R', 'Y', 'G', 'B'};
int H, W, d, x, y;
int main() {
scanf("%d %d %d", &H, &W, &d);
for(int i = 1; i <= H; ++i) {
for(int j = 1; j <= W; ++j) {
x = (i + j + W) / d, y = (i - j + W) / d;
putchar(map[((x&1)<<1) | (y&1)]);
}
putchar('\n');
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, int> P;
#define MOD (1000000007ll)
#define l_ength size
#define EPS (1e-10)
int main(void){
ll n,i,a[123456],sum=0ll,d;
bool flag = true;
cin >> n;
for(i=0; i<n; ++i){
cin >> a[i];
su... | 0 | 46,830,870 |
#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;
vector<int> V(10);
vector<int> T(10);
int N;
int ans = 1001001001;
int INF = 1001001001;
int A, B, C;
void calc(vector<int> v){
int now = 0;
int a = 0;
int b = 0;
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | 0 | 25,466,961 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long
int main() {
ll n, a, b;
scanf("%lld%lld%lld", &n, &a, &b);
if (n == 1 && a == b)
return printf("1\n"), 0;
else if (n == 1 && a != b)
return printf("0\n"), 0;
if (b < a)
return printf("0\... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vvin=vector<vin>;
usin... | 0 | 58,965,107 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int collatz(int n) {
if (n % 2 == 0)
return n / 2;
else
return 3 * n + 1;
}
int main() {... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 27,972,593 |
#include<iostream>
using namespace std;
const int MOD = 1046527;
string S[MOD];
int charToInt(char c){
if(c == 'A') return 1;
if(c == 'C') return 2;
if(c == 'G') return 3;
if(c == 'T') return 4;
return 0;
}
int getKey(string s){
int sum = 0, p = 1;
for(int i=0;i<s.size();++i,p*=5) sum+=p*cha... | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< ... | 0 | 21,154,839 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.