code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(min(a,b)<=c && max(a,b)>=c) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define reps(i,n) for (int i=1;i<=(n);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rreps(i,n) for (int i=(n);i>0;i--)
#define all(v) (v).begin(),(v).end()
#define pi 3.1415926535897932384
#define E9 10000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int i = 0, n = 0;
fscanf(stdin, "%d", &n);
while (++i <= n) {
int x = i;
if (x % 3 == 0 || x % 10 == 3) {
fprintf(stdout, " %d", i);
}
else {
for (x /= 10; x > 0; x /= 10) {
... | 0 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(ll __x = __start; __x < __end; __x++)
int main() {
ll n, m; cin >> n >> m;
vector<ll> D;
for (ll i=1; i*i<=m; i++) {
if (m%i == 0) {
D.push_back(i);
if (i*i<=m) D.push_back(m/i);
... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define rep(pp,nn) for (int i = pp; i < nn; ++i)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define endl "\n"
void __print(int ... | 0 |
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int x;
int y;
int z;
cin >> x;
cin >> y;
cin >> z;
cout << z << " " << x << " " << y << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(){
int o,u,c;
cin >> o >> u >> c;
if(o<c&&c<u){
cout << "Yes" << endl;
}
else if(o>c&&c>u){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 0 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
int main()
{
int N, Y;
cin >> N >> Y;
int set[3] = {-1,-1,-1};
for (int i = 0; i <= N; i++)
{
for (int j = 0; i + j <= N; j++)
{
int k = N - i - j;
int z = 10000 * i + 5000 * j + 1000 * k;
if (z == Y)... | #include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
typedef long long ll;
#define i(x) cin>>x
#define fr(n,x) for(ll n=0;n<x;n++)
#define pf(x) cout<<x
const ll mod=1e9+7 ;
int main()
{
ios_base::sync_with_stdio(false),cin.tie(NULL);
ll x,y;
cin>>x>>y;
if (y-x>=2019)
{
cout<<0;
... | 0 |
#include <bits/stdc++.h>
//#include <tr1/unordered_map>
//#include"Bignum/bignum.h"
//#define big bignum
#define lowbit(x) (x & -x)
#define debug(x) (cout << "#x = " << (x) << endl)
#define Set(x, i) memset (x, i, sizeof(x))
#define R register
#define For(i, j, k) for(R int i = (j); i <= (int) (k); ++i)
#define Rep(i, ... | #include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int N, M, a[114], b[114], c[114], g[19][19], sum[32777], val[32777], dp[19][32777], dp2[32777];
int main() {
cin >> N >> M;
int all_cost = 0;
for (int i = 0; i < M; i++) {
cin >> a[i] >> b[i] >> c[i]; a[i]--, b[i]--;
sum[(1... | 1 |
#include <iostream>
int main()
{
int64_t x;
std::cin >> x;
// 5と6を交互に出す
// どちらから始めてもいいので、最後を6にできる
const auto r = x % 11;
std::cout << x / 11 * 2 + (r + 5) / 6 << std::endl;
return 0;
}
| #include<stdio.h>
#include<iostream>
#include <algorithm>
#include <functional>
#include <array>
using namespace std;
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
//void margesort(int a[], int a_len, int left, int right);
//void margesortD(int a[], int b[], in... | 0 |
#include <iostream>
#include <string>
using namespace std;
enum eKey{
ENCYPTION,
CONJUGATED,
};
void conv( string& s, int i, eKey e ){
if ( e == CONJUGATED ){
i = 26 - i;
}
for( unsigned j = 0; j < s.size(); ++j ){
if ( s[ j ] >= 'a' && s[ j ] <= 'z' ){
s[ j ] = ( s[ j ] - 'a' + i ) % 26 + 'a';
}
}
}
... | #include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int key;
int dist(char s1,char s2){
if(s1==s2){
return 0;
}else if(s1<s2){
return s2-s1;
}else{
return 'z'-s1+s2-'a'+1;
}
}
bool checkThe(char s[]){
if(strlen(s)!=3){
return false;
}else{
if(dist('t',s[0])==d... | 1 |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
#define mod 998244353
const ll N =30005 ;
ll dp[2*N] ;
int main ()
{
ll n , t ;
cin>> n >> t ;
ll i ,j,x,y;
dp[0] = 1 ;
vector<pair<ll,ll> > v(n) ;
for(i = 0 ; i< n ;i++) cin >> v[i].first >> v[i].second ;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v)... | 0 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t,c,m;
ll arr[3];
for(i=0;i<3;i++) cin>>arr[i];
sort(arr,arr+3);
cout<<arr[0]+arr[1];
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int A,B;
cin >> A>>B;
int ans = 0;
for (int n = 0;n<2; ++n) {
if (A > B) {
ans += A;
--A;
}
else {
ans += B;
--B;
}
}
cout << ans<<endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <iomanip>
using namespace std;
int main () {
double a,b,c,d;
cin >> a >> b >> c >> d;
cout << setprecision(20) <<sqrt((a-c)*(a-c)+(b-d)*(b-d));
return 0;
} | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
int main(void){
string s;
cin>>s;
int n=s.size();
bool ok=false;
int L=-1,R=-1;
if(n==2&&s[0]==s[1]){
L=1,R=2;
}
for(int i=0;i<n-2;i++){
if(s[i]==s[i+1]||s[... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se se... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#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 << " = " << (x) << endl;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
temp... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int main(){
int h,w,n;
cin>>h>>w>>n;
if(n%max(h,w)==0){
cout<<n/max(h,w)<<endl;
return 0;
}
... | 0 |
#include<bits/stdc++.h>
#define mp make_pair
#define endl "\n"
#define v vector
#define b begin()
#define e end()
using namespace std;
typedef long long ll;
typedef long l;
typedef long long unsigned ull;
int main(){
/*int t;
while(t--){
}*/
ll n;
cin>>n;
ll m = n/500;
ll q = m*1000;
... | #include<iostream>
using namespace std ;
int main()
{
string S ;
cin>>S ;
int SIZE=S.size() ;
if(SIZE==2) cout<<S<<endl ;
else for(int i=SIZE-1;i>=0;i--) cout<<S.at(i) ;
return 0 ;
} | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include... | // This amazing code is by Eric Sunli Chen.
#include<bits/stdc++.h>
using namespace std;
template<typename T> bool get_int(T &x)
{
char t=getchar();
bool neg=false;
x=0;
for(; (t>'9'||t<'0')&&t!='-'&&t!=EOF; t=getchar());
if(t=='-')neg=true,t=getchar();if(t==EOF)return false;
for(; t<='9'&&t>='0'; t=getchar())x=x... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include <stdio.h>
#include <string.h>
int main()
{
int i;
char str[21];
scanf("%s",str);
for(i=strlen(str)-1; i>=0; i--)
printf("%c",str[i]);
printf("\n");
return 0;
} | 0 |
#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
using namespace std;
typedef pair<string, int> P;
int main() {
int n;
while(cin >> n && n){
int x[20], y[20];
for(int i = 0; i < n; ++i)
cin >> x[i] >> y[i];
int m;
cin >> m;
queue<P> q;
string s;
int d;
for(int i = 0; i ... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a,b,c;
while(cin>>a>>b>>c,a||b||c){
int n,parts[500],input[10000][4],bd;
for(int i=0;i<500;i++) parts[i]=2;
cin>>n;
for(int _i=0;_i<n;_i++){
for(int _j=0;_j<4;_j++){
cin>>input[_... | 0 |
#include <bits/stdc++.h>
#define booga cout << "booga" << endl
#define ll long long int
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,a,b;
cin >> n >> a >> b;
if(n == 1){
cout <... | #include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
double ax, ay, bx, by;
cin >> ax >> ay >> bx >> by;
printf("%.6f\n",sqrt(pow(bx-ax,2)+pow(by-ay,2)));
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> a(N);
bool ok=true;
int ans=1e9;
//O(N * LOG(MAX(a)))
for(int& x : a) {
cin >> x;
if(x&1) ok=false;
int cnt=0;
while(x) {
if(x&1) {
ans=min(ans... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | #include<bits/stdc++.h>
#include<string.h>
using namespace std;
int main()
{
char line[50];
cin.getline(line,50);
char a,b,c,d;
int count=0;
for(int i=0;i<strlen(line);i++)
{
if(line[i]==' ')
{
if(count==0)
{
a=line[i-1];
b=line[i... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void solve()
{
int N, M;
while (cin >> N >> M, N || M)
{
vector<int> point(N);
for (int i = 0; i < N; ++i)
{
cin >> point[i];
}
point.push_back(0);
vector<int> sum;
for (int i = 0; i <= N; ++i)
{
for (int j = 0; j... | /// IN THE NAME OF GUITAR
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define sz(x) (ll) x.size()
#define all(x) (x).begin(),(x).end()
#define F first
#define S secon... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; ... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
void solve(int n,int m){
int fr[501][501],a,b,ans=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fr... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) pu... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N;
cin >> N;
vector<P>ab(N);
vector<P>cd(N);
for(int i = 0; i < N; i++) {
int a,b;
cin >> a >> b;
... | 0 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <vector>
typedef long long ll;
const int maxn = 1e5 + 5;
const ll mod = 1e9 + 7;
const double PI = acos(-1.0);
ll a[maxn];
int main (int argc, char **... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... | 1 |
#include<iostream>
#include<string>
signed main() {
int h,w,a,b;
scanf("%d%d%d%d",&h,&w,&a,&b);
std::string s(a,'0');
std::string t(w-a,'1');
std::string ans=s+t;
std::string S(a,'1');
std::string T(w-a,'0');
std::string Ans=S+T;
for(int i=0;i<h;++i){
if(i<b){
printf("%s\... | #include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define x first
#define y second
#pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#define plll ... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int gcd(int x, int y){
return y ? gcd(y, x % y) : x;
}
void divisor(int n, vector<int>& vec){
for(int i=1;i*i<=n;i++){
if(n % i == 0){
vec.push_back(i);
if(i != n / i) vec.push_back(n / i);
}
}
}
main(){
int ... | #include<iostream>
#include<map>
using namespace std;
int main()
{
int n;
cin >> n;
map<int,int> ans;
for(int i=0;i<n;i++)
{
int num;
cin >> num;
for(int j=1;j<=num/2;j++)
{
if(num%j == 0)
ans[j]++;
}
ans[num]++;
}
for(map<int,int>::iterator it = ans.begin();it != a... | 1 |
#include <bits/stdc++.h>
using namespace std;
// boost
#include <boost/multiprecision/cpp_int.hpp>
using boost::multiprecision::cpp_int;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = ... | #include<bits/stdc++.h>
int main(){
using namespace std;
constexpr unsigned long MOD = 998244353;
string S;
cin >> S;
reverse(begin(S), end(S));
unsigned long K;
cin >> K;
K = min<unsigned long>(count(begin(S), end(S), '1'), K);
vector<vector<unsigned long>> dp(K + 1), tmp(K + 1);... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7, maxN = 1e5 + 13;
int n, x, dp[maxN], dpw[maxN];
vector<int> vec;
int pw (int a, int b) {
int ret = 1;
for (; b; b >>= 1, a = 1ll * a * a % mod)
if (b & 1)
ret = 1ll * ret * a % mod;
return ret;
}
int32_t... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
const char Q = 'Q';
const char _ = '.';
char board[8][9] = {
"........",
"........",
"........",
"........",
"........",
"........",
"........",
"........",
};
int n;
bool pre_x[8], pre_y[8];
inline bool c... | 1 |
// ALDS1_12_A.cpp
// Graph II - Minimum Spanning Tree
#include <iostream>
using namespace std;
const int maxN = 100;
const int INF = 2001;
int w[maxN][maxN];
int color[maxN];
int n;
static const int WHITE = 0;
static const int BLACK = 1;
int prim(int x)
{
int res = 0;
int cnt = 1;
color[x] = BLACK;
wh... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main(){
int n;
cin >> n;
vi p(n);
int mn = 100000000, cnt = 0;
rep(i,n){
cin >> p[i];
if(mn > p[i]){
mn = p[i];
cnt+... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define RREP(i, n) RFOR(i, n, 0)
#define MFOR(i, m) for(auto i=(m).beg... | #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 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
long long n, d, hasil;
int main(){
while(cin >> d){
hasil = 0;
for(int i = d; i <= 600-d; i += d){
hasil += d * pow(i, 2);
}
cout << hasil << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
int a[n+2];
a[0]=0;
a[n+1]=0;
rep(i,0,n) cin>>a[i+1];
int sum[n+2];
sum[0]=0;
rep(i,0,n+1){
sum[i+1]=sum[i]+abs(a[i+1]-a[i]);... | 0 |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define s... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> graph;
void DFS(int v, int parent_v, vector<int> &depth, vector<int> &parent){
for(int child_v : graph[v]){
if(child_v == parent_v) continue;
depth[child_v] = depth[v] + 1;
parent[child_v] = v;
DFS(child_v, v, depth... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int long long
int hmt() {int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';if(n) x=-x;return x;}
#define in hmt()
#define ins ({string x;char c=getchar(... | #include<bits/stdc++.h>
#define maxn 200005
#define LL long long
using namespace std;
const int mod = 1e9+7;
int n,Q,pre,now;
struct Seg{
LL mn[maxn<<2],tag[maxn<<2]; int flg;
Seg(){memset(mn,0x3f,sizeof mn);}
inline void add(int i,LL v){mn[i]+=v,tag[i]+=v;}
inline void down(int i){if(tag[i]) add(i<<1,tag[i]),add(i... | 1 |
#include <cstdio>
using namespace std;
int main()
{
int n;
while (scanf("%d", &n), n != 0){
int ice[10] = {0};
int ice_n;
for (int i = 0; i < n; i++){
scanf("%d", &ice_n);
ice[ice_n]++;
}
for (int i = 0; i < 10; i++){
if (ice[i] == 0){
puts("-");
}
else {
while (ice[i]-- != 0){... | #include<iostream>
#include<stdio.h>
#include<math.h>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, v1, v2, sum, i;
double ter;
vector<int> s;
while (scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", &l1, &l2, &l3, &l4, &l5, &l6, &l7, ... | 0 |
#include <stdio.h>
#include <limits.h>
#include <algorithm>
using namespace std;
long long int sum = 0;
void merge(int A[],int left,int mid, int right){
int a1 = mid - left;
int a2 = right - mid;
int l[a1+1],r[a2+1];
for(int i = 0; i < a1; i++) l[i] = A[left + i];
for(int i = 0; i < a2; i++)... | #include <bits/stdc++.h>
typedef long long LL;
typedef unsigned long long ULL;
#define int long long
#define debug printf("fuck %d\n", __LINE__);
inline LL read() {
LL res = 0, bo = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') bo = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')... | 0 |
#include <bits/stdc++.h>
using namespace std;
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int()... | #include <iostream>
#include <vector>
using namespace std;
int dfs(auto& nodes, int current_index, int parent_index, int& time) {
int children = 0;
auto& current_node = nodes[current_index];
current_node.time = time;
current_node.low = time;
for (auto adjacent_index : current_node.adjace... | 1 |
#include <iostream>
using namespace std;
int F[102][102];
void setblock(int c, int d, int x, int y){
if(d==0){
for(int i=0;i<4;i++){
F[y][x+i]=c;
F[y+1][x+i]=c;
}
}else{
for(int i=0;i<4;i++){
F[y+i][x]=c;
F[y+i][x+1]=c;
}
}
}
void DFS(int Y, int X, int c){
if(F[Y][X]!... |
#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 do... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
void printVector(vector<int> v) {
for (auto x : v) {
cout << x << ' ';
}
cout << '\n';
}
void printArray(ll A[], int size) {
for (int i = 0; i <= size - 1; i++) cout << A[i] << ' ';
}
int main() {
ios::sync_with_stdio(... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define si(a) scanf("%d",&a)
#define si2(a,b) scanf("%d%d",&a,&b)
#define sl(a) scanf("%lld",&a)
#define sl2(a,b) scanf("%lld%lld",&a,&b)
#define pb push_back
#define mk make_pair
#def... | 0 |
#include <vector>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int m = 1e9;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m = min(__builtin_ctz(a), m);
}
cout << m << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using pint = pair<int,int>;
using vpil = vector<pint>;
using vppil = vector<vpil>;
int main(){
int n;
cin >> n;
vppil l(n);
rep(i,n){
int a;
cin>>a;
rep(j,a){
p... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int size=1e5;
const int inf=1e9;
int main(){
int H,W;cin>>H>>W;
int A[H][W] = {};... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
const int ofs = 12800;
int H, W;
int A[82][82], B[82][82];
bool dp[82][82][25610];
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> H >> W;
rep(i, H) rep(j, W)... | 1 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < n; ++i)
#def... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int l,r;
cin >> l >> r;
const int num = 2019;
int comp = INT_MAX;
long long ans = 0;
for(long long i=l; i<=r; i++){
for(long long j=l; j<i; j++){
ans = ((i%num) * (j%num))%num;
if(ans < comp){
... | #include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <de... | 1 |
#include<stdio.h>
int main()
{
char S[101];
char T[101];
scanf("%s %s", &S, &T);
printf("%s%s",T,S);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &... | 0 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef pair<int, in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll c[... | 1 |
#include<stdio.h>
int main()
{
int a[11][11],n,i,j;
while(scanf("%d",&n),n)
{
for(i=0;i<n;++i)
{
a[i][n] = 0;
for(j=0;j<n;++j)
{
scanf("%d", &a[i][j]);
a[i][n] += a[i][j];
}
}
for(j = 0; j <= n; ++j)
{
a[n][j] = 0;
for(i = 0; i < n; ++i)
a[n][j] += a[i][j];
}
for(i = 0; i ... | #include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
int main(int argc, char* argv[])
{
while (true) {
std::string line;
std::stringstream buffer;
getline(std::cin, line);
buffer << lin... | 1 |
#include <bits/stdc++.h>
#define file(s) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define Grt ch = getchar()
#define DeBug(x) std::cout << #x << '=' << x << std::endl
typedef long long ll;
const int MaxN = 45, MaxS = 1 << 18, mod = 1e9 + 7;
namespace IO
{
char buf[1<<15], *fs, *ft;
inline char g... | #include <cstdio>
#include <vector>
using namespace std;
#define MAX_H 20
#define MAX_W 20
#define INF (1<<28)
int w, h;
int F[MAX_H][MAX_W];
int G[MAX_H][MAX_W];
int gy, gx;
int y, x;
int py, px;
void debug();
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
void move(int d) {
//printf(" %d... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
int compat[n][n];
for (int q = 0; q < n; q++)
{
for (int w = 0; w < n; w++)
{
cin >> compat[q][w];
}
}
ll dp[1<<n];
for (int q = 0; q < (1<<n); q++)
{
dp[q] = 0;
for (int w = 0; w < n; w++)
{
if... | #include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
#define N 8
using namespace std;
int row[N];
bool col[N],dpos[2*N-1],dneg[2*N-1];
void printBoard(){
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(j==row[i])printf("Q");
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pb emplace_back
#define X first
#define Y second
const int N = 2e5 + 5;
typedef pair<int,int> ii;
vector<int> g[N];
int par[N];
int deg[N];
in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main()
{
int h, w;
cin >> h >> w;
int a[h][w];
rep(i, h)
{
rep(j, w) cin >> a[i][j];
}
int cnt = 0;
vector<tuple<int, int, in... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,d[10];
cin>>s;
int i,j,a,b;
a=s.size();
int c[a-2];
for(i=0;i<a-2;i++)
{
for(j=i;j<i+3;j++)
{
d[i]=d[i]+s[j];
}
c[i]=abs(753-stoi(d[i]));
}
sort(c,c+(a-2));
cout<<c[0]<<endl;
} | #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void)
{
char s[10];
int i,a,x=0,y=0,z=0,b=0,c=0,d=1000;
scanf("%s",s);
a=strlen(s);
for(i=0;i<a-2;i++){
x=s[i]-'0';
y=s[i+1]-'0';
z=s[i+2]-'0';
b=(x*100)+(y*10)+z;
c=753-b;
if(c<0) c*=-1;
if(d>c) d=c;
}
printf("%d\... | 1 |
// http://algorithms.blog55.fc2.com/blog-entry-66.html
#include <stdio.h>
#include <string.h>
#define M 100
int N,R[M+1],C[M][M],B[M][M];
void compute(){
int i=0,j,k,cost;
memset(C,99,sizeof(C));
for(;i<N;i++)C[i][i]=0;
for(j=1;j<N;j++)
for(i=0;i<N - j; i++ )
for (k = i; k < i + j; k++ ){
cost = C[i][k... | #include <stdio.h>
int main(){
int n;
scanf("%d",&n);
while(n){
int a=0,b=0,aa,bb;
for(int i=n;i>0;i--){
scanf("%d %d",&aa,&bb);
if(aa>bb){
a+=aa+bb;
}else if(aa<bb){
b+=aa+bb;
}else{
a+=aa;
b+=bb;
}
}
printf("%d %d\n",a,b);
scanf("%d",&n);
}
} | 0 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
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 ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxm=2e5+5;
const int mod=1e9+7;
int a[maxm];
int b[maxm];
int n;
signed main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
vector<int>ans;
for(int i=n;i>=1;i--){
int cnt=0;
for(int j=i;j<=n;j+=i){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < n; i++)
typedef long long ll;
// Welcome to my source code!
struct Node {
int key;
Node *parent, *left, *right;
};
Node *root, *NIL;
void insertKey(int key) {
Node *y = NIL;
Node *x = root;
Node *z;
z = new No... | #include <stdio.h>
struct binary_tree{
int n;
int l;
int r;
};
binary_tree bt[1000000];
int now=0,empty[1000000];
void push(int n,int t){
if(now==0){
bt[0].n=n;
now++;
return;
}
if(bt[t].n<n){
if(bt[t].r==0){
bt[t].r=empty[now];
bt[bt[t].r]... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const int mod = 998244353;
int main() {
int n, d0;
cin >> n >> d0;
if(d0 != 0) {
cout << 0 << endl;
return 0;
}
vector<int> d(100005);
d.at(0) = 1;
int max_d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 998244353
ll ch[100010];
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
... | 1 |
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
string S;
int X[1000005][3];
int z=0;
int y=0;
int main()
{
cin >> S;
if(S[0]=='J'){
X[z][0]++;
y=0;
}
if(S[0]=='O'){
X[z][1]++;
y=1;
}
if(S[0]=='I'){
X[z][2]++;
y=2;
}
for(int i=1;i<S.length();i++){
if(S[i-1]==S[i])X[z][y]+... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long ll;
ll gcd(ll f , ll s){if(s==0)return f;else return gcd(s,f%s);}
int const N = 1000006;
ll const M = 998244353;
long double const ep = .000000000000000001;
int p[N];
queue<int>q;
ll Farray[1032][1032] , Sarray[10... | 0 |
#include<iostream>
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
int ans=0;
for(int i=a;i<=b;i++){
int s[5];
int x=i;
for(int j=0;j<5;j++){
s[j]=x%10;
x/=10;
}
if(s[0]==s[4]&&s[1... | #include <stdio.h>
int main (){
int G, N;
scanf("%d %d", &G, &N);
int z = 1;
for (int i = 0; i < G; i++) {
if (2 * z <= z + N) {
z *= 2;
} else {
z += N;
}
}
printf("%d", z);
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
#define mod 998244353
const ll N =30005 ;
ll dp[2*N] ;
int main ()
{
ll n , t ;
cin>> n >> t ;
ll i ,j,x,y;
dp[0] = 1 ;
vector<pair<ll,ll> > v(n) ;
for(i = 0 ; i< n ;i++) cin >> v[i].first >> v[i].second ;
... | #include<bits/stdc++.h>
#define reg register
const int maxn = 1000005;
int N;
char S[maxn];
char T[maxn];
int main(){
scanf("%d", &N);
scanf("%s%s", S+1, T+1);
int flag = 1;
for(reg int i = 1; i <= N; i ++)
if(S[i] != T[i]){ flag = 0; break ; }
if(flag){ print... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N=200005;
long long a[N],l[N],r[N];
int main()
{
ios::sync_with_stdio(false);
int n;
long long d,ret=0;
cin>>n>>d;
for(int i=1;i<=n;i++)
{
cin>>a[i];
ret+=a[i];
}
ret+=(n-1)*d;
r[1]=a[1];
for(int i=2;i<=n;i++)
r[i]=min(a[i],r[i-1]+d);
l[n]=a[n];
f... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begi... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n,u,v; cin>>n>>u>>v;
vector<vector<int>> t(n+1,vector<int>(0));
for(int i=0; i<n; ++i){
int a,b; cin>>a>>b;
t[a].push_back(b),t[b].push_back(a);
}
vector<int> ud(n+1,0),vd(n+1,0);
vector<bool> d(n+1,true);
queue<pair<int,int>> q;
q... | #include<bits/stdc++.h>
using namespace std;
vector<int>adj[100003],leaf;
int par[100003],depth[100005],sparse[100005][20],root=0,lz=0;
int lca(int p,int q)
{
int a,b,c,d,lp,i,j;
if(depth[p]<depth[q])
{
c=p; p=q; q=c;
}
for(j=19;j>=0;j--)
{
if((depth[p]-(1 << j))>=depth[q])... | 1 |
#include <iostream>
using namespace std;
string s;
int main() {
cin >> s;
if (s.length() % 2 != 0) {
cout << "No\n";
return 0;
}
bool works = true;
for (int i=0; i<s.length(); i+=2) {
if (s[i] != 'h' || s[i + 1] != 'i')
works = false;
}
if (works)
... | #include <bits/stdc++.h>
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define vll vector<long long int>
#define all(v) v.begin(),v.end()
const ll MOD = 1e9 + 7;
const ll INF = 10000000000000000;
const ll MAX_N = 1e5 + 7;
usin... | 1 |
#include <iostream>
#include <limits.h>
using namespace std;
int dp[100][100];
int p[101];
int n;
void solve() {
for (int m = n; m > 0; m--) {
for (int t = 0, i = 0, j = n - m + 1; t < n && j < n; t++) {
dp[i][j] = INT_MAX;
for (int k = i; k < j; k++) {
int temp = dp[i][k] + dp[k + 1][j] + p[i] * p[k + ... | #include <stdio.h>
#include <limits.h>
int main(){
int n,p[101],i,j,k,l,x,m[101][101];
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d %d",&p[i-1],&p[i]);
for(i=1;i<=n;i++)m[i][i]=0;
for(l=2;l<=n;l++){
for(i=1;i<=n-l+1;i++){
j=i+l-1;
m[i][j]=INT_MAX;
for(k=i;k<j;k++){
x=m[i][k]+m[k+1][j]+p[i... | 1 |
#include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<end... | #include <bits/stdc++.h>
using namespace std;
#define loop(i,n) for(int i=1;i<=n;i++)
struct test {
int i, j, k;
};
vector<test> t;
int p[302];
int main(){
int a, b, c, n, i, j, k, r;
while (cin >> a >> b >> c){
cin >> n;
t.clear();
loop(i, a + b + c)p[i] = 2;
loop(h, n){
cin >> i >> j >> k >> r;
if... | 1 |
#include <iostream>
using namespace std;
const int INF = 1 << 30;
const int dx[] = { 0, 0, 1, -1 };
const int dy[] = { 1, -1, 0, 0 };
int W, H;
int B[32][32];
int dfs(int x, int y, int times) {
if(times == 10) return INF;
int best = INF;
for(int i = 0; i < 4; i++) {
int j = 1;
for(; ; j++) {
i... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN = 1e5 + 10;
int N;
int a[1001][1001], vis[MAXN], prime[MAXN], tot;
void GetPhi() {
vis[1] = 1;
for(int i = 2; i; i++) {
if(!vis[i]) prime[++tot] = i;
if(tot == 1000) break;
for(int j = 1; j <= tot && (i * prime[j] <= 10000); j++... | 0 |
#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;
if (a < b) {
if (a <= c && c <= b)
puts("Yes");
else
puts("No");
}
else {
if (b <= c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
int main(void){
ll a,b,c;
cin>>a>>b>>c;
if(a>b)swap(a,b);
rep(a,i,b+1){
if(i==c){
cout<<"Yes";
return 0;
}
}
cout<<"No";
}
| 1 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int T, N;
long long Abuf;
vector<long long> A;
string S;
cin >> T;
for(int itestcase=0; itestcase<T; itestcase++){
cin >> N;
A.clear();
for(int i=0; i<N; i++... | 1 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
c... | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <string.h>
#include <ctype.h>
#include <algorithm>
using namespace std;
int main() {
int n,ans,W[310000] = {},E[310000] = {};
string s;
cin >> n >> s;
for(int i = 1; i <= n-1; i++) {
if(s[i-1] == 'W')
W[i] = W[i-1] + 1;
... | 0 |
#include <iostream>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
int main() {
int n,m;
cin>>n>>m;
int A[1000], B[1000];
rep(i,n) cin>>A[i];
int c[1000]={};
rep(i,m) cin>>B[i];
rep(j,m)rep(i,n){
if(B[j]>=A[i]){
c[i... | #include <bits/stdc++.h>
using namespace std;
#define BE(x) x.begin(), x.end()
int main() {
long long l, r;
cin >> l >> r;
long long ans = 2019;
int icnt = 0;
for (long long i = l; i < r; i++) {
int jcnt = 0;
for (long long j = i+1; j <= r; j++) {
ans = min(ans, i*j%201... | 0 |
/* HARD WORK FOREVER PAYS */
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define turbo(){ \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
}
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef unsigned long long int ull;
v... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
long long ans = 1;
cin >> n;
vector<int> fact(10000); //factor container
for(int j = 2; j<=n;j++){
long long num = j;
for (int i = 2; i <= num; i++) {
while (num%i == 0) { // 素数で割り切れなくなるまで割っていく
fact.at(i)++; //... | 1 |
#include <stdio.h>
#include <queue>
using namespace std;
int main()
{
const int INF = 10000000;
int n, k, map[100][100], a, b, c;
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;
while(true)
{
scanf("%d%d", &n, &k);
if(n == 0 && k == 0)
break;
for(int i = 0; i < n; ... | #include <iostream>
#include <algorithm>
using namespace std;
#define INF 100000000
int map[100][100];
int n,k,cou,tmin;
int dd[101],col[100];
int main(){
int t,a,b,c,d,e;
cin >> n >> k;
while(n!=0&&k!=0){
for (int i=0;i<10000;i++)map[i/100][i%100]=0;
for (int i=0;i<k;i++){
cin >> t;
// ... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(ll N, ll A, ll B, ll C, ll D, ll E) {
ll bn = min({A, B, C, D, E}); // bottle neck
cout << ((N - 1) / bn + 5) << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N, A, B, C, D, E;
cin >> N >> A >> B >> C >> D >... | 1 |
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 100100
lli n;
int main(void){
cin >> n;
vector<lli> v(n);
vector<lli> e(N), o(N);
rep(i, n) cin >> v[i];
rep(i, n){
if(i%2 == 0){
e[v[i]]++;
}else{
o[v[i]]++;
}
}
auto p1 = max_elemen... | #include <bits/stdc++.h>
using namespace std;
//vector<vector<int>> a(5, vector<int>(5, 0)) 5*5-0
int main(){
long long int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a.at(i);
}
long long int step = 0;
for(int i = 1; i < n; i++){
if(a.at(i - 1) > a.at(i... | 0 |
#include<stdio.h>
int V,E,R,S[500010],T[500010],D[500010];
int C[100000];
const int INF=10000*100000+100;
int i,t,j;
int main()
{
for(i=0;i<100000;i++)
{
C[i]=INF;
}
scanf("%d",&V);
scanf("%d",&E);
scanf("%d",&R);
C[R]=0;
for(i=0;i<E;i++)
{
scanf("%d",&S[i]);
scanf("%d",&T[i]);
scanf("%d",&D[i]);... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
typedef struct{
int n, cost;
}Data;
typedef struct{
Data data;
int prior;
}node;
typedef struct{
node* nodes;
int arr_sz; //???????????????????????????
int que_sz; //?¬????????´?????????´????????????
}priority_queue;
node* my_re... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int x,y,z;
int ans=0;
x=y=z=0;
char c='\0';
string s;
cin>>s;
for(int i=0;i<s.size();i++){
bool f=true;
if(s[i]=='J'){
if(c=='J')x++;
else {
x=1;
y=z=0;
}
}else if(s[i]=='O'){
if(c=='J' || c=='O')y+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M = 0, h = 0;
cin >> N;
M = N;
for(int i = 0; i < 10; i++) {
h += M % 10;
M = M / 10;
if(M == 0) {
break;
}
}
if(N % h == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 0 |
#include <bits/stdc++.h>
#include <regex>
using namespace std;
#define _GLIBCXX_DEBUG
//vector<int> A(M), B(M);
//vector<vector<char>> answer(N, vector<char>(N, '-'));
int main() {
string s;
int ans = 0;
cin >> s;
if(s[0] == 'R'){
ans++;
if(s[1] == 'R'){
ans++;
if(s[2] == 'R') ans++... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
string s;
cin >> s;
if(s == "RRR"){
cout << "3\n";
... | 1 |
#include <iostream>
using namespace std;
typedef long long int LLI;
int main()
{
LLI n, t, tmp, next, ans;
cin >> n >> t >> tmp;
ans = t;
for(int i = 1; i < n; i++)
{
cin >> next;
if( next - tmp >= t )
ans += t;
else
ans += next - tmp;
tmp = next;
}
cout <<... | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#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;
const ll longinf = 1LL... | #include<stdio.h>
int main(void)
{
int a,s,d,f,g,h[10001],i,j,z[10001];
scanf("%d",&a);
for(i=1;i<=a;i++){
z[i]=1;
//printf("%d\n",z[4]);
}
// printf("%d\n",z[4]);
for(i=1;i<=a*(a-1)/2;i++){
h[i]=0;
}
for(i=1;i<=a*(a-1)/2;i++){
scanf("%d %d %d %d",&s,&d,&f,&g);
if(f<g){
h[d]=h[d]+3;
}
else if(f>... | 0 |
#include<bits/stdc++.h>
#define N 100005
using namespace std;
int n;
int val[3][N],p[N],inv[N],cir[2];
void fail(){puts("No");exit(0);}
int main(){
scanf("%d",&n);
for(int t=0;t<3;t++)
for(int i=1;i<=n;i++)
scanf("%d",&val[t][i]);
for(int i=1;i<=n;i++){
p[i]=(val[1][i]+1)/3;
... | #ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
mt19937 mrand(random_device{} ());
int rnd(int x) {
return mrand() % x;
}
typedef long double ld;
typedef long long ll;
#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(.... | 1 |
/**
* created: 01.07.2020 15:47:43
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using bint = boost::multiprecision::cpp_int;
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s);... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n+1,0);
for(int i=1;i<=n;i++)
cin>>a.at(i);
vector<int> d(n+1);
int s=0;
for(int i=0;i<n;i++){
d.at(i)=abs(a.at(i+1)-a.at(i));
s+=d.at(i);
}
d.at(n)=abs(a.at(n));
s+=d.at(n);
for(int i=1;i<=n;i++){
... | 1 |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i,a,b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;
int main() {
int n; cin >> n;
vector<P> a... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
pair <long long, long long> xy[100];... | 1 |
// include
// ------------------------------------------------
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
int getDigit(int n); // 数字の桁数を取得する。
string upper(string str); // 英字を... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
main(){
string s;
cin >> s;
if(s.length()==2){
cout << s << endl;
}else{
cout << s[2] << s[1] << s[0] << endl;
}
return 0;
}
| 1 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | /*
* Since g++10 is released, some characters is not valid inside #if 0 :(
* So, why not using clang++? :D
* Date:
echo -n ' ' && date +%Y.%m.%d # Just Run this (Type !!sh in Vim).
* Solution:
* 考虑边界，推导结论，子问题递归求解
如果 S <= p[1] 或者 S >= p[n] ，显然所有人投票都是一个方向，不妨假设 p[1] < S < p[n] 。
考虑处在最边上的 1 号点和 n 号点，如果 a[1]... | 0 |
#include<cstdio>
char s[1000005];
long long sumM[1000005];
long long solve(int n,int k){
long long res = 0;
long long cnt = 0, sum = 0;
for(int i = 1; i <= n; i++){
int delet = i-k;
if(delet>=1 && s[delet]=='D'){
long long minus = sumM[i-1]-sumM[delet];
sum -= minus;... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, Q;
string S;
cin >> N >> S >> Q;
for (int i = 0; i < Q; i++) {
long long K;
cin >> K;
long long CurX = 0, CurY = 0, COUNT = 0, ANS = 0;
vector<long long> MCOUNT(N, 0);
for (int j = 0; j < N; j++) {
if (S[j] == 'D') CurX++;
if (... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin >> N >> M;
vector<bool>vec(N,true);
vector<int>F(N);
int WA=0,AC=0;
for(int i=0; i<M; i++){
int p;
string S;
cin >> p >> S;
if(vec[p-1] && S == "WA"){
WA++;
F[p-1]++;
}
if(vec[p-1] && S == "AC"){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie();
int n, m;
cin>>n>>m;
if(n == 0 || m == 0){
cout<<"0 0";
return 0;
}
bool accepted[n];
unordered_map<int, int> ma;
for(int i = 0; i < n; i++){
accepted[i] = fal... | 1 |
#include <cstdio>
int N;
int C[10000][2];
void solve() {
int a = 0;
int b = 0;
for (int i = 0; i < N; i++) {
int ac = C[i][0];
int bc = C[i][1];
if (ac > bc) {
a += ac + bc;
} else if (ac < bc) {
b += ac + bc;
} else {
a += ac;
b += bc;
}
}
printf("%d %d\n", a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vint;
typedef vector< vector<ll> > vvint;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repf(i,f,n) for(ll i=f;i<n;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define mp make_pair
#define mt make_tuple
#define ALL(obj) (obj).begin... | 0 |
#include <iostream>
using namespace std;
#include <stdio.h>
void ushm(char x);
struct sai {
int dicet[3][2];
int diceus[2], dicemh[2];
int dicenow;
};
struct sai a = { { 1, 6, 2, 5, 3, 4 },{ 5, 2 },{ 4, 3 }, 1 };
int main()
{
int atai[6], i;
char houi[101];
for (i = 0; i < 6; i++) { cin >> atai[i]; }
cin >> houi... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <array>
using namespace std;
#define DEBUG(x) cerr << #x << " = " << x << endl
enum FACE { TOP, FRONT, RIGHT, LEFT, BACK, BOTTOM }; // 1..6
typedef array<int, 6> Dice;
FACE tbl[6][4] = {
{ TOP, BACK, BOTTOM, FRONT },
{ TOP, RIG... | 1 |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 100010, M = 1010;
string s;
int main()
{
cin >> s;
for (int i = 0; i < s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s;
cin >> s;
bool found = 0;
int i, j;
for (i = 0; i < (int)s.size() - 1; i++)
{
for (j = i + 1; j < (int)s.size(); j++)
{
if (s[i] == s[j])
{
if (2 > ... | 1 |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N;
int A[3][100001];
LL dp[3][100001] = {};
int main() {
scanf("%d", &N);
rep(j, 3) { rep(i, N) scanf("%d", &A[j][i]); A[j][N] = 1000000001; }
rep(j, 3) sort(A[j... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n;
cin >> n;
v... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string N,m;
cin >> N;
int x,y = 0;
for(int i = 0; i < int(N.size()); i++){
istringstream n;
m = N[i];
n = istringstream(m);
n >> x;
y += x;
}
if (stoi(N) % y == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
int a,b,c,d,e,f,g,h,i,s;
a = n/100000000;
b = n/10000000-10*a;
c = n/1000000-100*a-10*b;
d = n/100000-1000*a-100*b-10*c;
e = n/10000-10000*a-1000*b-100*c-10*d;
f = n/1000-100000*a-10000*b-1000*c-100*d-10*e;
g = n/100-10000... | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
int h,w,a,b;
cin >> h >> w >> a >> b;
rep(i,h){
bool rev_fl = i<b;
rep(j,w){
if(j<a){
if(rev_fl) cout << 1;
else co... | #include<iostream>
using namespace std;
int main(){
int n;
int a[1000000];
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=n-1;i>=0;i--){
cout<<a[i];
if(i>0){
cout<<" ";
}
}
cout<<endl;
return 0;
} | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
usi... | #include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int add(int x,int y){return x+y<mod?x+y:x+y-mod;}
void ade(int& x,int y){x+=y;if(x>=mod)x-=mod;}
int n;
char s[300300];
int tran[2][9]={{1,3,4,1,6,7,4,8,7},{2,0,5,1,2,5,4,5,7}};
int dp[300300][10];
int main()
{
scanf("%s",s+1);
n=strlen(s+1);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;... | #include <bits/stdc++.h>
#define FOR(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define FORUL(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define FORULE(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define FOREACH(it, X) for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); it++)
#if defined(_MSC_VER) || __c... | 1 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
// g++ hoge.cpp -std=c++17 -I . でコンパイルできる
// -fsanitize=undefinedでオーバーフロー検出
#include <bits/stdc++.h>
//#include <atcoder/all>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO c... | /*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
string S;
cin >> N >> S;
vector<string> ans = {"SS", "SW", "WS", "WW"};
rep(i, 4) {
rep(j, N) {
if (ans[i][j + 1] == 'S') {
if (S... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int n;
string s;
bool judge(string ans){
bool ok=true;
if(ans[n-1]=='S'){
if(s[n-1]=='o' && ans[n-2]!=ans... | 1 |
#include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define mkt make_tuple
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
int n, q, s, t, x, u;
iP a[1<<18];... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i,n) for(long long i=0; i<n; i++)
#define repr(i,n,m) for(long long i=m; i<n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#defi... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
for (long long i = 1; i < m + 1; i++) {
if (i <= m - m / 2) {
cout << i << " " << n + 1 - i << endl;
} else {
cout << n + 1 - i - (m - i + 1) *... | #include <bits/stdc++.h>
//#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>
#define X first
#define Y second
#define PB push... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typenam... | #include <bits/stdc++.h>
using namespace std;
#define rep0(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i,n) for(long long i=1;i<=(long long)(n);i++)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main() {
string S;
char s;
cin>>S;
if(S.size()==2){cout<<S<<endl;}
else{s=S[0];... | 1 |
#include <iostream>
#include <cstdio>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
typedef struct{
int head;
int tail;
int right;
int left;
int up;
int down;
} dice;
dice s(dice a) {
int buf;
buf = a.tail;
a.tail = a.dow... | #include <cstdio>
#include <iostream>
#include <string>
using namespace std;
const int COUNT = 6;
class Dice
{
public:
int num[6];
public:
Dice();
void play_dice(string);
void play(int, int, int, int);
void print_(int x) {printf("%d\n", num[x]);}
void to_top_and_front(int, int);
};
Dice::Dice()
{
for (int ... | 1 |
//#include "debug.h"
#include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const long long M=1000000007;
//typedef long T;
//#include "math/mod.h"
//#include "math/modulo.h"
template<class T, long long M>
struct modulo {
T n;
T gcd_ext(T a... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define vi vector <int>
#define vl vector <ll>
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define pd(x... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N, M;
cin >> N >> M;
vector<ll> L(M+1);
vector<ll> R(M+1);
for(int i = 1; i <= M; ++i) cin >> L[i] >> R[i];
if(*min_element(R.begin()+1, R.end())-*max_element(L.begin()+1, L.end()) >= 0)cout << *min_element(R.begi... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int gcd(int n,int m){return m==0?n:gcd(m,n%m);}
int read()
{
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.