code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int k, x;
cin >> k >> x;
for (int i = 1; i < 2 * k; i++) cout << x - k + i << ' ';
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int sum = 0;
int m = 10000;
for (int i = 0;i < 4;i++){
int tmp; cin >> tmp;
sum += tmp;
m = min(m,tmp);
}
int a,b; cin >> a >> b;
cout << sum-m+max(a,b)... | 0 |
#include <functional>
#include <string>
#include <algorithm>
#include <iostream>
#include <vector>
#include <utility>
#include <type_traits>
namespace loquat {
template <int MOD>
class modulus_integer {
public:
typedef modulus_integer<MOD> self_type;
private:
int m_value;
static self_type unsafe_construct(int x) noe... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
const LL mod = 1e9+7;
int main(){
int N; cin >> N;
vector<int> A(N);
int x = 0, y = 0;
vector<vector<vector<int>>> nam... | 1 |
#include<bits/stdc++.h>
const int MN=100000+5,P=1000000007,inv2=P+1>>1;
using namespace std;
typedef long long ll;
template<typename T>inline T&IN(T&in){
in=0;char c=getchar();int f=1;
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))in=in*10+c-'0',c=getchar();
return in*=f;
}
int n;
int a[4][MN],c[... | #include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 90;
int n, a[3][N], c[N], p[N], m, S, t[N * 3], bl[N * 3];
bool r[N];
void Ji (bool x) { if (!x) puts("No"), exit(0); }
bool Pd () {
bool ret = 0;
for (int i = 1; i <= S; ++i) t[i] = 0;
for (int i = 1; i <= m; ++i) ++t[p[i]];
for (int i = 1, j = 0... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <array>
#include <bitset>
using namespace std;
typedef long long ll;
const ll mod=1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pll pair <ll , ll>
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define X first
#define Y second
#define LB(x) ((x) & -(x))
#define BIT(a , b) (((a)>>(b)) ... | #include <iostream>
#include <algorithm>
signed main() {
int n;
std::cin >> n;
n = 2*n;
int l[n];
for(int i = 0; i < n; i++)
std::cin >> l[i];
std::sort(l, l+n);
int ans = 0;
for(int i = n-2; i >= 0; i -= 2)
ans += l[i];
std::cout << ans << std::endl;
return 0;
}
| 1 |
#include<iostream>
using namespace std;
int main() {
string str;
cin >> str;
//0から4文字分
str.replace(0, 4, "2018");
printf("%s", str.c_str());
return 0;
}
| #include <stdio.h>
int main (){
int year;
int month;
int date;
int x;
scanf ("%d/%d/%d", &year, &month, &date);
x = year + 1;
printf ("%d/%02d/%02d\n", x, month, date);
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int n,p;
while(cin >> n >> p, n!=0 && p!=0){
int s[n];
int index = 0;
int stone = p;
for(int i=0;i<n;i++){
s[i] = 0;
}
while(true){
if(stone > 0){
s[index]++;
stone--;
}else if(stone == 0){
... | #include <iostream>
#include <cmath>
using std::cin;
using std::cout;
using std::endl;
int main(){
int n;
int p;
int a[100];
int b[100];
int flag = 0;
int i = 0;
int pp;
while(cin >> n >> p){
pp = p;
for(int j = 0;j < n;j++){
a[j] = 0;
}
i = 0;
flag = 0;
if(n == 0 && p ==... | 1 |
#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 MAXN 10005
#define eps 1e-12
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef do... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
struct segtree_lazy {
int n;
vector<T> tree, lazy;
T def = numeric_limits<T>::max(), none = -1;
segtree_lazy(int n_) {
for (n = 1; n < n_; n *= 2) {
}
tree.assign(2 * n, def);
lazy.assign(2 * n, none);
}
T merge(T a, T b) {
ret... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment (linker, "/STACK:526000000")
#include "bits/stdc++.h"
using namespace std;
typedef string::const_iterator State;
#define eps 1e-8L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define pb push_back
#define mp ... | #include <bits/stdc++.h>
#define itn int
#define REP(i, n) for (ll i = 0; i < n; i++)
#define IREP(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define SENTINEL 2000000000
#define NIL -1
using namespace std;
typedef long long ll;
const ll MAX =... | 1 |
#include <iostream>
using namespace std;
int main(){
long long n, a, b; cin >> n >> a >> b;
long long x[n];
for(int i = 0; i < n; ++i) cin >> x[i];
long long dp[n+1];
dp[0] = 0;
dp[1] = 0;
for(int i =2; i <= n; ++i){
dp[i] = min(a*(x[i-1]-x[i-2]), b) + dp[i-1];
}
cout << dp[n] << endl;
return 0... | #include <bits/stdc++.h>
#define rep(i, ns, ne) for (int i = ns; i < ne; ++i)
using namespace std;
using ULL = unsigned long long;
int main() {
ULL N, a, b, west, east, chk, ans = 0;
cin >> N >> a >> b >> west;
rep(i, 1, N) {
cin >> east;
chk = (east - west) * a;
if (chk > b) {
ans += b;
} e... | 1 |
#include <stdio.h>
int e;
int x, y, z;
int m;
int main(void)
{
while(1) {
m = 1000000;
y = 0;
z = 0;
scanf("%d", &e);
if (e == 0) break;
while (z * z * z <= e) {
while (y * y <= e - z * z * z) {
... | #include<iostream>
#include<vector>
using namespace std;
int main(void){
int a,b,c,n;
while(cin>>a>>b>>c,a+b+c){
cin>>n;
vector<int> in(a+b+c+1,2);
vector<vector<int> > jud(n,vector<int>(4,0));
for(int l = 0 ; l < n ; l ++){
int i , j , k , r;
cin>>i>>j>>k>>r;
if(r == 1){
in[i] = in[j] ... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <cstring>
#include <string.h>
#include <sstream>
#include <iomanip>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <tuple>
#include <vector>
#... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/adaptor/indexed.hpp>
using namespace std;
using namespace boost::adaptors;
using namespace std::string_literals;
using ll = int64_t;
using vecint = vector<int>;
using... | 0 |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define int long long
#defi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int x;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define ll long long int
#define pb push_back
typedef pair<ll,ll> ipair;
#define F first
#define S second
/*
//functions from gfg
long long int power(long long int x,long long int y,long long int p)
{
long long int res = 1; // Initialize ... | #include<iostream>
using namespace std;
int angka [10], brpkali, total;
int main (){
for (int i=1; i<=3; i++){
cin>>angka[i];
}
cin>>brpkali;
for (int i=1; i<=3; i++){
for (int j=1; j<=3; j++){
if (j==i){
}else if (angka [i]>angka [j]){ //sort;
swap(angka [i], angka [j]);
}
}
}
for (int i=1... | 0 |
#include<cstdio>
#include<algorithm>
using namespace std;
long long K;
long long po[20], C[20], res;
void Do(int b, int e, long long S, long long c) {
if (!c)return;
if (b >= e) {
if (S == K) {
if (b == e)res += 10*c;
else res+=c;
}
return;
}
if (abs(S - K) > po[e + 1])return;
int i;
for (i = -9; i <=... | #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 ... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0... | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int main()
{
ll n,m,t,i,res=0;
cin >> n;
m=(ll)sqrt(n);
for(i=m;i>0;i--)
if(n%i==0){
t=n/i;
while(t>0){
t/=10;
res++;
}
cout << res << endl;
return 0;
}
retur... | 1 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pi std::pair<int, int>
#define mkp std::make_pair
#define ll long long
#define pb push_back
#define fi first
#define se second
//{{{IO
namespace IO{
template <class I> void read(I &x){
x = 0; char ch = getchar(); bool f = false;
for(... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n, m;
cin >> n >> m;
vector<int> ac(n, 0);
vector<int> wa(n, 0);
rep(i, m)
{
int p;
string s;
cin >> p >> s;
p--;
if (ac[p] == 1)
continue;
if (... | 0 |
#include <iostream>
#include <vector>
#include <utility>
#include <queue>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#define llint long long
#define mod 1000000007
#define inf 1e18
using namespace std;
typedef pair<double, llint> P;
typedef pair<llint, P> E;
llint n;
llint a, b, c, d;
llint dp[1005][10... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll dp[1010];
ll F[1010], FI[1010];
ll n, a, b, c, d;
ll pow(ll a, ll b) { return b? pow(a * a % mod, b >> 1) * (b & 1? a : 1) % mod : 1; }
int main()
{
ll i, j, k;
scanf("%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d);
... | 1 |
/*solved by RAKIB JOY*/
#include<stdio.h>
#include<stdbool.h>
bool dislike[10];
int main()
{
int n,k,a;
scanf("%d%d",&n,&k);
while(k--)
{
scanf("%d",&a);
dislike[a]=true;
}
for(int i=n;;i++)
{
int maybe=i;
bool ok=true;
while(maybe)
{
in... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,i... | 0 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std; //std::の省略のため
using ll = long long;
int main()
{
string s[3];
for (int i = 0; i < 3; i++)
cin >> s[i];
int count = 0;
for (;;)
{
char tmp = s[count][0];
//cout << tmp << " " << s[count] << endl;
if (s[coun... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD 1000000007
#define INF 1e9
#define INFL 1e12
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class T>vo... | 0 |
#include <iostream>
#include<vector>
#include<cstring>
using namespace std;
int n, m;
vector <int> g[15], c[15];
void add_edge(int u, int v, int w) {
g[u].push_back(v);
c[u].push_back(w);
}
int dp[1 << 15][15];
int prep[1 << 15][15];
void upd(int &x, int y) {
if (y < x) x = y;
}
int main() {
scanf("%d %d", &n,... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<fstream>
#define MOD (1000000007)
using namespace std;
typedef long lo... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define dbg(a) cerr << __LINE__ << ": " << #a << " = " << a << '\n'
template<class T> inline istream& operator>>(istream& str, vector<T> &a) { for (auto &i : a) str >> i; return str; }
typedef long long ll;
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n, ... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> P1;
typedef pair<P,P> P2;
#define pu push
#define p... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll s;
cin >> s;
int cnt = 0;
ll S = s;
while(S > 0){
S /= 10;
cnt++;
}
const int f = 753;
int ans = 1000;
for(int i = 3; i <= cnt;... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
string S;
cin>>S;
int ans=100000;
for(int i=0;i<=S.size()-3;i++){
string res;
res[0]=S[i];
res[1]=S[i+1];
res[2]=S[i+2];
int X=stoi(res);
ans=min(abs(X-753),ans);
}... | 1 |
/*
* 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)
int N;
int cnt[10];
int main(){
do{
cin>>N;
if (N){
fill(cnt,cnt+10,0);
REP(i,N){
int a;
cin>>a;
cnt[a]++... | #include <stdio.h>
int main(void)
{
int a[10]={0};
int n,i,j,k,l,x;
for(j=0;j<20;j++)
{
//printf("?????°???");
for(l=0;l<10;l++)
a[l]=0;
scanf("%d",&n);
if(n==0)
break;
else
{
for(i=0;i<n;i++)
{
scanf("%d",&x);
a[x]=a[x]+1;
}
}
for(k=0;k<10;k++)
{
if(a[k])
{
for(l=0... | 1 |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
... | #include <bits/stdc++.h>
using namespace std;
struct Graph {
int n;
int time;
vector<vector<int>> g;
vector<int> num, low;
vector<vector<int>> scc;
stack<int, deque<int>> S;
vector<bool> inS;
Graph(int n) : n(n), g(n), num(n, -1), low(n, -1), inS(n) {}
void addEdge(int u, int v) {
g[u].push_bac... | 0 |
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007LL
#define eps 1e-8
using namespace std;
string a3[3]={"aa.","..b","..b"};
string a4[4]={"aabc","ddbc","efgg","efhh"};
string a5[5]={"aabbc","dde.c","ffegg","..hij","..hij"};
string a6[6]={"aabbcc","ddeeff","ghi...","ghi..."... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<map>
using namespace std;
int main(){
for(;;){
vector<int> lot(5);
int ans = 0;
if(scanf("%d",&lot[0]) == EOF) break;
for(int i=1; i<5; i++) scanf(",%d",&lot[i]);
sort(lot.begin(),lot.end());
map<int,int> card;
... | 0 |
#include <bits/stdc++.h>
using intl = long long;
using itnl = long long;//typo用
using uintl = unsigned long long;
using itn = int;//typo用
using ld = long double;
using namespace std;
#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)
#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)
#define repi(i, a, b) f... | #include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | 1 |
//#define _GLIBCXX_DEBUG
#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+... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1E5;
bool isSheep[MAXN];
bool o[MAXN];
bool options[2] = {true, false};
bool isValid(int n)
{
bool firstSheep = isSheep[0];
for (int i = 1; i < n; i++)
{
if (isSheep[i] && o[i] || !isSheep[i] && !o[i])
{
isSheep... | 1 |
#include<iostream>
#include<math.h>
using namespace std;
int maxn=1000;
int main(){
int A[maxn];
double a,b=0,c=0,d=0,e=0,f=0,g=0,w=0,x=0,y=0,z=0;
for(int i=0;i!=6;i++){
cin>>a;
A[i]=a;
}
for(int i=4;i!=0;i--){
b=abs(A[0]-A[i]);
if(b>A[5]){cout<<":("; return 0;}
... | #include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <assert.h>
#include <cmath>
#include <stack>
#include <deque>
#include <set>
#include <unordered_map>
#include <complex>
#include <fstream>
#include <map>
#include <numeric>
#include <functional>
... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MOD 1000000007
#define INF 1e9
#define All(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
int main() {
int h,w,n;
cin>>h>>w>>n;
if(w>h)swap(w,h);
int ans=ceil((double)n/h);
cout<<ans<<endl;
re... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const double EPS = 1e-9;
int main(){
int l[10], v[2];
while(scanf("%d,", &l[0])!=EOF){
for(int i=1; i<10; i++){
scanf("%d,", &l[i]);
}
scanf("%d,%d", &v[0], &v[1]);
int total=0;
for(int i=0; i<10; i++){
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
map<int, map<int, int> > dp1;
map<int, map<int, int> > dp2;
int mo=1000000007;
int32_t main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin>>n>>m;
int x[n+5];
int y[m+5];
int dpx[n+5];
int dpy[m+5];
for... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | 0 |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <li... | #include<iostream>
using namespace std;
int main(){
while(1){
int n,m,b,c,cnt=0,a[101]={};
cin>>n>>m;
if(n+m==0)break;
for(int i=0;i<n;i++){
cin>>b;
for(int j=0;j<b;j++){
cin>>c;
a[c]++;
}
}
int x=0,max=0;
for(int i=0;i<101;i++){
if(max<a[i]&&m<=a[i]){
max=a[i];
... | 0 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
const long long MOD = (long long)1e9 + 7;
int main(){
int n, m;
cin >> n >> m;
vector<long long> x(n), y(m);
for(int i = 0; i < n; i++){
cin >> x[i];
}
for(int i = 0; i < m; i++){
cin ... | /*-- ILSH --*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define pop pop_back
#define mp make_pair
#define vii vector < int >
#define vll vector < ll >
#define dt cout<<"HERE\n";
#define pii pair < int , int >
#define pll pair < ll , ll >
#define... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<stdio.h>
#include<deque>
#include<map>
#include<queue>
#include<cmath>
typedef long long ll;
#define debug(x) cout << #x << '=' << x << endl;
#define debug_arr(a, n) for(ll i = 0; i < n; i++)cout << a[i] << ' '
#define inf 100000000000
... | // 2020-07-15 23:13:36
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
const int max_n = 1e5;
const ll mod = 1e9+7;
const ll INF = 1LL<<60;
typede... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
int main(){
ll N,M;
cin >> N >> M;
if(M%2==0){
rep(i,M/2){
cout << i+1 << " " << M-i+1 << endl;
cout << M+i+2 << " " << 2*M-i+... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
vector<string> a;
bool cmp(string s, str... |
#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++)
typedef long long int ll;
typedef vector<int>vi;
typedef pair<int,int>pi;
int main()
{
int arr[3];
cin>>arr[0]>>arr[1]>>arr[2];
cout<<arr[2]<<" " <<arr[0]<... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define Inv(x) QPow(x,Mod-2);
const int maxN=2005;
const int maxM=maxN*maxN;
const int Mod=1e9+7;
int n,K;
int Fc[maxM],Ifc[maxM];
int F[maxN][maxN];
int QPow(int x,int cnt);
int C(int n,int m);
int main(){
Fc[0]=Ifc[0]=1;for (int i=1;i<maxM;i++) Fc[i]=1ll*Fc[i-1]*i%... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
using namespace std;
int main(){
int L,R;
cin>>L>>R;
ll x=2000000000;
if(R-L+1>=2019){
cout<<0<<endl;
}
else{
ll w=0;
for(ll i=L;i<R;i++){
for(ll j=L+1;j<=R;j++){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin>>a>>b;
cout<<b<<a;
} | #include <iostream>
#include <math.h>
#include <string>
using namespace std;
int main()
{
int a,b,c,temp=0,temp2=0;
cin>>a>>b>>c;
swap(a,b);
swap(a,c);
cout<<a<<" "<<b<<" "<<c<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>
using namespace std;
const double eps=1e-10;
const int dy[]={-1,-1,0,1,1, 1, ... | #include<iostream>
#include<string>
#include<math.h>
using namespace std;
int main(){
int h,w,s;
while(true){
cin>>h>>w;
if(h==0&&w==0)
break;
bool t=true;
s=h*h+w*w;
h++;
while(true){
if(h*h>=s-h*h)
break;
if(s==h*h+(int)sqrt((double)s-h*h+0.0)*(int)sqrt((double)s-h*h+0.0)){
t=false;
break;
}
... | 1 |
#include <bits/stdc++.h>
#define loop(times) for(int i=0;i<(times);i++)
using namespace std;
int main() {
while(1<2){
int n;
long long max;
cin>>n;
if(n==0)break;
int a[n];
int s[n];
loop(n)cin>>a[i];
max=a[0];
s[0]=a[0];
loop(n)s[i+1]=s[i]+a[i+1];
for(int k=0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
const ll N=2e5+50;
vec l(N),r(N);
vec a(N);
ll cal(ll x) {
if(x<3) {
return 0;
}
return max({l[x-1]... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define all(a) (a).begin(), (a).end()
#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++)
const int MOD = 1e9+7;
const ll LINF = 1e18;
con... | #include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
string s;
cin >> s;
int l = s.length();
if(s[0]!='A'){
cout << "WA\n";
return 0;
}
int i, cnt = 0;
for(i=1; i<l; i++){
if(isupper(s[i])){
if(i==1 || i==l-1 || s[i]!='... | 1 |
#include<bits/stdc++.h>
using namespace std;
constexpr int64_t MAX_LEN = 200000;
set<int64_t> up[MAX_LEN + 1], right_st[MAX_LEN + 1], down[MAX_LEN + 1], left_st[MAX_LEN + 1];
set<int64_t> downs[MAX_LEN * 2 + 1], lefts[MAX_LEN * 2 + 1];
int main() {
int64_t N;
cin >> N;
vector<int64_t> X(N), Y(N), dir_num(... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int const MX = 2e5 + 2, MOD = 1e9 + 7;
int main()
{
int t = 1;
// cin>>t;
while(t--){
int n;
cin>>n;
int l[101];
for(int i = 0; i < n; i++){
cin>>l[i];
}
int cnt = 0;
for(int i = 0; i < n - 2; i... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
// #include <prettyprint.hpp>
using namespace std... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int h, w, n;
cin >> h >> w >> n;
cout << (n + max(h, w)-1) / max(h, w) << endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <string>
#include <utility>
#include <queue>
#include <algorithm>
#include<set>
using namespace std;
long long int mpown(long long int m, int n);
long long int bign=1000000007;
int bitCount(int bits);
int main()
{
long long int n,m,k... | 0 |
//Author : Sukarna Paul
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/detail/standard_policies.hpp>
#define pi acos(-1)
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define MAX 300005
#... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int R;
cin >> R;
if(R < 1200) {
cout << "ABC\n";
} else if(R<2800) {
cout << "ARC\n";
} else {
cout << "AGC\n";
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
//long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin(... | #include <bits/stdc++.h>
using namespace std;
int main() {
//long long a,b;
//int *num=new int[4];
//char *s=new char[3];
string s;
cin >> s;
if (s.find("AC") != std::string::npos) {
cout << "Yes" << "\n";
}else
cout << "No" << "\n";
}
| 1 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
char s[5000];
long long n,i,j,k,total=0,red[5000]={0},green[5000]={0},blue[5000]={0},r=0,g=0,b=0,x,y;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>s[i];
}
for(i=1;i<=n;i++)
{
if(s[i]=='R')
{
r++... | #include <iostream>
#include <string>
using i64 = long long;
int main() {
int n;
std::string s;
std::cin >> n >> s;
i64 cnt[3] {};
for (auto c : s) cnt[c == 'R' ? 0 : c == 'G' ? 1 : 2]++;
i64 ret = cnt[0] * cnt[1] * cnt[2];
for (int i = 0; i < n; i++) for (int j = 1; i - j >= 0 && i + j <... | 1 |
#include <bits/stdc++.h>
#define rep(i, x, y) for (int i = x; i <= y; i++)
using namespace std;
const int N = 16;
int n, m, tot, sz, dp[N][1 << N], e[N][N], val[1 << N]; // val: 预处理每个联通块所有边的总值
void pre() {
rep(s, 0, sz)
rep(i, 1, n) if ((s >> (i - 1)) & 1)
rep(j, i + 1, n) if ((s >> (j - 1)) ... | #include <bits/stdc++.h>
using namespace std;
#define rint register int
#define gc() getchar()
inline int read(){int r=0,s=0,c=gc();for(;!isdigit(c);s=c,c=gc());for(;isdigit(c);(r*=10)+=c-48,c=gc());return s^45?r:-r;}
int f[16][32768], g[32768], w[16][16], n, E;
int main()
{
n = read(), E = 1<<n; for(rint m = read(), ... | 1 |
#include <iostream>
using namespace std;
int main()
{
int n, i = 3, tmp;
cin >> n;
while (i <= n) {
if (i % 3 == 0) {
cout << ' '<< i ;
}
else{
for (tmp = i; tmp != 0; tmp /= 10) {
if (tmp % 10 == 3) {
cout << ' '<< i ;
break;
}
}
}
i++;
}
cout << endl;
return 0;
} | #include<stdio.h>
#include<string.h>
int main(void) {
int a[10000],n,b=0,i,x,d=3;
char r[10000];
char s[10000];
scanf("%d", &n);
sprintf(s, "%d", d);
for(i = 1; i <= n; i++) {
sprintf(r,"%d", i);
if (i % 3 == 0) {
a[b] = i;
b++;
}
else if (strstr(r,s) != NULL) {
a[b] = i;
b++;
}
}
for (x =... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring> //memset(dp,0,sizeof(dp))
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) fo... | #include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> ls[100000];
int cost[100000];
int main(){
int v,e,r; cin>>v>>e>>r;
for(int i=0;i<e;i++){
int s,t,d; cin>>s>>t>>d;
ls[s].push_back(make_pair(t,d));
}
for(int i=0;i<100000;i++) cost[i]=INT_MAX;
cost[r]=0;
priority_queue<pair<int,int>> pq;
pq.p... | 0 |
#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... | #include<iostream>
#include<algorithm>
using namespace std;
#define long long long
long sol(long);
int main(){
long a=0;
cin>>a;
cout<<sol(a)<<endl;
return 0;
}
long pow10(long a){
if(a<0)return 0;
long r=1,c=10;
while(a>0){
if(a&1)r*=c;
c*=c;
a>>=1;
}
return r;
}
long will[50];
long dfs(long d,lon... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#... | #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()){
... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
bool solve() {
int M, Nmin, Nmax;
cin >> M >> Nmin >> Nmax;
if (M == 0 && Nmin == 0 && Nmax == 0) {
return false;
}
int p[200];
for (int j = 0; j < M; j++) {
cin >> p[j];
}
int ind = Nmin-1;
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n, a, b;
cin>>n>>a>>b;
long long int x[n];
for(int i=0; i<n; i++) cin>>x[i];
long long int walk_max=b/a;
long long int tired=0;
for(int i=0; i<n-1; i++){
if(x[i+1]-x[i]>walk_max) tired+=b;
else if(x[i+1]-x[i]<=walk_ma... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n, X;
vector <ll> b, l, r;
ll calc(int day, int a){
return (a <= b[day] ? l[day] : r[day]) * (a - b[day]);
}
ll sum(int day, int len){
if(len <= b[day]) return len * l[day];
return b[day] * l[day] +... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,m,u,v,w;
ll bismarck[(1<<15)][15],e[15][15],sum[(1<<15)];
int main()
{
cin>>n>>m;
while(m--)
{
cin>>u>>v>>w;
u--,v--;
e[u][v]=e[v][u]=w;
}
for(int i=0;i<1<<n;i++)
{
for(int j=0;j<n;j++){
if((i>>j)&1)
{
for(int k=j+1;k<... | 0 |
#include<iostream>
#include<algorithm>
#define MOD 1000000007
using namespace std;
typedef long long ll;
signed main(){
ll n,m,xsum=0,ysum=0,ans=0;
cin >> n >> m;
ll tx[n],ty[m],x[n],y[m];
for(ll i=0;i<n;i++){
cin >> tx[i];
}
for(ll i=0;i<m;i++){
cin >> ty[i];
}
sort(tx,tx+n);
sort(ty,ty+m);
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
signed main(){
int n,m,x1,y1;
cin>>n>>m>>x1;
int ans1=0,ans2=0;
for(int i=0;i<n-1;i++){
int x2;
cin>>x2;
ans1=(ans1+(x2-x1)*(i+1)%mod*(n-1-i)%mod)%mod;
x1=x2;
}
cin>>y1;
for(int i=0;i<m-1;i++){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int N=S.size();
if(S=="zyxwvutsrqponmlkjihgfedcba"){
cout<<"-1"<<endl;
}
else if(N==26){
vector<char> v(26);
for(int i=0;i<26;i++){
v[i]=S[i];
}
next_permutation(begin(v),end(v));
for(int i=0;i<26;i++... | #include<bits/stdc++.h>
using namespace std;
signed main(){
string s,t;
cin>>s;
t = s;
vector<int> alp(26);
for(auto c:s)alp[c-'a']++;
string ans = "zzzzzzzzzzzzzzzzzzzzzzzzzzz";
auto chmin = [](auto& a,auto b){if(a>b)a=b;};
while(1){
for(int i=0;i<26;++i)if(alp[i]==0){
string tmp = s;
... | 1 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <math.h>
#include <numeric>
#include <ostream>
... | #include <iostream>
#include <string>
#include <vector>
#include <atcoder/all>
using ll=long long;
using namespace std;
using namespace atcoder;
int main(){
int N,Q;
cin>>N>>Q;
fenwick_tree<ll> fw(N);
ll a;
for(int i=0;i<N;i++){
cin>>a;
fw.add(i,a);
}
int q,x,y;
for(int... | 1 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
int A, B; cin >> A >> B;
int cnt = 0;
for (int i = A; i <= B; ++i) {
string s = to_string(i);
int n = s.size();
bool ok = true;
for (int i = 0; i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int A,B;
int a=0;
cin >> A >> B;
for(int i=A;i<=B;i++){
if((i%10==i/10000)&&((i/10)%10==(i/1000)%10)){
a++;
}
else {}
}
cout << a <<endl;
} | 1 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> l(2 * n);
rep(i, 2 * n) {
cin >> l[i];
}
sort... | #include<stdio.h>
#include<algorithm>
#define reg register
#define ri reg int
#define rep(i, x, y) for(ri i = x; i <= y; ++i)
#define nrep(i, x, y) for(ri i = x; i >= y; --i)
#define DEBUG 1
#define ll long long
#define max(i, j) (i) > (j) ? (i) : (j)
#define min(i, j) (i) < (j) ? (i) : (j)
struct IO {
#define MAXSIZE... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
unsigned long long int n;
cin>>n;
cin>>s;
if(n>=s.size())
cout<<s;
else{
s.erase(s.begin()+n,s.end());
s.append("...");
cout<<s;
... | #include <iostream>
using namespace std;
int main() {
//入力を受け取る
int D, T, S;
cin >> D >> T >> S;
//高橋君の移動時間を計算する
int dist = S * T;
//Dとdistの大小関係に応じて出力をする
if (dist >= D) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for(int i=0; i<(a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { c... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,l;
cin >> n >> l;
int a[n];
int all = 0;
for(int i = 1; i <= n; i++){
a[i] = l + i - 1;
all += a[i];
}
int minu = 0,maxmin = 2000000;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(j != i){
mi... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll A, B, K;
int main() {
cin >> A >> B >> K;
for (int i = 1; i <= K; i++) {
if (i % 2 == 1) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
int w;
cin>>s>>w;
for (int i=0;i+w<=s.size();i+=w) {
cout<<s[i];
}
if (s.size()%w!=0) {
reverse(s.begin(),s.end());
string tmp=s.substr(0,s.size()%w);
cout<<tmp[tmp.size()-1];
}
cout<<... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string str;
int n;
cin>>str>>n;
string adj;
int at = 0;
while(at < str.size())
{
adj.push_back(str[at]);
at+=n;
}
cout<<adj<<endl;
return 0;
} | 1 |
#include <stdio.h>
int main(){
long long n, sum = 0;
scanf("%lld", &n);
for(long long i = 1 ; i <= n ; i++){
if(i%3 != 0 && i%5 != 0){
sum+=i;
}
}
printf("%lld\n", sum);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define N 20003
int n;
int a[N];
string S,X,Y;
map<pair<string,string>,LL>mp;
LL ans;
inline int read(){
int X=0,w=0;
char ch=0;
while (ch<'0' || ch>'9')
w|=ch=='-',ch=getchar();
while (ch>='0' && ch<='9')
X=(X<<3)+(X<<1)+(ch^48),ch=getchar()... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin>>N;
vector <ll> ans;
// N--;
while(N){
ll rest=(N-1)%26;
N--;
N/=26;
ans.push_back(rest);
}
ll len=ans.size();
for(ll i=len-1;i>=0;i--){
char c='a'+ans[i];
... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL <<60;
void func(long long x){
if(x==0){
cout<<"a";
}
else if(x==1){
cout<<"b";
}
else if(x==2){
cout<<"c";
}
else if(x==3){
cout<<"d";
}
else if(x==4){
cout<<"e";
}
else if(x==5){
cout<<"f";
}
el... | 1 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).beg... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int hund, ten, one, ans;
for (int i=n ; ; i++){
hund = i/100;
ten = (i-hund*100)/10;
one = i-hund*100-ten*10;
if (hund == ten && ten == one){
ans = i;
break;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
// DEEP
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fwd(i,a,n) for(int i=a;i<=n;i++)
#define bak(i,a,n) for(int i=a;i>=n;i--)
#define all(v) v.begin(),v.end()
#define pb push_back
#define lop '\n'
#define mp make_pair
typedef... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9+7;
... | 1 |
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,hang[8],lie[8],zuo[15],you[15];//标记行，列，斜下，斜上
int book[8][8];//控制输出
void print()
{
for(int i=0; i<8; i++)
{
for(int j=0; j<8; j++)
{
if(book[i][j])
{
if(hang[i]!=j)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#define int long long
#define dotimes(i, n) for (int i : range(n))
using namespace std;
class range {
class iterator {
int i, s;
public:
iterator(int i, int s): i(i), s(s) {}
int& operator*() {
return i;
}
void operator++() {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#defi... | #include<iostream>
using namespace std;
int main(void)
{
int D,S,T;
cin>>D>>T>>S;
int s=T*S;
if(s>=D){
cout<<"Yes";
} else{
cout<<"No";
}
return 0;
} | 1 |
// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | #include <iostream>
#include <algorithm>
#include <string.h>
#include <vector>
#include <map>
using namespace std;
int main(){
int h,w;
int i,j;
int flag;
while(cin>>h>>w,h|w){
int taikaku;
int tmph=1111,tmpw=1111;
taikaku=h*h+w*w;
flag=false;
for(i=1;i<150;i++){
for(j=1;j<150;j++){
... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
int main()
{
int n = 1;
std::cin >> n;
while (n)
{
std::vector<int32_t> num_list{};
while (n--)
{
int tmp = 0;
std::cin >> tmp;
num_list.push_back(tmp);
}
std::vector<int32_t> comfarm_list{};
std::vector<int32_t> sum_list{};
fo... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int do_stuff(int n)
{
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
int max_so_far = 0;
int max_ending_here = 0;
for (int i = 0; i < n; ++i) {
int curr = a[i];
max_end... | 1 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _T> static void ge... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
int ans = 0;
int c = 0;
rep(i, s.size()) {
if (s[i] == 'T') ++c;
else --c;
ans = max(ans, 2 * c);
}
cout << ans << endl;... | 1 |
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <vector>
using namespace std;
#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++)
int main(){
int n , k;
cin >> n >> k;
int s , t;
s = k... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 |
#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;
// re... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef int_fast64_t ll;
template<int N, typename T, T M>
struct ModFact {
T fact[N+1];
constexpr ModFact() : fact() {
fact[... | 1 |
#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 <cstdio>
int n,a[3];
int gdb(int a,int b){
if(b == 0){
return a;
}
return gdb(b,a%b);
}
int main(){
scanf("%d",&n);
for(int i = 0; i < n; i++){
scanf("%d",&a[i]);
}
int g;
if(n == 2){
g = gdb(a[0],a[1]);
}
else{
g = gdb(gdb(a[0],a[1]),a[2]);
}
for(int i = 1; i <= g/2; i++){
if(g % i ... | 1 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
#include <numeric>
using lint = long long;
int main()
{
lint h, w, a, b;
scanf("%lld", &h);
... | #include <bits/stdc++.h>
#define ll long long
#define ulli unsigned long long int
#define ld long double
#define endl "\n"
using namespace std;
void solve() {
int a, b, m;
cin >> a >> b >> m;
vector<int> price_a(a);
vector<int> price_b(b);
int min_a = INT_MAX;
for (int& x: price_a) {
... | 0 |
#include<stdio.h>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inc... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using i64 = long long;
using f64 = double;
using pll = pair<i64, i64>;
using pii = pair<int, int>;
using ptx = pair<f64, f64>;
i64 mp[256];
int main() {
#ifdef HOME
freopen("agc019b.in", "r", stdin);
freopen("agc019b.out", "w", st... | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
int main(void)
{
int n, m, X, Y;
cin >> n >> m >> X >> Y;
vector<int> x(n), y(m);
rep(i, n) cin >> x[i];
rep(i, m) cin >> y[i];
int mx = *max_element(... | 1 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
const long long INF = 1LL << 60; // 1.15x10^18
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using edge = pair<int, long long>;
using Graph = vector<vector... | #include<stdio.h>
#define INF 100000001
int n,m;
int i,j,k;
int t[100][100];
int r,a,b,c;
bool used[100];
int d[100];
int ans;
int min(int a,int b){
if(a<=b)return a;
else return b;
}
int solve(int a,int b){
int v;
while(1){
v=-1;
for(k=0;k<n;k++)if(!used[k]&&(v==-1||d[k]<d[v]))v=k;
if(d[v]==INF||v==-1)brea... | 1 |
#include <bits/stdc++.h>
#define l first
#define r second
using namespace std;
typedef pair<int, int> ii;
ii p[100005];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; ++i) cin >> p[i].l >> p[i].r;
int l = 0, r = 1e9;
int x, y;
for (int i = 0; i < N; ++i) {
if (p[i].l > l) {
l = p[i].l;
x = i;
}
... | #include<bits/stdc++.h>
#include<tr1/unordered_map>
#define ri register int
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> poly;
#define pb push_back
const int rlen=1<<18|1,inf=0x3f3f3f3f;
const ll Inf=1e18;
char buf[rlen],*ib=buf,*ob=buf;
#d... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mo 1000000007
int i,j,k,m,n,x,y,z,S,Ans,ans,dp[41][1<<17];
inline ll Pow(ll x,ll d) {
ll ans = 1, y = x;
for (; d; y = y * y % mo, d >>= 1)d & 1 ? ans = ans * y % mo : 0;
return ans;
}
int main() {
cin >> n >> x >> y >> z;
S ... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long N, M, K;
long long res = 0;
// mod. m での a の逆元 a^{-1} を計算する
long long Modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swa... | 0 |
#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 const MOD = 998244353;
long long modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
... | #include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fs first
#define sc second
using namespace std;
typedef long long ll;
int N;
map<ll, int> h;
vector<ll> v;
string s;
pair<ll, ll> frac[200100];
ll cnt[110][110];
pair<ll, ll> getFrac(string &s) {
ll x = 0, y = 1;
bool dec = false;
for(int ... | 0 |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
class dice{
int* me;
public:
dice(int me_[6]){
me = me_;
}
int Top(){
return me[0];
}
void East(){
swap(me[0], me[3]);
swap(me[3], me[5]);
swap(m... | #include<iostream>
#include<string>
using namespace std;
struct dice{
int top;
int front;
int left;
int right;
int back;
int bottom;
};
int main(){
//????????????????????¢?????°????????\?????????
struct dice X;
cin >> X.top;
cin >> X.front;
cin >> X.right;
cin >> X.left;
cin >> X.back;
cin >> X.bottom;
... | 1 |
#include<iostream>
using namespace std;
int n,res=0;
bool map[20][20];
bool fh[10],fc[10],fl[20],fr[20];
void print()
{
for(int i=0;i!=8;++i)
{
for(int j=0;j!=8;++j)
{
if(map[i][j]) cout<<'Q';
else cout<<'.';
}
cout<<endl;
}
}
bool check(int x,int y)
{
return !(fh[x] || fc[y] || fr[x+y] || fl[x+... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
int k;
for(int &i:A)
cin>>i;
cin>>k;
sort(A.begin(),A.end());
if(A.at(4)-A.at(0)>k)
cout<<":("<<endl;
else
cout<<"Yay!"<<endl;
} | 0 |
#include <cstdio>
#include <cstring>
using namespace std;
int n, k;
int array[10];
int c[4];
bool use[10];
char str[10000][100];
int m;
int number[10000];
int p;
void Search(int i, int j)
{
if (j == k){
for (int l = 0; l < k; l++){
char nstr[3];
sprintf(nstr, "%d", c[l]);
strcat(str[m], nstr);
}
... | #include <iostream>
#include <string>
using namespace std;
class Dice {
private:
int *numbers;
public:
Dice(int *numbers) {
this->numbers = numbers;
}
int getCurrentNumber() {
return this->numbers[0];
}
void turn(char direction) {
switch (direction) {
case 'N':
... | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
ll gcd(ll C, ll D) {
if (C < D) gcd(D, C);
if (C%D == 0)return D;
else return gcd(D, C%D);
}
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> A(N);
ll sum = 0;
rep(i, N)... | #include<iostream>
using namespace std;
long N,A[2<<17],ans;
main()
{
cin>>N;
for(int i=0;i<N;i++)cin>>A[i];
int i=0;
while(i<N)
{
while(i+1<N&&A[i]+1==A[i+1])i++;
if(A[i]>i||i+1<N&&A[i]+1<A[i+1])
{
cout<<-1<<endl;
return 0;
}
ans+=A[i];
i++;
}
cout<<ans<<endl;
}
| 0 |
#include <bits/stdc++.h>
#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
using namespace std;
typedef long long ll;
const int inf = (int)1e9 + 7;
const int N = (int)1e5 + 7;
int n,m;
int top,mx;
int st[N],b[N];
int t[2001][2001];
char a[2001][2001];
int f (int ... | #include <cstdio>
#include <algorithm>
using namespace std;
int p[1010];
int sum[1002010];
int main(void){
int n,m;
while(scanf("%d%d",&n,&m) && (n||m)){
for(int i=0;i<n;i++){
scanf("%d",&p[i]);
}
p[n++] = 0; //0ツ点ツづ個スツコツアツづーツ催ャツづゥ
int size=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
sum[si... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #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... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
int main() {
int N;
cin>>N;
vector<int>A(N+2);
rep(i,0,N) cin>>A[i+1];
int sum=0;
rep(i,0,N+2){
sum+=abs(A[i... | #include <stdio.h>
#include <stdlib.h>
int n,k,card[10],count;
int check[10001];
// used[i]==1ÈçÎ iÍgÁÄ¢é
// used[i]==1ÈçÎ card[i]ÍgÁÄ¢é
void func(int a[],int now)
{
int i,j,temp,keta=0,flg;
if(now == k){
char str[9];
for(i=0;i<k;i++){
temp=sprintf(str+keta,"%d",a[i]);
keta+=temp;
}... | 0 |
#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<a+b+c-max(a,max(b,c))<<endl;
}
| #include<iostream>
#include<string>
using namespace std;
#define DICETOP 0
#define DICEFRONT 1
#define DICERIGHT 2
#define DICELEFT 3
#define DICEBACK 4
#define DICEBOTTOM 5
class Dice {
private:
int *diceface;
public:
Dice( int top, int front, int right, int left, int back, int bottom ) {
diceface = new int[6];... | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr <<... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define... | 1 |
#include <bits/stdc++.h>
#define debug(x) cout << #x << " = " << x << endl
#define REP(i , n) for(Long i = 0; i < (Long)n ; i++)
#define fore(i, a, b) for (Long i = a, to = b; i < to; i++)
#define foref(i, a, b) for (Long i = b - 1, to = a; i >= to; i--)
#define all(v) v.begin(), v.end()
#define SZ(v) (int)v.size()
#de... | #include <iostream>
#include <array>
#include <map>
using namespace std;
typedef unsigned long ul;
typedef array<ul, 6> dice;
bool f(int n)
{
static const array<dice, 6> tbl = {
0,1,2,3,4,5, 1,5,2,3,0,4, 2,1,5,0,4,3,
3,1,0,5,4,2, 4,0,2,3,5,1, 5,1,3,2,4,0};
dice d;
map<ul, bool> db;... | 0 |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <deque> // deque
#include <iomanip> //setprecsion
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#i... | #include <bits/stdc++.h>
using namespace std;
void input(int& rnTrgSu, int& rnTrgKin)
{
cin >> rnTrgSu >> rnTrgKin;
}
void searchMoney(int nTrgSu, int nTrgKin)
{
vector<int> cnvnMoney{10000, 5000, 1000};
int nCalKin;
int i, j;
for (i = 0; i <= nTrgSu; i++)
{
for (j = 0; j <= (nTrgSu - i); j++)
{
... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define uli unsigned 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... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int n,m,h[2010][2010],l[2010][2010],r[2010][2010],ans;
char s[2010][2010];
int main()
{
scanf("%d %d",&n,&m);getchar();
ans=max(n,m);
for(int i=1;i<=n;i++) scanf("%s",s[i]+1);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
... | 0 |
#include <stdio.h>
int main(void){
int l[10];
int v1, v2;
int len, tl;
float p;
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",
l, l+1, l+2, l+3, l+4, l+5, l+6, l+7, l+8, l+9, &v1, &v2) != EOF){
len = 0;
for(int i=0;i<10; ++i){
len += l[i];
}
p = v1 * len / (float)(v1 + v2);
if(p == 0.0){ puts("... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c;
while(1){
cin>>n;
if(n==0) break;
for(int i=0;i<n;i++){
cin>>a>>b>>c;
if(a==100 || b==100 || c==100){
cout<<"A"<<endl;
}else if((a+b)/2 >= 90){
cout<<"A"<<endl;
}else if((a+b+c)/3 >= 80){
c... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int road1[111][111];
int road2[111][111];
int n,m;
int a,b,cost,time;
int p,q,r;
int x;
while(1){
for(int i=0;i<111;i++){
for(int j=0;j<111;j++){
road1[i][j]=road2[i][j]=111111111;
}
}
cin >> n >> m;
if(... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct Graph{
Graph(int n):E(n),d(n){}
vector<vector<tuple<int,int,int>>>E;
vector<int>d;
void add_edge(int a,int b,int c,int d){
E[a].push_back(make_tuple(b,c,d));
}
void dijkstra(int s,int f){
priority_queue<P,vector<P>,greater<... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
set<int> nums;
int a;
whil... | #include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <math.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x)... | 1 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <str... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#defi... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int T,A,n;
cin >> n >> T >> A;
T--,A--;
vector<vector<int>> v(n)... | #include <cstdio>
#include <cmath>
using namespace std;
const int N=1e5+5;
const int E=N<<1;
const int mod=1e9+7;
int n,u,v;
int a[N],b[N];
int d1[N],d2[N];
int h[N],nx[E],to[E];
int ec;
int ans;
void ae(int u,int v)
{
ec++;
nx[ec]=h[u];
to[ec]=v;
h[u]=ec;
}
void dfs(int u,int f,int d[])
{
d[u]=d[f]+1;
for (int i... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.