code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include<algorithm>
using namespace std;
int main() {
int a,one=0,two=0,three=0;
for (int i=0;i<10;i++){
cin>>a;
if (a>three) three=a;
if (three>two) swap(two,three);
if (two>one) swap(one,two);
}
cout<<one<<endl<<two<<endl<<three<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
const double p... | 0 | 33,062,117 |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int H=0,A[200000001];
string com;
void maxHeapify(int i){
int l=2*i,r=2*i+1,largest;
if(l<=H&&A[l]>A[i]) largest=l;
else largest=i;
if(r<=H&&A[r]>A[largest]) largest=r;
if(largest!=i){
swap(A[i],A[largest]);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i,n) for (int i = 0; i < (n); ++i)
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main(){
ll k;
cin >> k;
queue <ll> q;
FOR(i,1,10) ... | 0 | 81,843,624 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define rsrt(s) sort(s.rbegin(),s.rend())
#define all(x) x.begin(),x... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | 0 | 42,931,375 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int inf = 1200005;
int main(){
int n, m, x;
cin >> n >> m >> x;
int c[n], a[n][m];
for(int i = 0; i < n; i++){
cin >> c[i];
for(int j = 0; j < m; j++)
cin >> a[i][j];
}
int ans = inf;
for(int ... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
bool check(int n){
llong... | 0 | 79,243,451 |
#include <cmath>
#include <iomanip>
#include <iostream>
double rad(double& angle) { return angle / 180 * M_PI; }
double cosine(double& a, double& b, double& rad) {
return sqrt(pow(a, 2.0) + pow(b, 2.0) - 2 * a * b * cos(rad));
}
double area(double& a, double& b, double& rad) { return a * b * sin(rad) / 2; }
double ci... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 82,772,342 |
#include <bits/stdc++.h>
using namespace std;
#define N 101
vector<vector<int> > dp(N, vector<int>(N));
int p[N+1];
int main(){
int n;
cin >> n;
for (int i = 1; i < n+1; i++) cin >> p[i-1] >> p[i];
for (int l = 2; l <= n; l++){
for (int i = 1; i <= n-l+1; i++){
int j = i + l - 1;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | 0 | 72,300,040 |
#include <iostream>
#include <queue>
using namespace std;
#define MaxW 1000
#define MaxH 1000
#define MaxN 1000
#define INF 99999
int H,W,N;
int d[MaxN + 1][MaxN + 1];
char pos[MaxH][MaxW];
int dx[4] = {-1,0,1,0},dy[4] = {0,1,0,-1};
bool visited[MaxH][MaxW];
typedef struct Node{
int x,y;
}Node;
bool judge(int x, in... | #include<iostream>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int i;
int a, b, c, d, r;
r = 0;
for(i = A; i < B+1; i++){
a = i / 10000;
b = (i - a * 10000) / 1000;
c = i % 10;
d = (i - c) % 100 / 10;
if(a == c && b == d){
r++;
... | 0 | 93,015,280 |
#include<bits/stdc++.h>
using namespace std;
int main() {
char a, b;
cin >> a >> b;
if(a == 'H' && b == 'D')
cout << "D";
else if(a == 'H' && b == 'H')
cout << "H";
else if(a == 'D' && b == 'D')
cout << "H";
else if(a == 'D' && b == 'H')
cout << "D";
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <string>
#include <cstdio>
#include <queue>
#include <list>
using namespace std;
class Node {
public:
int id;
int parent;
int depth;
string type;
int degree;
vector<int... | 0 | 85,716,187 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int P, Q, R;
cin >> P >> Q >> R;
int tot = P + Q + R;
int del = max({P, Q, R});
cout << tot - del << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int ... | 0 | 60,372,717 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x;
cin >> a >> b;
if((a + b) % 2 == 0)
x = (a + b)/2;
else
x = (a + b) / 2 + 1;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using _loop_int = int;
#define REP(i,n) for(_loop_int i=0; i<(_loop_int)(n); i++)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a); i<(_loop_int)(b); i+... | 0 | 47,922,536 |
#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>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<vector<int>> td(N);
for (int i = 0; i < N; i++) {
int t, d;
cin >> t >> d;
t--;
td[t].push_back(d);
}
vector<pair<int,int>> p;
for (int i = 0; i < N; i++) {
if (0 < td[i].size()) {
sort(td[... | 0 | 73,853,323 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int N,b,min,tmp,cou;cou=0;
int num[101]={};
cin>>N;
for(int i=0;i<N;i++)
{cin>>b;num[i]=b;}
for(int i=0;i<N;i++)
{
min=i;
for(int j=i;j<N;j++)
{if(num[min]>num[j])min=j;
}
{tmp=num[i];num[i]=num[min];num[min]=tmp;
if(i!=min)cou++;}
}
for(int i=0;i<N... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
#define N 100000
vector<int> par(N);
vector<int> ranks(N);
void init(int n)
{
int i;
rep(i,n)
{
par[i]=i;
ranks[i]=1;
}
}
int find(int x)
{
if(par[x]==x)return x;
els... | 0 | 20,543,757 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int inf = 1000000000+7;
int n,m;
cin >> n >> m;
int x;
int ans1=0;
int ans2=0;
for(int i=1;i<=n;i++){
cin >> x;
ans1 = (ans1+(n - 2*i +1)*x)%inf;
}
for(int i=1;i<=m;i++){
cin... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> v... | 0 | 23,753,384 |
#include <stdio.h>
#define MAXL 3000
void swap(int *x, int *y);
int main()
{
int x[MAXL] = {0};
int y[MAXL] = {0};
int i = 0;
while(i < 3000)
{
scanf("%d",x+i);
scanf("%d",y+i);
if(x[i] == 0 && y[i] == 0) break;
i++;
}
int length = i;
for(i = 0; i < length... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) for (int i = (m); (i) < (n); ++(i))
using namespace std;
template <class T>
void setmax(T &a, T ... | 0 | 37,742,112 |
#include <bits/stdc++.h>
using namespace std;
#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(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int a,b,c;
cin>>... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
}
else {
int F = S.size();
int D = T.size();
vector<char> ans(F);
for (int j = 0; j < F; j++) {
ans.at(j) = 'z';
}
bool ok = f... | 0 | 9,849,247 |
#include<bits/stdc++.h>
using namespace std;
signed main()
{
for(int i = 1; i <= 9; i++){
for(int j = 1; j <= 9; j++){
printf("%dx%d=%d\n", i, j, i * j);
}
}
return 0;
} | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s;
cin >> s;
long long count_0 = 0;
long long count_1 = 0;
for(long long i = 0; i < s.size(); i++){
if(s[i] == '0'){
count_0++;
}
else{
count_1++;
}
}
if(coun... | 0 | 55,981,662 |
#ifdef CREED
#include "creed.h"
#else
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <utility>
#include ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int i, j;
int hh, mm, ss;
int time[100000], count;
cin >> n;
while(n!=0){
for(i=0; i<100000; ++i) time[i]=0;
for(i=0; i<n; ++i){
scanf("%d:%d:%d", &hh, &mm, &ss);
time[ss+60*mm+3600*hh]++;
scanf("%d:%d:%d", &hh, &mm, &ss);
time[ss+60... | 0 | 1,467,307 |
#include<cstdio>
#include<iostream>
using namespace std;
int n,m,a,b;
int main(){
scanf("%d%d%d%d",&n,&m,&b,&a);
if(a>n/2||b>m/2){printf("-1");return 0;}
if(!a&&!b){
for(int i=1;i<=n;i++,printf("\n"))
for(int j=1;j<=m;j++) printf("1");return 0;
}
if(!b){
for(int j=1;j<=a;j++,printf("\n"))
for(int i=1;i<=m;... | #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 second
... | 0 | 43,361,552 |
#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,l;
string s[110];
cin >> n >> l... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | 0 | 67,528,366 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int max = 0;
int ans = 1;
for (int i = 1; i <= N; i++)
{
int a = i;
int count = 0;
while (a % 2 == 0)
{
a /= 2;
count++;
}
if(max < count) {
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100500;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
long long n, ans = 0;
cin >> n;
for(long long i = 1 ; i * i <= n ; ++i)
if(n % i == 0){
int a = i - 1;
long long b = (n / i) - 1;
... | 0 | 42,753,955 |
#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.b... | #include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
int main()
{
string t, h;
int n, t_len, h_len, itr, t_score, h_score;
t_score = 0;
h_score = 0;
cin >> n;
for (int i=0; i<n; ++i){
cin >> t >> h;
itr = 0;
t_len = t.length();
h_len = h.l... | 0 | 17,593,710 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
cin.tie(NULL); cout.tie(NULL);
ios_base:: sync_with_stdio(false);
ll n,a,b;cin>>n>>a>>b;
cout<< ( (b-a)%2?"Borys":"Alice" );
} | #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... | 0 | 93,370,331 |
#include <iomanip>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int64_t mod = 1e9 + 7;
int main(void) {
ios::sync_with_stdio(false);
string L;
cin >> L;
int N = L.size();
vector<int64_t> DP1(N + 1, 0);
vector<int64_t> DP2(N + 1, 0);
D... | #include<cstdio>
#include<cctype>
#include<iostream>
#include<string>
using namespace std;
int main() {
string str;
while(1) {
int sum = 0;
cin >> str;
if (str == "0") break;
for (int i = 0; i < str.size(); i++) {
if (str[i] == '1') sum += 1;
if (str[i] ==... | 0 | 88,636,817 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a,b,c;
cin >> a >> b >> c;
int flag = 0;
for(int i=a; i<=10000;i=i+a){
if(i%b==c){
flag = 1;
cout << "YES"<<endl;
break;
}
}
if(flag==0) cout ... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define int long lo... | 0 | 76,228,342 |
#include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.e... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
t... | 0 | 89,457,474 |
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
void swap(int *,int *);
int main(){
int n,a[100],c=0,minj;
cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){
minj=i;
for(int j=i;j<n;j++){
if(a[j]<a[minj]){
minj=j;
}
}
swap(&a[i],&a[minj]);
if(i!=minj)c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N; cin >> N;
vector<int> A(N+2);
A[0] = 0;
A[N+1] = 0;
vector<int> D(N+1);
vector<int> D2(N);
int total = 0;
for (int i = 1; i <= ... | 0 | 58,245,512 |
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
typedef long long ll;
int main() {
int n, k; cin >> n >> k;
vector<int> la;
for (int i = 0; i < n; ++i) {
int a; cin >> a;
if (a >= k) continue;
la.push_back(a);
}
sort(la.begin(), la.end());
int n2 = la.size();
in... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using lint =... | 0 | 21,639,046 |
#include <bits/stdc++.h>
using namespace std;
bool is_black_out(int x, int y, int xi, int yi, int a) {
switch (a) {
case 1:
return x < xi;
case 2:
return x >= xi;
case 3:
return y < yi;
case 4:
return y >= yi;
default:
return false;
}
}
int main() {
int W, H, N;
... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 98,934,347 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
ll a, b;
cin >> a >> b;
if (a>b) swap(a, b);
ll k = floor(sqrt((long double)a*b-1));
if (a==b || a+1==b) {
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=ve... | 0 | 66,705,501 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define repp(i,n) for(int i=n-1;i>=0;i--)
#de... | 0 | 1,100,020 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Max = 1e3 + 5;
char lst[Max][Max];
int main()
{
int x, y;
cin >> x >> y;
for (int i = 1; i <= x; i++)
{
for (int j = 1; j <= y; j++)
{
char c;
scanf(" %c", &lst[i][j]);
}
}
for (int i = 1; i <=... | #include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | 0 | 53,947,368 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long N,tmp;
cin>>N;
tmp=sqrt(N);
while(tmp>0){
if(N/tmp*tmp==N){break;}
tmp--;
}
cout<<tmp+N/tmp-2<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define ... | 0 | 92,748,695 |
#include <iostream>
#include <cstdio>
using namespace std;
int r, g;
int main() {
cin >> r >> g;
cout << 2*g - r;
return 0;
} | #include "bits/stdc++.h"
#include <unordered_set>
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1;i >= 0; i--)
#define ALL(a) (a).begin(),(a).... | 0 | 8,125,320 |
#include<cstdio>
#include<iostream>
using namespace std;
int main() {
double n, i, ans = 100000;
cin >> n;
for (i = 1; i <= n; i++) {
ans = ans*1.05;
if (int(ans) % 1000 != 0) ans = ans - int(ans) % 1000 + 1000;
}
printf("%d\n", int(ans));
return 0;
} | #include <iostream>
using namespace std;
int main(){
int x,y;
while(cin>>x>>y,x||y){
if(x>y) cout<<y<<" "<<x<<endl;
else cout <<x<<" "<<y<<endl;
}
} | 0 | 96,082,661 |
#include "bits/stdc++.h"
using namespace std;
int N, A[100], Count = 0;
void SelectionSort(int A[], int N) {
for (int i = 0; i < N; i++) {
int min_j = i;
for (int j = i + 1; j < N; j++) {
if (A[j] < A[min_j]) {
min_j = j;
}
}
if (i != min_j) {
swap(A[i], A[min_j]);
Count++;
}
}
}
int main() ... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
... | 0 | 49,842,427 |
#include <iostream>
using namespace std;
int main()
{
int a,b,sum=0;
cin>>a>>b;
if(a+b==4)
{
cout<<2;
}
else if(a+b==5)
{
cout<<1;
}
else
{
cout<<3;
}
} | #include <bits/stdc++.h>
using namespace std;
int main (void) {
string S;
long long K;
cin >> S >> K;
bool found = false;
for ( int i=0; i<K; i++ ) {
if ( S.at(i) != '1' ) {
cout << S.at(i) << endl;
found = true;
break;
}
}
if ( !found )
... | 0 | 34,174,038 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n,m;
cin >> n >> m;
if(n%2==1){
for(int i=1;i<=m;i++){
cout << i << " " << (n-i) << endl;
}
}
else{
int k = (m+1)/2;
for(int i=1;i<=k;i++){
cout << i << " " ... | #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
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>void print(T x){cout << x << endl;}
te... | 0 | 10,101,637 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++)
{
cin >> A[i];
}
map<int, int> p;
for (int i = 0; i < N; i++)
{
p[A[i] - 1] += 1;
p[A[i] + 1] += 1;
p[A[i]] +=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define mt(p, q, r) make_tuple(p, q, r)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()... | 0 | 85,169,505 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAX=1e18;
const int N=1e5+10;
ll a[N];
int main()
{
ll n;
ll cnt=1;
cin>>n;
int zero=0;
for(ll i=0;i<n;i++) {
cin>>a[i];
if(!a[i]) zero++;
}
if(zero>0) cout<<0<<endl;
else
{
for(ll i=0;i<n;i++)
{
if(a[i]<=MAX/cnt) cnt*=a[... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | 0 | 9,595,961 |
#include<bits/stdc++.h>
using namespace std;
typedef string ll;
int main ()
{
ll a,b,c; cin>>a>>b>>c;
if((a[a.size()-1]==b[0])&&(c[0]==b[b.size()-1])){
cout<<"YES"<<endl;
}
else
cout<<"NO"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, ma, mi, p, q;
vector<int> nums;
cin >> n;
p = q = 0;
for (int i = 1; i <= n; i++){
nums.push_back(i);
}
for (int i = n; 0 < i; i--){
int num;
cin >> num;
p += pow(10, i-1)*num;
}
for (int i = n; 0 < i; i--){
i... | 0 | 75,777,382 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S>... | #include <iostream>
using namespace std;
int main(void)
{
int n;
int ans[100]={0};
int kari;
while(cin>>n)
ans[n]++;
kari=ans[0];
for(int i=1;i<99;i++)
{
if(kari<ans[i])
kari=ans[i];
}
for (int i=0; i<100; i++)
{
if(kari==ans[i])
co... | 0 | 80,997,634 |
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
const long long MOD=1000000009;
const int mod = 1e5+50;
typedef long long ll;
long long a,b;
int main()
{
long long n,sum=0;
long long cnt=0x3f3f3f3f;
cin>>n;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int... | 0 | 35,760,432 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int a,b;
char c;
cin >> a >> c >> b;
if (c == '-') {
cout << a - b << endl;
}
else {
cout << a + b << endl;
}
} | #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | 0 | 89,008,933 |
#include <cstdio>
#include <cstdlib>
#include <string>
using namespace std;
struct Node {
int key;
Node* prev;
Node* next;
Node(int key) : key(key) { }
};
class DoublyLinkedList {
public:
Node* nil;
void insert(Node* x) {
x->next = nil->next;
nil->next->prev = x;
nil->nex... | #include <iostream>
#include <climits>
using namespace std;
int N, E;
long a[101][101];
int INF = INT_MAX;
void warshalfloyd() {
for (int k = 0; k < N; ++k) {
for (int i = 0; i < N; ++i) {
if(a[i][k] == INF) continue;
for (int j = 0; j < N; ++j) {
if(a[k][j] == INF) c... | 0 | 19,768,698 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int l;
cin>>l;
cout<<fixed<<setprecision(10)<<(double)l*l*l/27.0<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
char grid[1010][1010];
bool seen[1010][1010];
int di[]={0,1,0,-1};
int dj[]={1,0,-1,0};
int main(){
int h,w;
cin>>h>>w;
queue<P> q;
rep(i,h)rep(j,w){
cin>>grid[i][j]... | 0 | 82,161,565 |
#include <bits/stdc++.h>
using namespace std;
void mkprimes(int64_t N, vector<int64_t> &primes) {
vector<bool> isprime(N + 1);
for (int64_t i = 0; i <= N; i++) {
isprime[i] = true;
}
isprime[0] = false;
isprime[1] = false;
for (int64_t i = 2; i <= N; i++) {
if (isprime[i]) {
primes.push_back(i... | #include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> > v[1<<18];
int a[1<<18],tmp;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int m=(1<<n);
for(int i=0;i<m;i++)
cin>>a[i];
for(int i=0;i<m;i++){
v[i].push_back(make_pair(0,-1));
v[i].push_back(make_pair(a[i],i));
if(i... | 0 | 43,474,225 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
int row,col,thres;
cin>>row>>col>>thres;
vector<vector<int>> matrix(row, vector<int>(col));
vector<int> c(row);
for(int i=0;i<row;... | 0 | 67,507,992 |
#include <iostream>
using namespace std;
int main() {
int w,h,x,y;
cin>>w>>h>>x>>y;
double m = w*1.0*h*1.0/2.0;
bool mul = x+x==w && y+y==h;
cout<<m<<" "<<(mul?'1':'0')<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
ll l,r;
cin >> l >> r;
if(r-l >= 2018){
cout << 0 << endl;
return 0;
... | 0 | 45,407,554 |
#include <iostream>
#include <cstdlib>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
vector<string> split(const string &str, char sep) {
vector<string> v;
stringstream ss(str);
string buffer;
while( getline(ss, buffer, sep) ) {
v.push_back(buffer);
}
return ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
int main() {
ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
ll n,i,j,p,x,m,ans=0,maxi=0;
cin>>m... | 0 | 66,873,113 |
#include <iostream>
using namespace std;
int main(void) {
int houseList[3][10][4] = {};
int a, b, f, r, v, i;
cin >> a;
for( i = 0; i < a; i++ ) {
cin >> b >> f >> r >> v;
houseList[f - 1][r - 1][b - 1] += v;
}
int s, t, u;
for(s = 0; s < 4; s++ ) {
for(t = 0; t < 3; ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
sort(a.begin(), a.end(),... | 0 | 67,272,649 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<string> V... | #include<iostream>
using namespace std;
int main(){
int n,temp,cnt,minj;
while(cin >> n){
int k=0;
int a[n];
while(k!=n){
cin >> a[k];
k++;
}
cnt=0;
for(int i=0;i<n;i++){
minj =i;
for(int j=i;j<n;j++){
if(a[minj]>a[j]) minj =j;
}
if(minj!=i){
temp=a[minj];
a[minj]=a[i];
a... | 0 | 93,121,472 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(){
vector<int> ans;
while(1){
string str;
getline(cin,str);
if(str=="0") break;
int sum=0;
for(int i=0; i<(int)str.size(); i++){
sum+=str[i]-'0';
}
ans.push_back(sum);
}
for(int i=0; i<ans.size(); i++) cout<<ans[i]<<... | #include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i+=1)
#define reps(i,a,b) for(int i=a;i>=b;i-=1)
#define vi vector<int>
#define vvi vector<vector<int>>
#define pb push_back
#define pi pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define in1(x) int x; cin>>x;
#d... | 0 | 80,683,487 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define lint long long
#define setbits(x) __builtin_popcountll(x)
#define zrbits(x) __builtin_ctzll(x)
#define zlbits(x) ... | #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 /... | 0 | 86,966,109 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>
#include <set>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
int main() {
int n;
cin >> n;
int A[110];
rep(i,... | #include<stdio.h>
int main()
{
int H, N, i, sum=0;
scanf("%d %d", &H, &N);
int A[N+2];
for(i=1; i<=N; i++){
scanf("%d", &A[i]);
}
for(i=1; i<=N; i++){
sum += A[i];
if(sum >= H){
N=0;
break;
}
}
if(N==0)
printf("Yes\n");
... | 0 | 62,903,146 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD=1e9+7;
int main(){
long long n, a[300009], cnt[62];
cin >> n;
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<n;i++){
for(int j=0;j<60;j++){
if((a[i]>>j)&1)cnt[j]++;
}
}
long long base=1;
long long ans = 0;
for(int i=0;i<60;i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
ll N, K; cin >> N >> K;
vector<P> p;
rep(i, N){
int a, b; cin >> a >> b;
p.push_back(make_pair(a, b));
}
sort(p.begin(), p.end());... | 0 | 88,060,720 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include<bits/stdc++.h>
#include<vector>
#include<algorithm>
#include<iterator>
using namespace std;
void vp(vector<string> x,int a){
for(int i=0;i<a-1;i++){
printf("%s ",x[i].c_str());
}
printf("%s\n",x[a-1].c_str());
}
int main(){
int n;
string t="Stable", f="Not stable";
vector<string... | 0 | 15,197,241 |
#include <iostream>
using namespace std;
int main(){
int n;
long long a;
long long max=100000, min=-1000000,sum = 0;
cin >> n;
for (int i=0;i < n;i++){
cin >> a;
sum += a;
if (i == 0) {max = a; min = a;}
if (max <= a) max = a;
if (min >= a) min = a;
}
cout << min << " " << max << " " << sum << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
typedef long long ll;
typedef pair<int,int> pii;
int field[2005][2005];
int hcos[2005][2005];
int wcos[2005][2005];
int main(){
int h,w;
cin>>h>>w;
REP(i,h){
string s;
... | 0 | 62,506,136 |
#include <stdio.h>
int main (){
char a[100];
scanf("%[^\n]", a);
for ( int i = 0; a[i] != ','; i++ ){
printf("%c", a[i]);
}
printf(" ");
for ( int j = 6; a[j] != ','; j++ ){
printf("%c", a[j]);
}
printf(" ");
for ( int k = 14; a[k] != '\0'; k++ ){
printf("%c", a[k]);
}
return 0;
} | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | 0 | 89,768,986 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long int ll;
struct edge{ int to,cost; };
#define M (1e12+1)
int main(void){
ll v,e;
cin>>v>>e;
vector<vector<edge> > g(v);
vector<vector<ll> > ans(v,vector<ll>(v,M));
for(int i=0;i<v;i++){
ans[i][i]=0;
}
ll s,t... | #include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef _DEBUG
freopen("_in" , "r", stdin );
freopen("_out", "w", stdout);
#endif
int n, k; cin >> n >> k;
int ans = 0;
for (int i = 1; i <= n; i++) {
int t; cin >> t;
if (t >= k) ans++;
}
cout << ans << '\n';
} | 0 | 85,758,849 |
#include <iostream>
using namespace std;
int main() {
int n,x;
while(cin >> n >> x, n || x) {
int sum = 0;
for(int i=1;i<n;i++)
{
for(int j=i+1;j<x-i;j++)
{
int k = x-i-j;
if(j<k && k<=n) {
sum += 1;
... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <list>
using namespace std;
list <long> L;
int main(){
long n; scanf("%ld",&n);
while (n--){
char tmp[20]; scanf("%s",&tmp);
string a; a = tmp;
if (a == "insert" || a == "delete... | 0 | 78,393,340 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = start; soeji > n... | 0 | 25,137,994 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=0;(i)<(n);i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define MOD 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b... | #include "bits/stdc++.h"
using namespace std;
void Main() {
int N;
cin >> N;
map<int, int> factorization;
for (int i = 2; i <= N; ++i) {
int n = i;
for (int j = 2; j * j <= i; ++j) {
while (n % j == 0) {
if (factorization.count(j) == 0) {
f... | 0 | 42,291,040 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitse... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | 0 | 39,792,632 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
string S;
cin >> S;
int N = S.size();
string key = "keyence";
bool yes = true;
for(int i = 0; i < 7; i++) {
if(S[i] != key[i]) {... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, A, B, C, X;
while (cin >> N >> A >> B >> C >> X,
N || A || B || C || X) {
vector<int> Y(N);
for (int i = 0; i < N; i++) cin >> Y[i];
int ans = -1, pos = 0;
for (int i = 0; i <= 10000; i+... | 0 | 40,097,948 |
#include <vector>
#include <iostream>
using namespace std;
struct UnionFind{
private:
vector<int> data;
public:
int N;
UnionFind(int n) : data(n, -1), N(n){}
bool unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return false;
--N;
if(data[y] < data[x]) swap(x,y);
data[x] += data... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 72,649,460 |
#include <iostream>
#include <string>
#include <stack>
using namespace std;
int main(){
string s;
while(getline(cin, s)){
if(s == ".") break;
stack<char> st;
for(int i = 0;i < s.length();++i){
if(s[i] == '(' || s[i] == '[') st.push(s[i]);
else if(s[i] == ')') {
if(st.size() && st.top() == '(') st.pop(... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define MOD 1000000007
#define fix(n) cout << fixed << setprecision(n)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for(long i=a; i<=b; ... | 0 | 110,727 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji < n; soeji++)
#define drept(soeji, start, n) for (int soeji = s... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll M = 998244353;
int main() {
int n;
cin >> n;
vector<int> dis(n);
rep(i,n) {
int x; cin >> x;
if(i==0&&x!=0) {
cout ... | 0 | 97,904,826 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF f... | #include <stdio.h>
using namespace std;
void output(int H[3][10]){
for(int i = 0; i < 3; i++){
for(int j = 0; j < 10; j++){
printf(" %d",H[i][j]);
}
printf("\n");
}
}
int main(){
int H1[3][10],H2[3][10],H3[3][10],H4[3][10],n,h_num,f_num,r_num,div_num;
for(int i = 0; i... | 0 | 38,563,587 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
typedef long long ll;
int main(){
string str;
cin>>str;
int count=0;
for(int i=1;i!=str.size();++i){
if(str[i]!=str[i-1]){
++cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MA... | 0 | 99,998,219 |
#include <bits/stdc++.h>
using namespace std;
int n, s;
int solve(int cnt, int num, int sum) {
if(cnt == n) {
if(sum == s) return 1;
else return 0;
}
int ret = 0;
for(int i = num + 1; i <= 9; ++i) {
ret += solve(cnt + 1, i, sum + i);
}
return ret;
}
int main() {
while... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 0 | 45,961,815 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main() {
ll X, Y;
cin >> X >> Y;
int a = X;
for(int i=1; ; i++) {
X *= 2;
if(X > Y) {
cout << i << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 0;
ans += abs(a[0]);
ans += abs(a[n-1]);
for(int i = 0; i < n-1; i++)
... | 0 | 45,600,912 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int N,l,ba=0,b=0,a=0,r=0;
string S;
cin >> N;
rep(i,N) {
cin >> S;
l = S.size();
rep(j,l-1)
if(S.substr(j,2) == "AB")
++r;
if(S.at(0)=='B' && S.at(l-1)=='A')
++ba;
else if(S.at(0) == 'B')
... | #include <iostream>
#include <vector>
#define REP(i, n) for(int (i) = 0; (i) < (n); ++(i))
using lli = long long int;
std::vector<int> A, B;
inline bool subset(int a, int b){
return (a | b) == b;
}
int main(void){
int n, k; scanf("%d%d", &n, &k);
A.resize(n); B.resize(n);
REP(i, n) scanf("%d%d", &A[i]... | 0 | 62,976,941 |
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
typedef long int li;
int main()
{
IOS;
string s,t;
cin>>s>>t;
string r=t+s;
cout<<r<<endl;
return 0;
} | #include <bits/stdc++.h>
const int N = 100;
int n, count[N];
bool solve() {
int d = n - 1;
while (!count[d]) {
d--;
}
for (int i = 0; i <= d; ++i) {
int x = std::max(i, d - i);
if (!count[x]) {
return false;
}
count[x]--;
}
for (int i = 1; i < d; ++i) {
int x = std::max(i, d - ... | 0 | 85,550,860 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int a, b, c = 0;
cin >> a >> b;
if(a >= 2){
c += a * (a - 1) / 2;
}
if(b >= 2){
c += b * (b - 1) / 2;
}
cout << ... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int a,b,m;
cin>>a>>b>>m;
int ref[a],mic[b];
for (int i=0;i<a;++i){
cin>>ref[i];
}
for (int i=0;i<b;++i){
cin>>mic[i];
}
int mini = INT_MAX;
for(int i=0;i<m;++i){
... | 0 | 24,022,354 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define endl '\n'
#define pb push_back
#define fi first
#define se second
typedef long long ll;
#define double long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr(a,b,c) for(int a=b; a<=c; a++)
#define rep(a,b,c)... | #include<iostream>
using namespace std;
int main(){
int n,count;
char ch[201];
while(cin>>n){
if(n==0)break;
n=2*n;
count=0;
for(int i=0;i<n;i++)
cin>>ch[i];
for(int i=0;i+3<=n;i+=4)
if((ch[i]=='l' && ch[i+1]=='u')&&(ch[i+2]=='r' && ch[i+3]=='u'))count++;
else if((ch[i]=='l' ... | 0 | 2,106,219 |
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<set>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1001001001
#define LLINF 1001001001001001001
#define mp make_pair
#define pb push_back
#define LLIandI pair<long ... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
vector<pair<int, int>> v;
for(int i = 2; i <= n; i++){
bool sosu = true;
for(int j = 0; j < v.size(); j++){
int x = v[j].first, y = i;
while(y % x == ... | 0 | 50,942,124 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define LOG(variable) cout << #variable":\t" << (variable) << endl
#define LOGCON(i, container) for(int (i) = 0; (i) < (container).size(); ++(i)) cout << (i) << ":\t" << (container)[(i)] << endl
#define REP(i, n) for (int i = 0; i... | #include <iostream>
using namespace std;
long long MOD = 1000000000 + 7;
long long fctm(long long x) {
long long result = 1;
for (long long i = 1; i <= x; i++) {
result = result * i % MOD;
}
return result;
}
long long powm(long long x, long long p) {
if (p == 0) return 1;
long long tmp = x * x % MOD;
... | 0 | 75,020,122 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int N;
cin >> N;
if (N % 2 == 0) {
cout << N / 2 - 1 << endl;
}
else {
cout << N / 2 << endl;
}
} | #include<iostream>
#include<map>
using namespace std;
int main(){
long H,W,N;
cin >> H >> W >> N;
long ans[10];
for(int i=0; i<10; i++) ans[i] = 0;
ans[0] = (H-2)*(W-2);
map<pair<int,int>,int> m;
for(int t=0; t<N; t++){
long a, b;
cin >> a >> b;
for(int i = -1; i < 2;... | 0 | 83,741,664 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int count=0;
string s,t;
cin>>s>>t;
for(int i=0;i<3;i++){
if(s[i]==t[i]){
count++;
}
else{
continue;
}
}
cout<<count;
return 0;
} | #include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
void b(int a,int count){
if(a == 1){
if(count%5==1) cout <<".";
else if(count%5==2) cout <<",";
else if(count%5==3) cout <<"!";
else if(count%5==4) cout <<"?";
e... | 0 | 61,086,248 |
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
#include <cmath>
using namespace std;
#define vsort(vec) sort(vec.begin(), vec.end())
#define vreverse(vec) reverse(vec.begin(), vec.end())
using ll =long long;
const ll INF =1001001001;
ll gcd(ll a, ll b){
if (a%b==0){
return(b);
}else{
... | #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 rep(i, n) for... | 0 | 39,970,198 |
#include<iostream>
using namespace std;
int n,s;
int dfs(int cou,int now,int before);
int main(){
while(1){
cin >> n >> s;
if(n == 0 && s == 0) break;
int ans = 0;
for(int i=0;i<10;i++){
ans = dfs(0,0,-1);
}
cout << ans << endl;
}
}
int dfs(int cou,int now,int before){
if(cou==n) {
... | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
using ll=long long;
using pint=pair<int,int>;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i... | 0 | 16,257,927 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
void solve() {
cin >> N;
N--;
cout << (1 + N) * N / 2 << endl;
}
int main() {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,n) for(int i=1;i<(int)(n);i++)
typedef long long ll;
using namespace std;
int main()
{
ll n;
string s[100];
ll cnt[26];
cin>>n;
rep(i,n){
cin>>s[i];
sort(s[i].begin(),s[i].end());
}
ll min;
... | 0 | 45,960,308 |
#include <iostream>
static void print_ints(const int as[], const unsigned int n) {
const char* sep = "";
for (unsigned int i = 0; i < n; ++i) {
std::cout << sep << as[i];
sep = " ";
}
std::cout << std::endl;
}
static unsigned int swap_count = 0;
static void print_swap_count(void) {
std::cout << swap_c... | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <limits.h>
#include <float.h>
#include <numeric>
#include <queue>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int myabs(int x){
if(x < 0){
x = -x;
... | 0 | 79,501,957 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int a,b;
scanf("%d %d", &a, &b);
printf("%d", 6-a-b);
return 0;
} | #include<cstdio>
using namespace std;
int main()
{
int a,b,c;
while(scanf("%d%d%d",&a,&b,&c)!=EOF)
{
int ans;
if(a==b&&a==c)
ans=1;
else if(a!=b&&a!=c&&b!=c)
ans=3;
else
ans=2;
printf("%d\n",ans);
}
return 0;
} | 0 | 34,118,404 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int n, l;
int a[5... | #include<iostream>
#include<string>
#include<cstdio>
#include<stdio.h>
using namespace std;
int main(){
int sum=0;
string str;
while(1){
getline(cin,str);
for(int i=0;i<str.size();i++){
str[i]-='0';
sum+=str[i];
}
if(str[0]==0)break;
cout<<sum<<endl;
sum=0;
}
return 0;
} | 0 | 88,236,961 |
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 10000000... | #include<iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
long long ans=0;
for(long long i=1;i<=n;i++)
{
long long no=n/i;
long long lst=no*i;
long long res=no*(i+lst);
re... | 0 | 21,065,599 |
#include<bits/stdc++.h>
using namespace std;
int main(){
char X,Y;
cin>>X>>Y;
if(X<Y)
cout<<'<'<<endl;
else if(X==Y)
cout<<'='<<endl;
else
cout<<'>'<<endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef long double lld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
#define MOD 1000000007
int main(void) {
... | 0 | 35,776,619 |
typedef long long ll;
typedef long double LD;
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, K;
cin >> N >> K;
N-=K;
int sol = 0;
if(N<=0){
cout << "1\n";
} else {
sol = 1 + (N/(K-1));
if(N%(K-1)!... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<double> vec(n + 1);
cout << fixed << setprecision(6);
for (int i = 1; i <= n; i++)
{
cin >> vec[i];
}
double ans = 0;
for (int i = 1; i < n; i++)
{
sort(vec.begi... | 0 | 38,429,706 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[101][101]={};
int n,u,k,v;
cin>>n;
for(int i=0;i<n;i++){
cin>>u>>k;
for(int j=0;j<k;j++){
cin>>v;
a[u][v]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n-1;j++)
cout<<a[i+1][j+1]<<' ';
cout<<a[i+1][n]<<endl;
... | #include <iostream>
#include <queue>
#include <climits>
#define REP(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef pair<int,int> pii;
int main()
{
int H, W, N;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
cin >> H >> W >> N;
char map[H][W];
int d[H][W], hp = 1, ans = 0;
fill(d[0],d[H],INT... | 0 | 85,459,822 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector < vector<ll> > Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
map<int, int> a;
REP(i, n) {
int tmp;
cin >> tmp;
a[tmp]++;
}
vector<int> tmp(a.size());
... | 0 | 82,851,442 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
string s;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin >> s;
if(s == "snuke"){
cout << (char)('A'+j-1) << i << endl;
}
}
}
} | #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 = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 95,956,359 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, a, b;
int main() {
ll i, j, k=0, z;
cin >> n >> a >> b;
if(n < a+b-1 || n > a*b) return puts("-1")*0;
for(i=a-1; i>=0; i--) {
z = min(b, n-i);
for(j=0; j<z; j++) printf("%lld ", k+z-j);
k += z;
n -= z;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | 0 | 74,150,938 |
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
const int N = 8003;
string s;
int x, y;
vector <pii> a, b;
bool canx[N][2 * N], fCanx[2 * N];
bool cany[N][2 * N], fCany[2 * N];
void make(string s, vector <pii> &a, vector <pii> &b) {
a.clear(); b.cle... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
vector<vector<char>> ans;
for (int i = 0; i < 50; i++) ans.push_back(vector<char>(100, '#'));
for (int i = 0; i < 50; i++) ans.push_back(vector<char>(100, '.'));
a--, b--;
for (int i = 0; a > 0; i += 2) {
... | 0 | 29,091,220 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int h, w, m, r, c;
cin >> h >> w >> m;
vector<int> r_cnt(h), c_cnt(w);
vector<pair<int, int>> targets(m);
for (int i = 0; i < m; ++i) {
cin >> r >> c; --r, --c;
r_... | #include<iostream>
using namespace std;
int main(){
string s,p;
int s_num = 0;
int p_num = 0;
bool discover =false;
getline(cin,s);
getline(cin,p);
string s_search = s+s;
for(int i = 0; i < s_search.length();i++){
if(s_search[i]==p[0]){
... | 0 | 54,837,193 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define ALL(a) (a).begin(),(a).end()
#define EACH(e,v) for(auto& e:v)
#define SORT(v) sort(ALL(v))
#define PERM(v) SORT(v);for(bool c##p=1;c##p;c##p=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
struct Node {
Node *parent;
vector<Node*> childs;
int num;
};
Node *root;
int main() {
root = new Node;
root->parent = root;
int n;
cin >> n;
Node *nodes[n];
for (int i = 0; i < n; i++) {
nodes[i] = new N... | 0 | 87,454,238 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
bool flag = true;
string A = S.substr(0, (N - 1) / 2);
string A_ = A;
reverse(A_.begin(), A_.end());
if (A_ != A) flag = false;
string B = S.substr((N + 1) / 2, (N - 1) / ... | #include <iostream>
#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 <random>
#include <iomanip>... | 0 | 53,922,805 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
void solve(){
string s;
cin>>s;
bool ans = false;
int n = s.size();
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
string ss = s.substr(0,i);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string ans = "No";
cin >> N;
for (int i=0;i<26;i++) {
for (int j=0;j<15;j++) {
if (4 * i + 7 * j == N) {
ans = "Yes";
break;
}
}
}
cout << ans << endl;
} | 0 | 50,228,224 |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const ll INF=1000000000LL;
const ll MOD=1000000007LL;
const ll MAX=100010;
int main(){
int n;
while(cin>>n,n){
vector<P> v;
for(int i=0;i<n;i++){
for(int j=0;j<2;j++){
int h,m,s;
scanf("%d:%... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 63,760,660 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inl... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#include<set>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;ind... | 0 | 95,066,013 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
long long n, a, b;
cin >>n >>a >>b;
if(n == 1){
if(a == b){
cout <<"1\n";
}
else{
cout<<"0\n";
}
}
else{
if(a > b){
cout <<"0\n";
}
else{
long long ans = (n - 2) * (b - a) + 1;
cout <<ans <<'\n';
... | #include <stdio.h>
#include <bitset>
using namespace std;
int dp[1010][1010];
bitset<1010> went[1010];
int min(int a,int b){
if(a>b)return b;
return a;
}
int dis(int n,int m,char l[],char r[]){
if(n<0&&m<0)return 0;
if(n<0)return m+1;
if(m<0)return n+1;
if(went[n][m])return dp[n][m];
went[n]... | 0 | 29,244,878 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.