code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int n, maxi;
int aoki[100005], lo[100005], up[100005];
long long score[100005];
bool higher[100005];
long long require;
long long ans, ans1, ans2;
vector<pair<long long, int> > chase;
int main(){
scanf("%d %d", &n, ... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num = ch & 15;
while(isdigit(ch = getchar())) n... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, long long K) {
cout<<N-K+1;}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
long long N;
scanf("%lld", &N... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(vec) vec.begin(),vec.end()
typedef... | #include<bits/stdc++.h>
using namespace std;
int main(){
int tt,ts,h,t,o,a,b,tmp,count=0;
cin>>a>>b;
for(int i=a;i<=b;i++){
tmp=i;
tt=tmp/10000;
tmp-=tt*10000;
ts=tmp/1000;
tmp-=ts*1000;
h=tmp/100;
tmp-=h*100;
t=tmp/10;
tmp-=t*10;
... | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>... | #include <bits/stdc++.h>
using namespace std;
int A[100050];
int n,l,q;
int dp[100050][20];
int main(){
//freopen("input.in","r",stdin);
cin >> n;
for(int i=1; i<=n; ++i) cin >> A[i];
cin >> l;
for(int i=1; i<=n; ++i) dp[i][0] = upper_bound(A+1,A+n+1,A[i]+l)-A-1;
for(int k=1; k<=18; ++k){
for(int i=1; i<=n; +... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char a,b,c;
cin>>a>>b>>c;
int ans = 0;
if(a=='R'&&b=='R'&&c=='R')
ans = 3;
else if((a=='R' && b=='R')|| (b=='R'&&c=='R'))
ans= 2;
else if(a=='R'||b=='R'||c=='R')
ans =1;
cout<<ans;
return 0;
}
| #include <iostream>
#include <string>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e-a<=k) {
cout << "Yay!";
}
else {
cout << ":(";
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
int main(){
ll counte=0,countw=0;
string str;
cin>>str>>str;
vector<ll> w((ll)str.size());
vector<ll> e((ll)str.size());
for(ll i=0;i<(ll)str.size();i++){
if(i==0)... | #include <bits/stdc++.h>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
const int INF = 1<<29;
using namespace std;
using ll = long long;
int main(){
int N , sum = 0;
string S;
cin >> N >> S;
for(int i = 0; i < N; i++){
if(S[i] == 'E'){
sum++;
}
}
int t = sum;
... | 1 |
#include <stdio.h>
int main(void)
{
int a[1010];
int b[1010];
int t[1010];
int ans[1010];
int i=0;
int j=0;
int n=0;
a[0] = 1;
for(;;)
{
scanf("%d",&t[j]);
if(t[j]==0)
{
break;
}
j++;
}
a[1]=1;
a[2]=2;
a[3]=4;
for(i=4;i<1010;i++)
{
a[i]=a[i-1]+a[i-2]+a[i-3];
a... |
#include<iostream>
#include<vector>
using namespace std;
int foot(int);
int main() {
int n;
vector<int>floor;
cin >> n;
while (n != 0) {
floor.push_back(n);
cin >> n;
}
floor.push_back(0);
int i = 0;
while (floor[i] != 0) {
int res = 0;
res = foot(floor[i]) / 3650;
if( foot(floor[i]) % 3650... | 1 |
#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>
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,n) for(int i=(a); i<(n); i++)
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
using P = pair<int ,int>;
const int INF = 1001001001;
const int MOD... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Dice{
public:
long top, front, right, left, back, bottom;
Dice(long top, long front, long right, long left, long back, long bottom);
void north();
void south();
void west();
void east();
void rightTurn();
void ChangeTop(long ... | //#define _USE_MATH_DEFINES //M_PI
#include <iostream> //std::cout, std::cin
//#include <string> //std::string
#include <vector> //std::vector
//#include <valarray> //std::valarray ??°????????????????¬???????
//#include <algorithm> //std::sort
//#include <time.h> //localtime_s
//#include <cstdlib> //abs
//... | 1 |
#include<bits/stdc++.h>
#define ld double
#define ull unsigned long long
#define ll long long
#define pii pair<int,int >
#define iiii pair<int,pii >
#define mp make_pair
#define INF 1000000000
#define MOD 1000000007
#define rep(i,x) for(int (i)=0;(i)<(x);(i)++)
inline int getint(){
int x=0,p=1;char c=getchar();
... | #include <iostream>
#include <map>
#include <cmath>
using namespace std;
int main() {
int n; cin >> n;
map<pair<int, int>, int> mp;
long long ans = 0;
for(int i = 0; i < n; i++) {
double num; cin >> num;
long long x = llround(num*1e9);
int two = 0, five = 0;
while(x % 2 == 0) two++, x /= 2;
... | 0 |
#include <iostream>
#include <string>
using namespace std;
const int kMaxFace = 6;
void PushWheel(int (&array)[kMaxFace], int a, int b, int c, int d)
{
int temp = array[a];
array[a] = array[b];
array[b] = array[c];
array[c] = array[d];
array[d] = temp;
}
class Dice
{
public:
Dice(const int (&... | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
string str;
string::size_type index;
int num;
int number;
int i,j;
cin >> num;
getline(cin,str);//ツ催渉可づ個づ「ツづつつセツつッツ禿づ敖債楪づ慊つケ
for(i=0;i<num;i++)
{
getline(cin,str);
number = 0;
while((index = str.find("Hoshino") ) != string::np... | 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <unordered_map>
using namespace std;
using Map = unordered_map<string, long>;
size_t n;
void dfs(string src, Map &m, size_t i=0, string s="", string t="") {
if (i == n){
m[s + ' ' + t]++;
} else {
dfs(src, m, i+1, s+src[i], t... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<ctime>
#include<map>
#include<bitset>
#include<set>
#include<assert.h>
#define LL long long
#define mp(x,y) make_pair(x,y)
#define pll pair<long long,long long>
#define pii pair<int,int>
#d... | 1 |
#include <iostream>
using namespace std;
int main()
{
int result = 0;
int numberOfPerson, turnOffDelay;
cin >> numberOfPerson >> turnOffDelay;
int lastSwitch = 0;
for (int i = 0; i < numberOfPerson; i++) {
int time;
cin >> time;
int delta = time - lastSwitch;
result += delta < turnOffDelay ? delta : t... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp>
//#include <functional> // for less
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF ... | 1 |
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
/* 大文字を小文字に変換 */
char tolower(char c) {return (c + 0x20);}
/* 小文字を大文字に変換 */
char toupr(char c) {return (c - 0x20);}
// if('A'<=s[i] && s[i]<='Z') s[i] += 'a'-'A';
/*
s... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<v<<"\n";
#define fi(v) get<0>(v)
#define se(v... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string s;
cin >> s;
if(s == "SUN") cout << 7 << endl;
else if(s == "MON") cout << 6 << endl;
else if(s == "TUE") cout << 5 << endl;
... | /*
** author:mahmoud magdy
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
inline int D()
{
int m ;
cin>>m;
return m ;
}
inline ll lD()
{
ll m ;
cin>>m;
return m ;
}
inline double dD()
{
double m;
cin>>m;
return m;
}
void fast()
{
ios_bas... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
int cnt=0;
for(int i=0;i<s.length();i++){
cnt++;
}
if(cnt<=k){
cout<<s<<endl;
}
else{
for(int i=0;i<k;i++){
cout<<s[i];
}
cout<<"..."<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int,int> PII;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(... | 0 |
#include<bits/stdc++.h>
int n,m,a[101],c[101],b[201],e,sum,now;
int main()
{
scanf("%d%d",&n,&m);
if(m==1)
{
printf("%d\n",n);
if(n==1)puts("1"),puts("1");
else puts("2"),printf("%d %d\n",n-1,1);
return 0;
}
for(int i=1;i<=m;++i)
scanf("%d",&a[i]),sum+=a[i],now+=a[i]/2;
now+=sum/2;
if(now<sum-1)puts("I... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) (... | 1 |
#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;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[... | #include<bits/stdc++.h>
using namespace std;
int f[100][100];
int main(){
int a,b,i,j,k,s,t;
scanf("%d%d",&a,&b);
//a>=b
if(a==0){
printf("1 1\n#\n");
return 0;
}
if(b==0){
printf("1 1\n.\n");
return 0;
}
printf("100 100\n");
for(i=0;i<50;i++)for(j=0;j... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << ... | #include<bits/stdc++.h>
using namespace std;
const int inf=1000000000;
int N=1000000;
vector<int>d(N,-inf);
vector<int>check(N,0);
vector<vector<int>>e(N);
int dfs(int v){
if(d[v]!=-inf)return d[v];
if(e[v].size()==0)return d[v]=1;
for(int i=0;i<e[v].size();i++){
int u=e[v][i];
if(check[u]==... | 1 |
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int N, X;
ll S[200];
ll dp[201][100000 + 1];
int main() {
cin >> N >> X;
for (int i = 0; i < N; i++)cin >> S[i];
sort(S, S + N, greater<ll>());
dp[0][X] = 1;
for (int i = 0; i < ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pd... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>
#define PI 3.141592653589793
const int INF = 1001001001;
const ll MX = 1e18;
const int mod = 1000000007;
int main() {
int k,x;
cin >> k >> x;
rep(i, k + k - 1) {
cout << x... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
using namespace std;
typedef long long LL;
static const double EPS = 1e-9;
#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
bool primecheck(int n){
FOR(i,2,n/2)
if(n%i ==... |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(void)
{
int n;
cin >> n;
getchar();
for(int i=0;i<n;i++){
string s;
getline(cin,s);
for(int j=0;j<(int)s.size()-6;j++){
string hos = s.substr(j,7);
if(hos == "Hoshino"){
s[j+6] = 'a';... | 0 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long dou... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin >> n && n){
for(int i = 0; i < n; ++i){
int pm, pe, pj;
cin >> pm >> pe >> pj; // ??°????????±????????????
char ans = 'C';
... | 0 |
#include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int... | /*
* src.cpp
*
* Created on: 2016/08/04
* Author: joi
*/
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=1e4;
int n;
int p[3];
char out[MAX_N+5];
int main(){
do{
cin>>n;
if (n){
REP(i,n){
int ave=0;
b... | 1 |
//============================================================================
// Name : JOI.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostr... | #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#... | 0 |
#include <bits/stdc++.h>
using namespace std;
long long a,b,x,y,k
;
int main(){
cin>>a>>b;
for(long long i=a;i<=b;i++){
if(i%10==i/10000){
x=i/10;
y=i/1000;
if((x%10)==(y%10))k++;
}
}
cout<<k;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint... | 1 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chm... | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define srep(i,n,m) for(int i=n;i<m;i++)
#define elif else if
#de... | #pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
int main(){
string s;
cin >> s;
int a = s.at(0) - '0', b = s.at(1) - '0', c = s.at(2) - '0', d = s.at(3) - '0';
for(int i = 0; i < 8;i++){
bitset<3> s(i);
vector<char> fugou(3);
int temp... | #include <iostream>
using namespace std;
int order[4000];
bool search(int);
class Member {
public:
Member() {sum = 0;}
void add(long price, long num) {
sum += (long long int)price*num;
}
bool milion()
{
if (sum >= 1000000) return true;
else return false;
}
private:
long long int sum;
int id;
};
... | 0 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define IN... | 1 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (in... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define whole(xs) (xs).begin(),(xs).end()
template<class T>
ostream& operator<<(ostream& os, const vector<T>& xs) {
if (xs.empty()) return os << "[]";
os << "[" << xs[0];
for (int i = 1; i < xs.size(); i++) os << ' ' << xs[i]... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,m;
while(cin >> n >> m,n){
int p[1000],sum = 0;
for(int i = 0;i < n;i++) cin >> p[i];
sort(p,p + n,greater<int>());
for(int i = 0;i < n;i++){
if(i % m != m - 1) sum += p[i];
}
cout << sum << endl;
}
return 0;
} | // abc060_c
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<queue<char>> s(3);
for(int ix=0;ix<3;ix++){
string tmp;
cin >> tmp;
for(int ixx=0;ixx<tmp.size();ixx++) s.at(ix).push(tmp.at(ixx));
}
char card;
int turnplayer = 0;
while(!s.at(turnplayer).empty()){
... | #include<iostream>
#include<vector>
#include<set>
#include<utility>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<algorithm>
#include<cinttypes>
#include<stack>
#include<ctgmath>
using namespace std;
typedef long long ll;
#define ceil(a,b) ( !(a%b) ? a/b : a/b+1 )
#define all(a) (a... | 1 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
int main() {
int n, m;
int s, c;
int ans = 0;
cin >> n >> m;
vector<int> a(3);
a[0] = a[1] = a[2] = 10;
rep(i, m) {
cin >> s >> c;
if (a[s - 1] != 10 && a[s - 1] != c) {
cout << -1 << endl;
... | #include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 20000000000000000
#define mod 998244353
#define ull unsigned long long int... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define Rep(i,N) for(int i = 0; i < N; i++)
int main()
{
string s;
int maxv = 0;
int m[3] = {'J','O','I'};
cin >> s;
int i = 0;
while(i < s.size()) {
if(m[0] == s[i]) {
int count[3] = {0};
Rep(j,3)for(; m[j] == s[i]; i++, count[j]++);
if(... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int anse... | 0 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
type... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
int A,B; cin >> A >> B; // Aが白
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(inti=a;i<=b;i++)
#define MOD 1000000007
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main(){
string s ;
cin>>s;
int ans = s[0]-'0';
for(int o... | #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;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
c... | 1 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; j <= i;... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
//#include<bits/stdc++.h>
#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 I... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N,K;
while( cin >> N >> K){
if( N == 0 && K == 0){ break;}
vector<string> P(N);
for(int i = 0; i < N; i++){ int c; cin >> c; P[i] = to_string(c);}
set<string> s;
if( K == 2){
for(int i = 0; i... | #include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP... | 0 |
#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;
#define rep(i, a) for (int i = 0; i < (a); i++ )
#define FOR(i, m, n) for(int i = m; i < n; i++)
typedef pair<int,int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI=acos(-1);
int main(){
ll N;
cin >> N;
l... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = n; i >= 0; --i) {
string u = s;
for (int j = i; j < n; ++j) u += t[j];
bool same_t = true;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a,s,d;
cin>>a>>s>>d;
if(a<=s*d){
cout<<"Yes";
}else{
cout<<"No";
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#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--)
#define int long long
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
int ans;
cin >> x;
ans = pow(x, 3);
cout << ans << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll N; cin >> N;
vector<ll> A(N), B(N);
REP(i, N)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
void ALLIN1_NUMBER(vector<ll>& V)
{
for(auto& x : V)
{
cin >> x;
}
}
template<class T>
void OUT0(T N)
{
cout << N << endl;
}
static const double pi = acos(-1.0);
double Cos(double D)
{
... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
using namespace std;
int n;
int res = 0;
struct node {
int id;
int parent;
};
node v[100];
vector<tuple<int, int, int>> cost;
vector<int> path;
int find(node x){
if(x.parent =... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
const int INF = 10000;
template<typename ISTREAM>
void readWeightedGraphMatrix(ISTREAM& cin, vector< vector<int> >& weightedGraphMatrix) {
size_t n;
cin >> n;
int weight;
weightedGraphMatrix = vector... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
typedef pair<int, int> P;
typedef pair<ll, P> PP;
int main() {
int N, M;
cin >> N >> M;
map<P, vector<PP>> G;
map<P, ll> dist;
for ... | #include <bits/stdc++.h>
#define sc(x) scanf("%d", &x)
#define pr(x) printf("%d\n", x)
#define lowbit(x) (x & -x)
#define ll long long
#define N 500010
using namespace std;
ll tot = 0, head[N], v[N], dis[N], n, m, cnt;
struct Xiao
{
int next, to, w;
}f[N * 3];
void add(int x, int y, int z)
{
f[++tot].to = y;
f[tot].... | 1 |
#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 DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using nam... | #include <bits/stdc++.h>
using namespace std;
int main() {
long h,w,k,mod=1000000007;
cin >> h >> w >> k;
if(w==1) {
cout << 1 << endl;
return 0;
}
vector<long> sayu(w-1),sonomama(w);
vector<vector<long>> amida(h+1,vector<long>(w));
amida[0][0]=1;
for(long bit=0;bit<(1<<(w-1));bit++) {
boo... | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <s... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define loop(i,n) rep(i,0,n)
using namespace std;
using ll = long long;
constexpr double pi=3.1415926535897932;
int main(){
int n;
cin >> n;
vector<double> x(n),y(n);
loop(i,n)cin >> x[i] >> y[i];
loop(i,n){
vecto... | 1 |
#include <stdio.h>
struct Dice {
int face1, face2, face3, face4, face5, face6;
};
void roll_for_E(struct Dice *dice);
void roll_for_N(struct Dice *dice);
void roll_for_S(struct Dice *dice);
void roll_for_W(struct Dice *dice);
int main(void)
{
struct Dice dice;
char ch;
scanf("%d%d%d%d%d%d", &(dice.face1), &(... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <utility>
typedef long long ll;
using namespace std;
const int mod=1e9+7;
ll solve(){
ll sm=0,ans=0;
ll n,t=0;
cin>>n;
int a[n];
for(int &i:a) cin>>i,sm=(sm+i)%mod;
for(int i=0;i<n;i++){
t=(t+a[i])%mod;... | 0 |
#include <iostream>
using namespace std;
char m[12][13];
void dfs(int x, int y)
{
int i, j, nx, ny;
m[y][x] = '0';
for (i = 1; i >= -1; i--)
{
if (i == 1 || i == -1)
{
nx = x;
ny = y + i;
if (0 <= nx && nx < 12 && 0 <= ny && ny < 12 && m[ny][nx] == '1') dfs(nx, ny);
}
else
{
for (j = 1; j >= -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define INF -1000000000000000
#define pb push_back
#define sz(a) int((a).size())
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begi... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int counter=1;
int cnt=0;
while(counter<b){
counter--;
counter+=a;
cnt++;
}
cout<<cnt<<endl;
} | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstring>
#include<queue>
#include<tuple>
#include<utility>
#include<map>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long doub... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
/*
string s1;
getline( cin, s1 );
int n1 = s1.size();
*/
int a, b;
cin >> a >> b ;
if( 2*a <= 16 && 2*b <= 16 ){
cout << "Yay!" << endl;
}
else {
cout << ":(" << endl;
}
... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functio... | #include <iostream>
#include <string>
#include <cstring>
#include <sstream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <chrono>
#include <numeric>
#include <set>
#define _USE_MATH_DEFINES
#include <cmath>
#include <math.h>
#include <iomanip>
#include <list>
#inc... | 0 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+1;
double s[N];
int n,m;ll k;
int a[N],p[N],u[N],tmp[N];
int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
int main()... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
//{{{ templates
#define TMPINL_(...) template<__VA_ARGS__>inline
#define TT_ TMPINL_(typename T)
#define TTF_ TMPINL_(typename T,typename F)
#define TTTS_ TMPINL_(typename T,typename...Ts)
#define ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
/*2進数配列+1*/
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
... | 0 |
#include<cstdio>
#define int long long
int D;
int calc(int A,int t,int first){
if(!t)return A==0;
int v=(A%10+10)%10;
int res=0;
res+=(10-v-first)*calc((A-t*v)/10,t/100,0);
res+=(v-first)*calc((A+(10-v)*t)/10,t/100,0);
return res;
}
signed main() {
scanf("%lld",&D);
if(D%9)return puts("0"),0;
D/=9;
int... | #include <iostream>
using namespace std;
int func(int y,int z,int e){
return y+z+e-y*y-z*z*z;
}
int main(){
int e;
while(cin>>e){
if(e==0)break;
int min=10000000;
for(int y=0;y*y<=e;y++){
for(int z=0;(z*z*z+y*y)<=e;z++){
int ans = func(y,z,e);
// cout<<"y="<<y<<"z="<<z<<endl;
if(ans<=... | 0 |
#include<iostream>
#include<vector>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
int main(){
long long int x;
cin>>x;
long long int sum;
sum = (x/500)*1000;
x -= (x/500)*500;
sum += (x/5)*5;
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define Opy ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
int main()
{
//Opy;
/*-------------------------------------------------
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", ... | 1 |
//
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#i... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#include<cassert>
#include<numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
const int INF = 1001001001;
const long long LINF =... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
int main()
{
fastread();
ll n,m;
cin>>n>>m;
ll a,b;
cin>>a>>b;
for(ll i=0;i... | /*
Motto - try hard to become an expert
*/
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
//define
#define rep(i,n) for(int i=0;i<n;i++)
#define repu... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
string s;
vector<vector<char>> v(h+2, vector<char>(w+2));
for(int i=0; i<h+2; i++) {
if(i==0 || i==h+1) for(int j=0; j<w+2; j++) v[i][j] = '.';
else {
cin >> s;
for(int j=0; j<w+2; j++) {
if(j==... | #include <iostream>
#include <vector>
//#define rep(i,n) for(int i = 0; i , (n); ++i)
using ll = long long;
using namespace std;
int sum(int n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
int main() {
int N, W;
cin >> N >> W;
vector<vector<char>>A(N, vec... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll A, B;
cin >> A >> B;
cout << max({A... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
while(cin >> a >> b )
{
cout << max(a+b,max(a-b,a*b)) << endl;
}
}
| 1 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <cstdlib>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pai... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
template<class T> inline b... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
int main()
{
int r,g;
cin>>r>>g;
cout<<((g*2)-r);
cout<<nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll A,B;
cin>>A>>B;
ll ans=0;
for(ll i=A;i<=B;i++) {
string S=to_string(i);
if(S[0]==S[4]&&S[1]==S[3]) {
ans++;
}
}
cout<<ans<<endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
const int INF = 1e9;
const ll INFll = 1e18;
#define put(n) cout<<(n)<<endl
#define Cout(n) cout<<(n)
#define rep(i,num,N) for(int(i)=(num);(i)<(N);++(i))
#define rrep(i,num,N) for(int (i)=(num);(i)>(N);--(i))
#define all(v) (v).be... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define nl '\n'
#define AC ios_base::sync_with_stdio(0); cin.tie(NULL);
using namespace std;
const int MOD = 998244353;
const int N = 2*1e5;
int main(){
AC
int n, m;
cin>>n>>m;
if(n%2!=0){
for(int i=1; i<=m; i++){
cout<<... | /*input
8 3
*/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
int l = 1, r = n;
for (int i = 1; i <= m; ++i) {
if (n%2 == 0 && i == n/2/2+1) l++;
cout << l << " " << r <... | 1 |
///not today
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef pair<long long, long long> pll;
#define SZ(x) (int)(x).size()
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int x;
x = 1;
for(int i = 0; i < N; i++){
if(2 * x > x + K)
x = x + K;
if(2 * x <= x + K)
x = 2 * x;
}
cout << x << endl;
} | 0 |
#include <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
using namespace std;
int main() {
int year[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
string day[7] = {"Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"};
int ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 10005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef do... | 0 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main() {
int a,b,sa;
cin>>a>>b;
sa = max(a+b,a-b);
sa = max(a*b,sa);
cout<<sa;
return 0;
} | //Radhe Radhe
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,a,b,c,d,j,k;
cin>>a>>b>>c;
cout<<max(a+b,max(a*b,a-b));
return 0;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int N, A[1000000], cnt;
void Out(const vector<int> G) {
cout << G.size() << endl;
cout << G.back();
for (int i = G.size() - 2; i >= 0; i--) {
cout << ' ' << G[i];
}
cout << endl;
cout << cnt << endl;
for (int i = 0; i < N; i++)
cout << A[i] << endl;
}
void Inse... | #include<bits/stdc++.h>
using namespace std;
#define IL inline
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define repd(i,j,k) for(int i=j;i>=k;--i)
#define pb push_back
#define db double
#define mp make_pair
#define mp3(a,b,c) mp(mp(a,b),c)
#define pii pair<int,int>
#define piii pair<pii,int>
#define fr first
#define se ... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#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 rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define VIEW(x) do {cerr << #x << ": "; for(auto i : x) cerr << ... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define ALL(x) (x).begin(),(x).end()
using namespace std;
const int MAXN = 200005;
int main()
{
int n,k;
scanf("%d%d",&n,&k);
vector<int>A(n);
for(int i=0;i<n;i++){
cin >> A[i];
}
int flag= 1;
while(k--&&fl... | 0 |
#include <iostream>
const int N = 7;
typedef struct {
int panels[N];
int upper;
int east;
int south;
} Dice;
void rotate_dice(int *x, int *y, int d) {
*x = *y;
*y = d;
}
int main(void) {
Dice dice;
for (int i = 1; i < N; i++) {
std::cin >> dice.panels[i];
}
dice.upper = 1;
dice.east = 3;... | /*___________Bismillahir Rahmanir Rahim__________*/
//Think positive, be positive and never use negative words
#include<bits/stdc++.h>
#define ll long long int
#define uni(a) a.erase(unique(a.begin(),a.end()),a.end())
#define vsum(a) accumulate(a.begin(),a.end(),0)
#define vmax(a) ... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int A, B, M;
std::cin >> A >> B >> M;
std::vector<int> a(A), b(B), x(M), y(M), c(M);
rep(i, A) std::cin >> a[i];
rep(i, B) std::cin >> b[i];
rep(i, M) {
std::cin >> x[i] >> y[i] >> c[i];
... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include "bits/stdc++.h"
#include "math.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll,ll> P;
typedef vector<P> vp;
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define SIZE(a) int(... | // Phttps://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<b... | 1 |
#include<iostream>
#include<stdlib.h>
using namespace std;
int main (){
int n, m;
int b, count, answer;
int *list, *result;
list = (int*)malloc(sizeof(int)*n);
result = (int*)malloc(sizeof(int)*n);
cin >> n >> m;
for(int i = 0; i<n; i++){
cin >>list[i];
result[i] = 0;
}
for(int i= 0; i< m; ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for(int i = 0; i < n; i++) {
int score = 0;
int out = 0;
int first = 0;
int second = 0;
int third = 0;
while(1) {
string str;
cin >> str;
if(str == "HIT") {
score += third;
thi... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#define MAX_N (1000L)
#define NUM_MOD (1000000007L)
using namespace std;
long mod_pow(long n, long k, long mod) {
long res = 1, num = n;
while (k > 0) {
if (k % 2 == 1) {
res = res * num % mod;
}
k /= 2;
num = num * num % mod;
}
... | /**
*Makacha
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read (T &x) {bool b = 0; char c; while (!isdigit (c = getchar()) && c != '-');
if (c == '-') c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x<<3) + (x<<1) + c - 48; if (b)x=-x;}
template <typenam... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a,b,c,d;
int pnt[1000]={};
for(int i=0;i<(n*(n-1)/2);i++){
cin>>a>>b>>c>>d;
if(c>d) pnt[a]+=3;
else if(d>c)pnt[b]+=3;
else if(d==c) pnt[a]++,pnt[b]++;
}
int vic[1000];
for(int i=1;i<=n;i++){
int cnt=1;
for(int j=1;... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
int n;
const int INF = 1 << 29;
typedef pair<int,int> P;
vector<P> teams;
bool sortSecond(c... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a;
int dp[n];
int ans=0;
for(int i=0;i<n;i++)dp[i]=1e9;
for(int i=0;i<n;i++){
cin >> a;
a *= (-1);
*upper_bound(dp,dp+n,a)=a;
}
cout << lower_bound(dp,dp+n,1e9)-dp;
} | /*
https://atcoder.jp/contests/abc134/tasks/abc134_e
N個同時に最小部分列を作る
部分列では常に増加
dp[][]がある
a[i]を見た時, どこを更新するべきか?
30 40 50 60
新たに20が来た
30 40 50 60
20
新たに45が気来た
30 40 50 60
45
vs
30 40 45
50 60
どちらも嬉しさは変わらない 前者の方がいい
最後尾に対して数列を持っておくと,
最後尾のうちxより小さい最大のものをxに更新
条件を満たすものがなければ追加
だから全部-1にしておいて,
20
10
-1
-1
[30が来たら]
30
10
-1
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, M;
int tr[21][21];
while(true){
scanf("%d", &N);
if(N == 0) break;
for(int i = 0; i <= 20; i++){
fill(tr[i], tr[i] + 21, 0);
}
for(int i = 0; i < N; i++){
int x, y;
s... | #include <iostream>
using namespace std;
int main()
{
int n;
do {
cin >> n;
int score_a = 0, score_b = 0;
for (int i = 0; i < n; i++) {
int inp_a, inp_b;
cin >> inp_a >> inp_b;
if (inp_a == inp_b) {
score_a += inp_a;
score_b += inp_b;
}
else {
(inp_a>inp_b ? score_a : score_b) += inp... | 0 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define vll v... | 1 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<string>
#include<map>
#include<vector>
using namespace std;
int main(){
int n,anum,bnum;
int as, bs;
as = bs = 0;
while(1){
scanf("%d",&n);
if(n == 0) break;
for(int i = 0 ; i < n ; i++){
scanf("%d%d",&anum,&... | #include <iostream>
//#include <algorithm>
//#include <vector>
//#include <stack>
//#include <queue>
//#include <map>
//#include <cmath>
//#include <string>
//#include <sstream>
//#include <iomanip>
//#include <complex>
using namespace std;
//#define ll long long
//#define vvi vector< vector<int> >
//#define All(X) X... | 0 |
#include <iostream>
#include <vector>
#include <set>
using namespace std;
const int maxN = 500;
long long gcd(long long a, long long b){
return a%b ? gcd(b, a%b) : b;
}
long long lcm(long long a, long long b){
return a/gcd(a, b)*b;
}
vector<vector<int>> getPrimes(){
vector<int> p(100000, 1);
vector... | #include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const int Mod=998244353;
int k,n,ans[4100],C[4100][4100];
int calc(int x,int k,int n){
int tmp,sum=0;
for (int i=0;i<=(x-1)/2&&n-i*2>=0;i++){
if (!k) tmp=0;
else tmp=(ll)C[(x-1)/2][i]*C[n-i*2+k-1][k-1]%Mod;
if (i&1) sum=(sum-tmp+Mo... | 0 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
template <typename T>
void print_vec(const vector<T>& v, bool is_reverse=false, ll num=0){
if(num == 0) num = (ll)v.size();
if(is_reverse) for(ll i=num-1; i>=0; i--){ cout<<v[i]; if(i!=0) cout<<" ";}
else for(ll i=0; i<num; i++){ cout<<v[i]; if(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
vector<int>x(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i);
}
vector<int>A(N-K+1);
for (int i = K-1; i < N; i++) {
A.at(i-K+1) = x.at(i) - x.at(i-K+1);
A.at(i-K+1) += min(abs(x.at(i)),abs(x.at(i-K+1)));... | 1 |
//----------------------------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <iomanip>
#include <ios>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
//----------------------------------------------------------------------
using namespace std;
us... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define ld long double
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define fo(i, l, r) for (int i = l; i ... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i < b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int ans=0;
for(int i=0;i<s.size();i++){
if(s[i]!='J') continue;
else{
int now=i+1;
int J=1,O=0,I=0;
int flag1=1,flag2=0;
while(s[now]=='J'){
//cout<<now<<endl;
J++;
now++;
}
while(s[now]=='O... | 0 |
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#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>,i... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
//typedef __int64 LL;
//typedef long long int LL;
typedef pair<int,int> P;
//typede... | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#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; ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char str;
int n[3]={},ans=0,x;
while(cin>>str){
if(str=='J'&&n[1]==0&&n[2]==0)n[0]++;
else if(str=='O'&&n[1]<n[0]&&n[2]==0)n[1]++;
else if(str=='I'&&n[2]<(x=min(n[0],n[1]))){
n[2]++;
if(n[2]==x)ans=max(ans,x);
}
else{
for(int i=0;i<3;i++)n... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
string str;
int ret=0;
vector<pair<char,int> > v;
cin >> str;
int cnt=1;
char tmp=str[0];
for(int i=1;i<str.size();++i){
if(str[i] == tmp){
cnt++;
}els... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<pair<int, int>> graph[100001];
int ans[100001];
signed main() {
//Ввод графа и вершины start.
int n;
cin >> n;
for (int i = 1; i < n; i++) {
int a, b, c;
cin >> a >> b >> c;
--a, --b;
graph[a].push_back({b, c});
graph[b].push_ba... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
ll N, M, Q, sum[510][510], lr[510][510];
int main(int argc, char **argv)
{
cin ... | 0 |
#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define REP(i,n) for(int i=0; i<n; i++)
int main()
{
string str;
// string roman[] = {"I", "V", "X", "L", "C", "D", "M"};
map<char, int> roman;
roman['I'] = 1;
roman['V'] = 5;
roman['X'] = 10;
roman['L'] = 5... | #include <iostream>
using namespace std;
int main()
{
char rome[110];
int num, ara, nu;
while(cin >> rome){
num = ara = nu = 0;
for(int i = 0; rome[i] != '\0'; i++){
if (rome[i] == 'I') num = 1;
else if (rome[i] == 'V') num = 5;
else if (rome[i] == 'X') num = 10;
else if (rome[i] == 'L') num = 50;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
string reply;
cin >> a >> b >> c >> d;
a += b;
c += d;
if (a > c) {
reply = "Left";
} else if (a == c) {
reply = "Balanced";
} else {
reply = "Right";
}
cout << reply << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl;
#define INF 1ll<<60;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,i,n;
cin>>a>>b;
n=((a*2)-1)/2;
for(i=0;i<n;i++)
{
a--;
cout<<b-a<<" ";
}
cout<<b<<" ";
a=0;
for(i=n+1;i<2*n+1;i++)
{
a++;
cout<<b+a<<" ";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORD(i, m, n) for (int i = m; i >= n; --i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REP1(i, n) for (int i = 0; i <= n; ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define EPS (1e-7)
#define INF... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
#include<functional>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
template<typename T>
void sort_u(T& v) {
std::sort(v.begin(), v.end());
v.erase(std::unique(v.begin(),v.end()), v.end()... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
struct edge { ll s, t, x; };
typedef pair<ll, ll> P;
typedef pair<double, P> event;
const ll MAX = 510000;
const ll MOD = 1000000007;
#define INF (ll)10000000000000000
int main() {
ll N,Q;
cin>>N>... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define pi pair<int,int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,n) for(ll i=(ll)a;i<(ll)n;i++)
#define RFOR(i,a,n) for(ll i=(ll)n-1;i >= (ll)a;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,0,n)
#define ALL(v) v.begin(), v.end()
#define bra(first,second) '(' << first << ',' << second << ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#include <stack>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long l... | // Have a nice day
// ∠( ᐛ 」∠)
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
template <typename T> inline T read()
{
T sum=0, fl=1; char ch=getchar();
for(; !isdigit(ch); ch=getchar())... | 1 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
string x, y, z;
cin >> x >> y >> z;
cout << z+" "+x+" "+y << endl;
}
| #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n;
cin>>n;
cout<<180*(n-2);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
void into(){
scanf("%d",&n);
}
void work(){
}
void outo(){
printf("%d\n",(n-2)*180);
}
int main(){
into();
work();
outo();
return 0;
} | 1 |
#include <stdio.h>
char a[111][111];
int main(void)
{
int W, B, n = 100, i, j;
scanf("%d %d" ,&W, &B);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
a[i][j] = (i <= n / 2 ? '.' : '#');
for (i = 1; i <= (B - 1) / (n / 2); i++)
for (j = 1; j <= n / 2; j++)
a[i * 2 - 1][j * 2 - ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,L;
cin >> N >> L;
vector<int>A(N);
vector<int>B(N);
int sum = 0;
for (int i = 0; i < N; i++) {
A.at(i) = L + i;
sum += A.at(i);
B.at(i) = abs(A.at(i));
}
sort(B.begin(), B.end());
for (int i = 0; i < N; i++) {
if (B.at... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<string, string> P;
string s;
void dfs(int i, int end, const string& lTemp, const string& rTemp, vector<P> &x)
{
if (i == end)
{
x.push_back(make_pair(lTemp, rTemp));
return;
}
dfs(i + 1, end, lTemp + s[i]... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> A(N+2, 0);
for(int i=1;i<=N;i++){
cin >> A[i];
}
int sum = 0;
for(int i=0;i<N+1;i++){
sum += abs(A[i+1] - A[i]);
}
for(int i=1;i<N+1;i++){
auto res = sum;
res -= a... | 0 |
#include<bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define RFOR(i,a,b) for(long i=(a);i>=(b);--i)
#define REP(i,a) FOR(i,0,a)
#define RREP(i,a) RFOR(i,a,0)
#define EACH(i,a) for(auto (i)=(a).begin(),_END=(a).end();i!=_... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
template <class T>
using gp_queue=priority_queue<T, deque<T>, less<T>>;
using Weight=long long;
static const Weight INF=1LL<<57;
struct Edge {
size_t src, dst;
Weight weight;
Edge() {}
E... | 1 |
#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(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define matrix vector<vector<char>>
#define zero(n,m) matrix(n , vector<char>(m,'0'))
#define one(n,m) matrix(n , vector<ll>(m,1))
#define pii pair<int,int>
#define point complex<ld>
#define ang... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.