code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <ios>
#include <list>
#include <iomanip>
#include <math.h>
using namespace std;
#define FOR(it) for(Points::iterator it = list.begin(); it != list.end(); ++it)
struct Point
{
Point(double _x, double _y) :x(_x), y(_y){}
double x;
double y;
};
typedef list<Point> Points;
void CreatePoints(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define NMAX 2010
const ll mod = 1000000000 + 7;
ll n, m;
ll dp[NMAX][NMAX];
ll s[NMAX], t[NMAX];
void init() {
rep(i, 0, NMAX) {
rep(j, 0, NMAX) dp[i][j] = 0;
... | 0 | 72,949,252 |
#include <iostream>
#include <limits.h>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstring>
#include <utility>
#define dprintf(s,...) printf("%s:%d" s,__func__,__LINE__,__VA_ARGS__)
using namespace std;
typedef pair<int,int> P;
typedef long long int ll;
class Edge{
public:
int to,... | #include "bits/stdc++.h"
using namespace std;
const int maxn = 4005;
char s[maxn];
int p[maxn], p1[maxn], p2[maxn];
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
scanf("%s", s);
for(int i = 0; i < n; ++i){
if(s[i] == 'R'){
p[i] = 1;
}else if(s[i] == 'G'){
p1[i] = 1;
}e... | 0 | 45,439,781 |
#include <bits/stdc++.h>
const int N = 100005;
int read()
{
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {if (ch == '-') f = -1; ch = getchar();}
while (ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
return x * f;
}
int a[N],b[N];
int main()
{
int n = read(), L = read(), T... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
#define outl(x) cout<< (x) << '\n'
#define fi first
#define se second
using pii = pair<int,int>;
using ll = long long;
using vi = vector<int>;
i... | 0 | 15,888,577 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll longinf=1LL<<60;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define F first
#define S second
constexpr char ln = '\n';
const i... | #include<stdio.h>
int main(void){
int n,x,i,j,k,c;
int a[1024]={0};
c=0;
while(1){
scanf("%d %d",&n,&x);
if(n==0 && x==0){
break;
}
for(i=1;i<=n-2;i++){
for(j=i+1;j<=n-1;j++){
for(k=j+1;k<=n;k++){
... | 0 | 4,488,291 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using P = pair<int,int>;
void Yes() {
cout << "Yes" << endl;
}
void No() {
cout << "No" << endl;
}
int main(void) {
string s; cin >> s;
sort(s.begin(), s.end());
bool ok = false;
do {
... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace ... | 0 | 15,584,180 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){
int n;
cin >> n;
vi d(n);
for(int i = 0... | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define MOD7 1000000007
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a)... | 0 | 100,877,872 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
long long L,R;
cin >> L>>R;
long long min = 2019;
for(long long i = L;i<=R;i++){
for(long long j = L;j<=R;j++){
if(i==j) continue;
if((i*j)%2019== 0){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
typedef long long ll;
ll dp[110][110];
int main(){
ll h,w;cin>>h>>w;
char c[110][110];
rep(i,0,h)rep(j,0,w)cin>>c[i][j];
ll x[2]={-1,0},y[2]={0,-1};
rep(i,0,h)rep(j,0,w)dp[i][j]=1e7;
if(c[0][0]=='#')d... | 0 | 76,334,094 |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) s... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int x,flag=0;
cin>>x;
std::deque<int> deq{105,104,103,102,101,100};
for (int i=0;i<6;i++) {
if (x%deq[i]==0) {
cout<<1<<endl;
flag=1;
break;
} else {
int tmp=x/deq[i];
... | 0 | 33,029,819 |
#include <iostream>
using namespace std;
int n,y,m,d;
int ax,ay,b,c;
int sum;
int main(){
cin >>n;
for(int i=0;i<n;i++){
cin >>y >>m >>d;
sum=1;
ax=999/3-y/3;
ay=(999-y)-ax;
sum+=ax*200+ay*195;
b=10-m;
if(y%3==0){
sum+=b*20+(20-d);
}else{
sum+=(b/2)*39+(b%2)*19;
if(b%2==0){
sum+=(19-d);
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
map<int,int> mp;
for(int i = 0; i < 3; i++){
int a; cin >> a; mp[a]++;
}
for(auto i : mp){
if(i.second == 1){
cout << i.first << endl;
return 0;
}
}
} | 0 | 90,702,224 |
#include <bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<n;++i)
#define repe(i,k,n) for(int i=k;i<=n;++i)
using namespace std;
int main()
{
cin.tie(0);cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i,0,n)
{
cin >> a[i];
}
int res = 1e9;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<ll> vel;
typedef vector<str> ves;
#define REP(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, b) REP(i, 0, b)
const ll mod = 1000000007;
const double pi = 3.14159265358979;
ll exp... | 0 | 73,637,706 |
#include <iostream>
#include <string>
using namespace std;
const int N_MAX = 100;
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int G[100][100] = { 0 };
for (int i = 0; i< n; i++)
{
int u, k;
cin >> u;
cin >> k;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int N;
cin>>N;
string FW,W;
map<string,int> check;
cin>>FW;
bool judge=true;
int len=FW.size()-1;
char lw=FW[len];
check[FW]++;
rep(i,N-1){
cin>>W;
... | 0 | 46,428,317 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
priority_queue<pair<ll,pair<ll,ll>>> que;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 264,182 |
#include<iostream>
#include<vector>
int main()
{
std::vector<bool>result;
while (true)
{
double x1, y1, x2, y2, x3, y3, xp, yp;
std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp;
if (!std::cin)
{
break;
}
double k = ((x2 - x3)*(y3 - y1) - (x3 - x1)*(y2 - y3)) / ((x2 - x3)*(yp - y1) - (xp - x1)*... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = (... | 0 | 89,264,106 |
#include <iostream>
using namespace std;
struct Card {
char suit, value;
};
void printList(Card C[], int n){
for(int i=0; i<n-1; i++){
cout << C[i].suit << C[i].value << ' ';
}
cout << C[n-1].suit << C[n-1].value << endl;
}
void bubbleSort(Card C1[], int n){
int flag = 1;
for(int i=0; flag; i++){
flag = 0;
... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pll = pair<long long, long long>;
const long long INF = 1<<29;
const int MOD = 1000000007;
long long ruizyou(long long m,long long n){
if(m == 0)return 0;
if(m == 1)return 1;
long long ans = 1;
long long tmp = m;
for(int i=0;i<=30;... | 0 | 44,267,274 |
#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
const long long int Z = 1000000007;
const long long int INF = 1 << 30;
int flag = 0;
using ll = lon... | #include<iostream>
using namespace std;
int main() {
int datas[100] = { 0 };
int num,biggest_num=0;
while (cin >> num) {
datas[num-1]++;
}
for (int i = 0; i < 100; i++) {
if (biggest_num < datas[i]) {
biggest_num = datas[i];
}
}
for (int i = 0; i < 100; i++) {
if (biggest_num == datas[i]) {
cout <<... | 0 | 89,757,932 |
#include <bits/stdc++.h>
#include <climits>
#ifdef atclib
#include <atcoder/all>
#endif
#ifdef local
#include "dbg-macro/dbg.h"
#endif
#ifdef boost
#include <boost/multiprecision/cpp_int.hpp>
#endif
#define p std::pair
#define ll long long
#define ld long double
#define ull unsigned long long
#define vi std... | #include<iostream>
using namespace std;
int main(){
int64_t Lo = 2,Li = 1;
int n;
cin >> n;
int64_t L = 3;
if(n>=3){
for(int i=3;i<=n;i++){
Lo = Li;
Li = L;
L = Li + Lo;
}
}
if(n==1){
cout << 1 << endl;
}else if(n==2){
... | 0 | 26,397,497 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string str[9];
str[0] = ".,!? ";
str[1] = "abc";
str[2] = "def";
str[3] = "ghi";
str[4] = "jkl";
str[5] = "mno";
str[6] = "pqrs";
str[7] = "tuv";
str[8] = "wxyz";
string a;
int h,t = 0;
cin >> h;
while (t < h) {
cin >> ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
constexpr int NUM_BITS = 60;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int64> xs(n);
for (int i = 0; i < n; i++) {
cin >> xs[i];
}
int64 xor_all = 0;
for (int64 x : x... | 0 | 46,428,499 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
char s;
cin >> s;
if(isupper(s)) cout << 'A';
else cout << 'a';
} | #include <stdio.h>
int main()
{
int n, x, i, j, k, count;
while (true) {
count = 0;
scanf("%d %d", &n, &x);
if (n == 0 && x == 0) break;
if (n >= 3 && n <= 100) {
if (x >= 0 && x <= 300) {
for (i = 1; i <= n; i++) {
for (j = i + 1; j <= n; j++) {
for (k = j + 1; k... | 0 | 69,020,842 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main() {
char b;
cin>>b;
if(b=='A'){
cout<<"T"<<endl;
}
if(b=='T'){
cout<<"A"<<endl;
}
if(b=='G'){
cout<<"C"<<endl;
}
if(b=='C'){
cout<<"G"<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
map<int,int> ac;
map<int,int> wa;
int n,m;
cin >> n >> m;
rep(i,m){
int p;
string s;
cin >> p >> s;
if(s=="AC... | 0 | 83,356,680 |
#include <iostream>
using namespace std;
using ll = long long;
int main() {
const ll MOD = 1e9 + 7;
int n, m;
cin >> n >> m;
const int MAXN = 200000;
const int MAXM = 200000;
static ll x[MAXN], y[MAXM];
static ll cumx[MAXN], cumy[MAXM];
for (int i = 0; i < n; i++) {
cin >> x[i];
... | #include <bits/stdc++.h>
#include <ext/rope>
#define VALHALLA cin.tie(0);ios_base::sync_with_stdio(false);cout<<fixed<<setprecision(13);cerr<<fixed<<setprecision(5);
#define endl "\n"
#define pb push_back
#define all(v) v.begin(),v.end()
#define debug(x) std::cerr << #x << ": " << (x) << '\n';
#define sz(x) (int)x.size... | 0 | 23,936,347 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... | 0 | 10,947,360 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | #include <bits/stdc++.h>
using namespace std;
int n, q;
int main() {
while(cin >> n, n) {
map<char, char> conversion;
for(int i = 0; i < 128; i++) conversion[i] = i;
string c, d;
while(n--) cin >> c >> d, conversion[c[0]] = d[0];
cin >> q;
while(q--) cin >> c, cout <<... | 0 | 61,741,544 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
int ii() { int x; if (scan... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using Graph = vector<vector... | 0 | 31,442,907 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <iostream>
#include <vector>
int main(){
int N;
std::cin >> N;
struct T{
int t;
int x;
int y;
};
std::vector<T> v(N);
for (int i=0; i<N; i++){
int t, x, y;
std::cin >> t >> x >> y;
v.at(i).t = t;
v.at(i).x = x;
v.at(i).y = y;
}
int t = 0, ... | 0 | 69,760,819 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,x;
cin >> a >> b >> c;
x = a+b;
if(c<=x) cout << "Yes"<< endl;
else cout << "No" << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string Tc, Hc;
int n = 0, t = 0, h = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> Tc >> Hc;
unsigned int j = 0;
for (j = 0; j < max(Tc.size(), Hc.size()); j++){
if (Tc[j] > Hc[j]) {
t += 3;
break;
}... | 0 | 19,104,666 |
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned ll
#define db double
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define PII pair<int, int>
const int N=15;
int dp[N][N];
int m,a,b,c;
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long long MOD = 1e9 + 7;
#define INPUT(x) freopen(x,"r",stdin)
#define OUTPUT(x) freopen (x,"w",stdout)
#define pb push_back
#define endl '\n'
#d... | 0 | 81,631,041 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
int r,g,b,n;
cin >> r >> g >> b >> n;
int cnt=0;
for(int R=0; R<=n; R++){
for(int G=0; G<=n; G++){
int B = (n-(r*R + G*g))/b;
if(R*r + G*g +... | #include <iostream>
#define INF 1000000
using namespace std;
int main(){
int n;
while(cin >> n,n){
int r[10][10];
int m = 0;
for(int i = 0; i < 10;++i)for(int j = 0; j < 10; ++j){
r[i][j] = INF;
}
for(int i = 0; i < n; ++i){
int a,b,c;
cin >> a >> b >> c;
r[a][b] = r[b][a] = c;
m = max(max(a,... | 0 | 65,036,410 |
#include <iostream>
#include <algorithm>
using namespace std;
void solve() {
int a,b,c;
cin >> a >> b >> c;
long long t = 0;
for (long long i=1; i <= b; ++i) {
t +=a ;
if (t % b == c) {
cout << "YES";
return;
}
}
cout << "NO";
}
int main() {
s... | #include <stdio.h>
#include <iostream>
using namespace std;
int main(){
int N;
scanf("%d", &N);
int t, x, y;
int t_pre = 0, x_pre = 0, y_pre = 0;
for(int i = 0; i < N;i++){
scanf("%d %d %d", &t, &x, &y);
if(!((t - t_pre >= abs(x - x_pre)+ abs(y... | 0 | 1,945,000 |
#include <iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(a*3+b)/2;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 67,203,631 |
#include<bits/stdc++.h>
using namespace std;
int solve(vector<int>&a){
map<int,int>kazu;
for(int i=0;i<a.size();i++){
kazu[a.at(i)]++;
kazu[a.at(i)-1]++;
kazu[a.at(i)+1]++;
}
int ans=0;
for(auto i:kazu){
ans=max(ans,i.second);
}
return ans;
}
int main(){
int n;
cin >> n;
vector<int>a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<... | 0 | 81,968,111 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int maxN = 1e5+5;
const int mod = 1e9+7;
void solve(){
int H,W;
cin>>H>>W;
vector<string> grid(H);
for(int i=0;i<H;i++){
cin>>grid[i];
}
i... | 0 | 39,631,772 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> s(N);
for (int i = 0; i < N; i++) cin >> s.at(i);
int M;
cin >> M;
vector<string> t(M);
for (int i = 0; i < M; i++) cin >> t.at(i);
int score = 0;
for (int i = 0; i < N; i++) {
string target = s.at(i);
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, s, maxn, minn;
while(1){
scanf("%d", &n);
if(n==0) break;
maxn=0;
minn=1000;
int x=0;
for(int i=0;i<n;i++){
scanf("%d", &s);
x+=s;
maxn=max(s,maxn);
minn=min(s,minn);
}
printf("%d\n",(x-maxn-minn)... | 0 | 36,592,659 |
#include <iostream>
#include <iomanip>
#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>
typedef long long ll;
using namespace std;
ll MOD = 1e9+7;
#define vec vector<int>
#define vecll vector<ll>
#define vec2 vector<vector<int>>
#define vec2ll vector<vector<ll>>
#define vpair vector<pair<int, int>>
#define vpairll vector<pair<ll, ll>>
#define vecst vector<string>
#de... | 0 | 60,277,973 |
#include <cstdio>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
int c[10000];
for(int i = 0; i < n; ++i){
scanf("%d", &c[i]);
}
int min = c[0];
int max = c[0];
for(int i = 1; i < n; ++i){
if(min > c[i]) min = c[i];
if(max < c[i]) max = c[i];
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main() {
ll n, ans = 0;
string s;
vector<char> c;
cin >> s;
rep(i, s.size()) if (s[i] != 'x') c.push_back(s[i]);
bool ok = false;
for (int i = 0; i < c.size() / 2; +... | 0 | 13,135,464 |
#include <bits/stdc++.h>
using namespace std;
int f(int N){
int cnt = 0;
while(N>0){
cnt++;
N /= 10;
}
return cnt;
}
int main() {
int N; cin >> N;
int ans = 0;
for(int i = 1; i <= N;i++){
if(f(i)%2==1) ans++;
}
cout << ans << endl;
} | #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int check(int j){
if (j==2 || j==4 ||j==3)
return j;
else
return 3;
}
int main(){
int board[22][22];
int w,h;
char t;
while(1){
cin >>w >>h;
if(w==0 && h==0) break;
for(int i=0;i<=21;i++){
for(int j = 0;j<=21;j++){
board[j][i]... | 0 | 61,570,813 |
#include <bits/stdc++.h>
using namespace std;
vector<int> factor(100 + 1);
void prime_factor(int n) {
for (int i = 2; i * i <= n; i++)
while (n % i == 0) {
factor[i]++;
n /= i;
}
if (n != 1) factor[n] += 1;
}
int num(int n) {
int ret = 0;
for (auto x:factor) {
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(),v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p,a,b) for(ll p=a ; p<b ; p++)
#define rap(p,a,b) for(ll p=a ; p<=b ; p++)
#define per(p,a,b) for(ll p=a ; p>=b ; p--)
#define F first
#define S se... | 0 | 21,246,577 |
#include<iostream>
#include<cstdint>
int main() {
std::cin.tie(0); std::ios::sync_with_stdio(false);
int r, D, x; std::cin >> r >> D >> x;
for(int i = 0; i < 10; ++i) {
x = r*x - D;
std::cout << x << "\n";
}
return 0;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define MOD 1000000007
#define oo 1000000000000000000
#define forr(i,n) for(ll i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0) ; cout.tie(0);
#define all(x) x.begin()... | 0 | 4,845,628 |
#include <bits/stdc++.h>
using namespace std;
int main()
{int N; cin >> N;
cout << (N + 110) / 111 * 111;} | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
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)++)
int fact(int n) {
if (n == 0) return 1;
else ... | 0 | 74,981,330 |
#include <stdio.h>
#include <string.h>
int main(void)
{
int n, hanako_p=0, taro_p=0,i;
char hanastr[101], tarostr[101];
scanf("%d", &n);
for(i=0;i<n;i++) {
scanf("%s", tarostr);
scanf("%s", hanastr);
if(strcmp(tarostr,hanastr)==0) {
hanako_p++;taro_p++;
}
else if(strcmp(tarostr, hanast... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, co... | 0 | 37,333,518 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
int main()
{
fast;
ll n,d,cnt=0,sum;
cin>>n>>d;
ll arr[n][d];
for(int i=0;i<n;i++)
for(... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<(b);i++)
#define repr(i,b,a) for(int i=int(b);i>=(a);i--)
#define all(x) x.begin(),x.end()
const ll mod = 1e9+7;
const ll INF = 1e9;
ll gcd(ll a... | 0 | 11,110,972 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 24,951,447 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
if(b<=c||d<=a) {cout<<0<<endl; return 0;}
vector<int> x(4);
x[0]=a;x[1]=b;x[2]=c;x[3]=d;
sort(x.begin(),x.end());
cout<<x[2]-x[1]<<endl;
} | using namespace std;
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define INF 1000000000000000000LL
#define MOD 1000000007LL
#define infile "../test/sample-1.in"
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define ... | 0 | 4,938,989 |
#include <stdio.h>
int main(){
long N,A[100000],i,x,a=1;
scanf("%ld",&N);
x=1;
for(i=0;i<N;i++){
scanf("%ld",&A[i]);
if(A[i]==0){
puts("0");
return 0;
}
if((long)1e18/x/A[i]<1){
a=0;
}
else x=x*A[i];
}
if(a==0)puts("-1");
else printf("%ld\n",x);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | 0 | 90,896,662 |
#include<bits/stdc++.h>
using namespace std;
vector<int> g[200005];
vector<int> ans;
bool vis[200005];
void dfs(int s,int& cnt){
if(vis[s]) return;
vis[s] = true;
cnt++;
for(int i=0;i<g[s].size();i++){
if(vis[g[s][i]]) continue;
dfs(g[s][i],cnt);
}
}
int main(int argc, char * argv[])
{
int n,m,a,b;
cin>>n>>... | #pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#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>
#... | 0 | 51,644,041 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#define _USE_MATH_DEFINES
#include<math.h>
#include<unordered_map>
#define min(a,b) (a)>(b)?(b):(a)
#define max(a,b) (a)>(b)?(a):(b)
using namespace std;
int main()
{
string str... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, ... | 0 | 90,508,402 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<ll, ll>P;
int main(){
ll N,K,S;
cin>>N>>K>>S;
rep(i,K){cout<<S<<' ';}
if(S!=1000000000){
rep(i,N-K){cout<<S+1ll<<' ';}
}
else{
rep(i,N-K){cout<<1<<' ';}
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pcc = pair<char, char>;... | 0 | 54,004,788 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SI... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | 0 | 12,970,994 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pi acos(-1)
#define eps 1e-8
pair<int,int> a[100001];
bool cmp(pair<int,int> a,pair<int,int> b)
{
return atan2(1.0*a.second,1.0*a.first)<
atan2(1.0*b.second,1.0*b.first);
}
signed main()
{
int n;
scanf("%lld",&n);
for(int i=1;i<=n;i++)... | #include<iostream>
using namespace std;
#include<vector>
int main() {
int n, m, res = 0;
cin >> n >> m;
int lb[m][n], p[m], k[m];
for(int i = 0; i < m; i++) {
cin >> k[i];
for(int j = 1; j <= k[i]; j++) {
cin >> lb[i][j];
}
}
for(int i = 0; i < m; i++) {
cin >> p[i];
}
bool flag;
... | 0 | 53,133,390 |
#define _GLIBCXX_DEBUG
#include <iostream>
using namespace std;
int main(void){
int a, b, c, k;
cin >> a >> b >> c >> k;
if(k <= a) cout << k << '\n';
else if(k <= a+b) cout << a << '\n';
else cout << a-(k-a-b) << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<p> xy(N);
for(int i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
xy[i] = make_pair(x, y);
}
... | 0 | 93,501,667 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main() {
ll n; cin >> n;
ll asum=0,bsum=0;
vector<ll> a(n),b(n);
rep(i,n){
cin >> a[i]; asum+=a[i];
}
rep(i,n){
cin >> b[i]; bsum+=b[i];
}
if(asum<bsum){
cout << -1 << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll gcd(ll a, ll b) {
return (a ? gcd(b%a, a) : b);
}
ll lcm(ll a, ll b) {
return a * b / gcd(a, b);
}
int main() {
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[... | 0 | 86,988,736 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define si set <ll>
#define vi vector <ll>
#define popcount(x) __builtin_popcountll(x)
#define mii map <ll,ll>
#define vpi vector <pair <ll,ll> >
#define sz(c) (int)c.size()
#define fr first
#define ... | #include<bits/stdc++.h>
using namespace std;
const long long MOD=998244353;
int main(){
int n;scanf("%d",&n);
int a[n];
for(int i=0;i<n;i++)scanf("%d",&a[i]);
int ans=0,now=101;
for(int i=1;i<n;i++){
if(a[i]==a[i-1]){
ans++;
a[i]=now;
now++;
}
... | 0 | 31,660,040 |
#include <iostream>
using namespace std;
int main(void){
int A,B;
cin>>A>>B;
if(A==B){
cout<<"Draw"<<endl;
}
else if(A==1){
cout<<"Alice"<<endl;
}
else if(B==1){
cout<<"Bob"<<endl;
}
else if(A>B){
cout<<"Alice"<<endl;
}
else if(... | #include<iostream>
#include<vector>
int main(void){
int h, w;
std::cin >> h >> w;
std::vector<std::string> s(h);
for(int i = 0; i < h; i++){
std::cin >> s[i];
}
std::vector<std::vector<int>> da(h, std::vector<int>(w));
for(int i = 0; i < h; i++){
int cnt = 0;
int start = 0;
for(int j = 0... | 0 | 35,440,731 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define... | 0 | 79,341,615 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
using namespace std;
const int nmax = 1e9 + 7;
const long long INF = 1e18;
const double PI = 2 * asin(1);
... | #include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#include<algorithm>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int N=2e5+100;
const LL mod=1e9+7;
LL arr[N],ans[N];
LL fac[N],opp[N],op_fa[N];
void preWork(){
fac[0]=fac[1]=1;
opp[0]=opp[1]=1;
op_fa[0]=o... | 0 | 65,568,804 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ld long double
#define mem(a, b) memset(a, (b), sizeof(a))
#define rep(i, j, k) for (int i = j ; i < k ; ++i)
#define rrep(i, j, k) for (int i = j; i > k; --i)
#define all(cont) cont.begin(), cont.end()
#define ra... | #include <bits/stdc++.h>
using namespace std;
#define rep(src,dst) for(int i=src; i<dst; i++)
#define rep2(src,dst) for(int j=src; j<dst; j++)
#define INF 1000000000000
#define MOD 10000007
#define PI acos(-1)
#define ll long long
template<typename T> inline void ChMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<... | 0 | 28,735,022 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
struct mint {
ll x;
mint(ll x=0):x(x%mod){}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *... | #include <bits/stdc++.h>
#define MOD 1000000007;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main()
{
ll n;
string s;
cin >> n >> s;
unordered_map<char, ll> M;
rep(i, s.size())
M[s.at(i... | 0 | 31,575,478 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t> A(n), B(n);
vector<array<int64_t, 2>> S(n);
for (int i = 0; i < n; i++){
cin >> A[i] >> B[i];
S[i][0] = A[i] + B[i];
S[i][1] = i;
}
sort(S.begin(), S.end(), greater<array<int64_... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main(void){
while(1){
string x;
cin >> x;
if(x=="0")break;
int v;
v=0;
for(int i=0;i<(int)x.size();i++){
char ch = x[i];
int n = (int)ch - (int)'0';
... | 0 | 29,610,166 |
#include<iostream>
using namespace std;
int min(int *a, int n)
{
int v = 1000000;
for ( int i = 0; i < n; i++ )
{
if ( v > a[i] )
{
v = a[i];
}
}
return v;
}
int max(int *a, int n)
{
int v = -1000000;
for ( int i = 0; i < n; i++ )
{
if ( v < a[i] )
{
... | #include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::string s;
std::getline(std::cin, s);
std::istringstream iss(s);
std::string a;
std::string b;
std::string c;
iss >> a >> b >> c;
if (a[a.size() - 1] == b[0] &&
... | 0 | 41,083,869 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#def... | #include <iostream>
#include <set>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string S;
char rS='a'-1;
cin >> S;
set<char> alp;
set<char> word;
set<char> res;
string resS="";
int flag=0;
for(char s='a';s<='z';s++) alp.insert(s);
while(flag==0){
word.clear();
res.... | 0 | 97,193,849 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll LINF = 1e18;
const int INF = 1e9;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int N; cin>>N;
int a[1000001];
rep(i,1000001)a[i]=0;
int ans=0;
rep(i,N){
int x; cin>>x;
if(x>N){
... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | 0 | 90,471,378 |
#include<iostream>
using namespace std;
int main(){
int x;
cin>>x;
int temp=x;
int sum=0;
while(temp!=0)
{
sum+=temp%10;
temp/=10;
}
if(x%sum==0)
{
cout<<"Yes";
}
else
cout<<"No";
} | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <map>
#define REP(i,n) for(ll i = 0; i < (ll)n; i++)
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
int... | 0 | 30,281,845 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ... | 0 | 409,104 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
long long mul=1;
long long a[n];
long long z = 0;
for(int i=0;i<n;i++) {
cin>>a[i];
if(a[i]==0) z =1;
}
if(z==1){
cout<<0;
return 0;
}
for(int i=0;i<n;i++){
if(a[i]<=1000000000000000000/mul){
mul*=a[i];
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | 0 | 511,785 |
#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;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 36,953,830 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vec;
typedef vector<vector<ll>> vec2;
typedef pair<ll,ll> pair1;
typedef pair<string,ll> pair2;
typedef pair<ll,string> pair3;
typedef pair<string,string> pair4;
#define fl(i,a,b) for(i=a;i<b;i++)
#define rf... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | 0 | 92,595,567 |
#include<bits/stdc++.h>
using namespace std;
#define DIV 1000000007
#define BLACK 0
#define WHITE 1
long long N;
long long ban[200005];
string S;
int main(){
cin >> N;
cin >> S;
for(long long i = 0; i < 2*N; i++){
if(i%2 == 0){
if(S[i] == 'B'){
ban[i] = WHITE;
}else{
ban[i] = BLACK;
}
}else{
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se secon... | 0 | 12,780,339 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
inline void io()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.precision(10);
cout << fixed;
}
int main()
{
io();
int n;
cin >> n;
int mx = 0;
int ans = 0;
for (int ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 300100;
int n,a,b,ans[maxn];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>a>>b;
if ((n<a+b-1) || (n > 1ll*a*b)) cout<<-1;
else {
int cur = n;
for (int i=b;i>=1;i--) {
if (cur... | 0 | 98,771,627 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<int,int>;
using Pl= pair<ll,ll>;
using ld=long double;
using V=vector<int>;
using Vl=vector<ll>;
using VV=vector<vector<int>>;
using... | #include <bits/stdc++.h>
using namespace std;
long long from_1(long long n) {
long long result=0;
n = n + 1;
for (long long i = 1; i <= n; i = i * 2) {
if (i == 1) {
result = (n / 2) % 2;
} else {
result = result + i * (max(n % (i * 2) - i, (long long)0) % 2);
}
}
return result;
}
int main() {
long lo... | 0 | 95,737,022 |
#include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long ll;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<tuple>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef unsigned long long i... | 0 | 32,781,392 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(!(a%3==0 || b%3==0 || (a+b)%3==0)) cout<<"Imp";
else cout<<"P";
cout<<"ossible";
} | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <limits>
#include <climits>
#include <utility>
#include <algorithm>
#include <numeric>
using namespace std;... | 0 | 89,876,809 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[]) {
int H1, M1, H2, M2, K;
cin >> H1 >> M1 >> H2 >> M2 >> K;
int time = 60 * (H2 - H1) + M2 - M1 - K;
cout << time << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1e6+23;
vector<pii> g[maxn];
int n,s;
int d[maxn];
bool vis[maxn];
priority_queue<pair<int,int>> q;
void dij(int s)
{
memset(d,0x3f,sizeof(d));
memset(vis,false,sizeof(vis));
q.push({0,s});d[s]=0;... | 0 | 43,900,330 |
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
ll n, res=0L;
cin >> n;
vector<ll>... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n;
cin >> n;
vector<ll> re;
ll ans=0;
for(ll i=1;i*i<=n;++i){
if(n%i==0){
re.push_back(i);
if(i*i!=n){
re.push_back(n/i);
}
}
}
sort(re.begin(),re.end());
for(int i=1;i<re.size();++i){
i... | 0 | 77,596,307 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
string S;
cin >> S;
int N = S.size();
vector<char> s1(N), s2(N);
for(int i = 0; i < N; i++){
if(i % 2 == 0) {
s1[i] = '1';
s2[i] = '0';
}
else{
s1[i] =... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s, p;
cin >> s >> p;
for (int i = 0; i < s.size(); i++) {
rotate(s.begin(), s.begin() + 1, s.end());
if (s.find(p) != -1) {
cout << "Yes" << endl;
return 0;
}
... | 0 | 38,597,103 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
if (N < 26) {
set<char> s;
for (int i = 0; i < N; i++) s.insert(S[i]);
for (char ch = 'a'; ch <= 'z'; ch++) {
if (!s.count(ch)) {
cout << S << ch << endl;
return 0;
}
}
... | 0 | 16,590,769 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
long long a,b,c,d,ac,ad,bc,bd;
cin>>a>>b>>c>>d;
ac=a*c;
ad=a*d;
bc=b*c;
bd=b*d;
cout<<(ac>(ad>(bc>bd?bc:bd)?ad:(bc>bd?bc:bd))?ac:(ad>(bc>bd?bc:bd)?ad:(bc>bd?bc:bd)));
return 0;
} | #include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>... | 0 | 61,435,055 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <iostream>
using namespace std;
int k, s, cnt = 0;
int main()
{
cin >> k;
cin >> s;
for (int i = 0; i <= k; i++){
for (int j = 0; j <= k; j++){
if (((s - i - j) <= k) && (s - i - j) >= 0){
cnt ++;
}
}
}
cout << cnt << "\n";
return ... | 0 | 72,744,323 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a;
long long b;
long long c;
cin >> a >> b >> c;
long long sum = (b + c);
if (sum > a) {
cout << (sum - a) << endl;
}
else {
cout << "0" << endl;
}
return 0;
} | #include <stdio.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <sstream>
#include <set>
#pragma GCC optimize(2)
#define mm(i,v) memset(i,v,sizeof i);
#define mp(a, b) make_pair(a, b)
#define pi acos(-1)
#define fi first
#define ... | 0 | 83,256,993 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
const int MAXN = 100000 + 10000;
int n;
int a[MAXN], fa[MAXN];
long long b[MAXN];
vector<int> edg[MAXN];
void yes()
{
cout << "YES" ... | #include <bits/stdc++.h>
#define rp(i,n) for(ll i=0; i<n; i++)
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
using G=vector<vector<int>>;
int main(){
ll n,k;
cin >> n >> k;
priority_queue<P> allque;
vector<priority_queue<ll>> eachque(n);
vector<ll> group(n,0);
priority_queue<P,ve... | 0 | 57,160,591 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
int N, A;
cin >> N >> A;
cout << (N * N) - A << "\n";
} | #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 | 85,967,653 |
#define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
using namespace std;
typedef vector<int> vi;
int n, t;
string s;
vi TIME;
vi csum;
void solve() {
TIME.assign(24*3600, 0);
csum.assign(24*3600+1, 0);
rep(i,n) {
cin >> s;
t = stoi(... | 0 | 26,764,623 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
#define fi first
#define se second
#define mp make_pair
typedef long long LL;
typedef pair<int, int> PII;
const int N = 100010;
int n;
int a[N], b[N];
LL h, w;
LL res[10];
map<PII, bool> hm;
inline int F(int x, int y) {
ret... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(vector<ll>w,vector<ll>v,ll n,ll W,ll**dp){
if(n==0 || W==0)
return 0;
if(dp[n][W]!=-1){
return dp[n][W];
}
if(W-w[n-1]<0)
return dp[n][W]=solve(w,v,n-1,W,dp);
return dp[n][W]=max(v[n-1]+solve(w,v,n-1,... | 0 | 66,255 |
#include <bits/stdc++.h>
using namespace std;
#include<algorithm>
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n;
cin>>n;
vector<ll>p,q,a;
for(ll i=0;i<n;i++){
a.push_back(i+1);
}
for(ll i=0;i<n;i++){
ll x;
cin>>x;
p.push_back(x);
}
for(ll i=0;i<n;i++){
ll x;
cin... | #include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) ((a) / gcd(a,b)) * (b)
#define all(x) x.begin(),x.end()
#define ll long long
#define ull unsigned long long
#define VI vector<int>
#define VLL vector<ll>
#define VS vector<string>
#define MPII map<int, int>
#define SET set<int>
#... | 0 | 23,372,469 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
int main(){
ll n ; cin >> n ;
vector<pll> a(100100),b(100100) ;
for(int i=0;i<a.size();i++){
a.at(i).first =... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ins insert
#define pqueue(... | 0 | 28,725,135 |
#include<iostream>
#include <sstream>
#define SSTR( x ) static_cast< std::ostringstream & >( ( std::ostringstream() << std::dec << x ) ).str()
using namespace std;
int ci(int n, int s, int min, int max, string str) {
if (s < min || n < 1) return 0;
if (n == 1) {
if (s > max) return 0;
return 1;
}
int r ... | #include <iostream>
#include <vector>
using namespace std;
long long solve(long long A, long long B){
if(A > B) swap(A, B);
long long L = 0, R = B;
while(R - L > 1){
long long mid = (L+R)/2;
if(mid * mid < A * B) L = mid;
else R = mid;
}
if(L < A) return 2 * L;
if(L * (L+1) < A * B) return 2 * L - 1;
retur... | 0 | 34,833,738 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define YES cout<<"YES"<<"\n";
#define NO cout<<"NO"<<"\n";
#define ld long double
#define yes cout<<"yes"<<"\n";
#define no cout<<"no"<<"\n";
#define No cout<<"No"<<"\n";
#define Yes cout<<"Yes"<<"\n";
#define f(i,a) for(i=0;i<a;i++)
#define fo... | 0 | 36,010,756 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int ans = 1;
for (int i = 0; i < n - 1; ++i) {
ans += s[i] != s[i + 1];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define all(v) v.begin(), v.end()
#define ll long long
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<long long>;
using vvll = vector<vll>;
int main(){
... | 0 | 90,360,040 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n;cin >> n;
int k;cin >> k;
vector<ll> sum(n+1,0),best(n+1,0);
for (int i = 0; i < n; i++) {
int a;cin >> a;
sum[i + 1] = sum[i] + a;
best[i + 1] = best[i] + max(a,0);
}
ll ans = 0;
... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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;
typedef long long ll;
typedef pair<ll,ll> P;
const static ll MOD = (1e+9)+7;
ll modpow(ll a,ll n){
if(n==0)return 1;
if(n%2==1)return a*modpow(a,n-1)%MOD;
l... | 0 | 6,351,804 |
#include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int main(void) {
io;
int N,K,X,Y;
cin >> N >> K >> X >> Y;
long long total = 0;
for (int i = 1; i <= N; i++) {
if (i <= K) {
total += X;
} else {
... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
const ll MOD = 1000000007;
const ll INFL = (1LL << 60);
const int INFI = (1 << 30);
int main() {
int N, M; cin >> N >> M;
vector<pii> AB(N);
rep(i, 0, N... | 0 | 85,172,599 |
#include <bits/stdc++.h>
using namespace std;
long long A, B , C , K ;
void input() {
cin >> A >> B >> C >> K ;
}
int main() {
input() ;
if( A >= K ){
cout << K << endl;
}
else if( A+B >= K ){
cout << A << endl;
}
else{
cout << 2*A + B - K << endl;
}
} | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SHIFT_LEFT(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).su... | 0 | 70,209,983 |
#include <iostream>
using namespace std;
char S[3];
int main(){
cin >> S;
if(S[0] == S[1] && S[1] == S[2]){
cout << "No";
}
else{
cout << "Yes";
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int A[5];
int mod=10;
rep(i,5){
cin>>A[i];
if(A[i]%10==0){
continue;
}
else{
mod=min(mod,A[i]%10);
}
}
int sum=0;
rep(i,5){
if(A[i]%10=... | 0 | 14,967,888 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<string> a;
bool cmp(string s, strin... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <string.h>
#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;
}
r... | 0 | 27,550,934 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int intA;
int intB;
cin >> intA >> intB;
cout << (intA + intB) / 2 + (intA + intB) % 2 << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,j,status=0,n1,n2,n;
string s,t,f1,f2;
cin>>s>>t;
n=s.length();
f1=s;
f2=t;
sort(f1.begin(),f1.end());
sort(f2.begin(),f2.end());
if(f1.compare(f2)!=0)
{
cout<<"No";
return 0;
}
for(i=0;i<n;i++... | 0 | 61,180,440 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | #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 repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
int h[n];
rep(i,... | 0 | 87,844,459 |
#include <iostream>
using namespace std;
int main(){
string str, cmd, arg2;
int n, arg0, arg1;
cin >> str >> n;
for(int i = 0; i < n; i++){
cin >> cmd >> arg0 >> arg1;
if(cmd == "print"){
cout << str.substr(arg0, arg1-arg0+1) << endl;
continue;
}
if(cmd == "reverse"){
string tmp1 = str.substr(0, ar... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007
int main(){
double W, H, x, y;
cin >> W >> H >> x >> y;
if(W/2 - 0.0001 < x && x < W/2 + 0.0001 && H/2 - 0.0001 < y && y < H/2 + 0.0001) {
printf("%.10f", W * H /2);
cou... | 0 | 35,654,492 |
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#d... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define B begin()
#define E end()
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std ;
int main()
{
FASTIO
int r , d , x ;
cin >> r >> d >>... | 0 | 52,683,960 |
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#def... | #include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <set>
using ll = long long;
using namespace std;
int monmo(char ms){
if(ms=='R')return 3;
else if(ms=='G')return 2;
else if(ms=='B')return 1;
else co... | 0 | 50,363,236 |
#include <stdio.h>
int main(){
int H1, H2, M1, M2, K;
H1, H2 >= 0 && H1, H2 <= 23;
M1, M2 >= 0 && M1, M2 <= 60;
int HM1, HM2;
scanf("%d %d %d %d %d", &H1, &M1, &H2, &M2, &K);
HM1 = H1 * 60 + M1;
HM2 = H2 * 60 + M2;
printf("%d", HM2 - HM1 - K);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const ll MOD2=998244353;
const double PI=acos(-1);
const ll INF=1e18;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghij... | 0 | 93,535,252 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define mp make_pair
ll mod = 10e9+7;
ll mod2 = 998244353;
int main(){
vector<ll> ans;
while (true){
int n... | #include <bits/stdc++.h>
#define H_MAX 1000
#define W_MAX 1000
#define WALL '#'
#define START 's'
#define GOAL 'g'
constexpr int INF = 1e9;
constexpr int MOVE_COST = 1;
constexpr int WALL_COST = 1e8;
int MAX_WALL = 2;
int MAX_COST = (MAX_WALL + 1) * WALL_COST - 1;
using std::make_pai... | 0 | 43,603,770 |
#include<bits/stdc++.h>
using namespace std;
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define rep(i,n) for(int i=0; i<(n); ++i)
#define rep1(i,n) for(int i=1; i<=(n); ++i)
#define Dcout(a) cout << setprecision(20) << a << endl
#define MP make_pair
#define PB push_back
#de... | #include <bits/stdc++.h>
#define rep(i, a, b) for(ll i = ll(a); i < ll(b); i++)
#define rer(i, a, b) for(ll i = ll(a) - 1; i >= ll(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(ve... | 0 | 11,052,450 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include<cmath>
#include<string>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define deb(x) cerr<<#x<<" "<<x<<"\n"
#define debi cerr<<"hey sparky\n"
#define x first
#define y second
#de... | #include <iostream>
using namespace std;
int main(void){
int n;
char c[36][3],d[36][3];
cin>>n;
int i,j;
for(i=0;i<n;i++){
cin>>c[i];
for(j=0;j<3;j++)d[i][j]=c[i][j];
}
char swap[3];
for(i=0;i<n;i++){
for(j=n-1;j>i;j--){
if(c[j-1][1]>c[j][1]){
... | 0 | 17,467,111 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.