code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
const int INF = 1000000007;
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multip... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<bool> v(55555 + 1);
for (int i = 2; i < v.size(); i++) {
if (!v.at(i)) {
for (int j = i * 2; j < v.size(); j += i) {
v.at(j) = tru... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll calc(ll &m, ll p) {
ll ret = 1;
m += p... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v... | 1 |
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = (double)(x2 - x1) * (double)(x2 - x1);
double y = (double)(y2 - y1) * (double)(y2 - y1);
cout << fixed << setprecision(6) << (double)sqrt(x+y) << ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define F... | 1 |
#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)... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
rep(i, h) rep(j, w) cin >> s[i][j];
bool able = true;
int di[] = {1, 0, -1, 0};
in... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n; cin>>n;
string s,t; cin>>s>>t;
int ans=2*n;
for(int i=0; i<n; i++){
int s_index=n-1-i;
int now_ans=2*n-(i+1);
bool flag=1;
for(int t_index=0; t_index<=i; t... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | 0 |
#if 0
2019.12.08
不妨设 n > 1 。
如果所有 a[i] 都是奇数，那么先手操作后会有一个偶数，约分后仍然有唯一偶数，
此时后手一定可以对唯一偶数操作，所有数成为奇数，约分后同样如此，
直到所有数都为 1 ，仍然没有偶数，那么当 a[i] 全是奇数时先手必败。
更一般的，假设 n 足够大奇数足够多，如果有偶数个偶数，
先手操作后有奇数个偶数，后手一定可以对偶数操作使得状态还原至奇数个偶数，
也就是说有奇数个偶数时先手必胜，反之先手必败。
特别的是，如果有偶数个偶数且奇数唯一且该奇数大于 1 ，
此时先手对唯一奇数操作后，所有数都是偶数，
此时一定可以约分，并且约分后的结果是难以推断的。
由于这种情况一定可... | #include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
class UnionFind{ //連結判定
private:
std::vector<int> parent; //parent[i] = parent of node i
std::vector<int> rank;
std::vector<int> size;
public:
//constructor
UnionFind(int N){
for(int i=0; i<N; i++) parent.push_bac... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool isprime(int x) {
if (x < 2) return false;
for (int i = 2; i * i <= x; ++i)
if (x % i == 0) return false;
return true;
}
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 2; v.size() < n; ++i)
if (isprime(i) && i % 5 == 1) v.push_back(i);... | #include<iostream>
using namespace std;
int main()
{
int N;
cin>>N;
for(int i=40000;i>=1;i--)
{
if(i*i<=N)
{
cout<<i*i<<endl;
break;
}
}
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repit(it, li) for(auto it=li.begin(); it!=li.end(); it++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k;
cin>>n>>k;
vector<int> p(n);
rep(i, n) cin>>p[i];
vector<int> ki2(n);
re... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
int main(void){
int N;
double ans=0;
std::cin >> N;
std::vector<int> P(N);
std::vector<std::vector<int>> C(N, std::vector<int>(2));
for (int i = 0; i < N; ++i){
std::cin >> C[i][0] >> C[i][1];... | 0 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
long long i,j,k,l,m,n,o,p;
string s;
while(cin>>s)
{
if(s[0]=='S'&&s[1]=='A')
cout<<"1"<<endl;
else if(s[0]=='S'&&s[1]=='U')
cout<<"7"<<endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
vector<string> vec{"SUN","MON","TUE","WED","THU","FRI","SAT"};
string S;
cin>>S;
for(ll i=0;i<7;i++) {
if(S==vec[i]) {
cout<<7-i<<endl;
}
}
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int arr[100005 << 2], value[100005], n, q;
void updata(int a, int b, int x, int k = 0, int l = 0, int r = (1 << 17)){
if (b <= l || r <= a)return;
if (a <= l && r <= b){
arr[k] = max(arr[k], x);
return;
}
int m = (l + r) / 2;
updata(a, b, x, k * 2 + 1, l, m);
up... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const ll INF = 1e17;
template<typename T, typename E, typename F, typename G, typename H>
class LazySegmentTree {
int n, height;
F f; G g; H h; const T ti; const E ei;
vector<T> dat; vector<E> laz... | 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 <iostream>
using namespace std;
int main()
{
while (true)
{
int count = 0;
int n, m;
int x = 10, y = 10;
bool table[21][21] = {};
cin >> n;
if (n == 0) return 0;
for (int i = 0; i < n; i++)
{
int X, Y;
cin >> X >> Y;
table[X][Y] = true;
}
cin >> m;
for (int i = 0; i < m; i++... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n; cin >> n;
int ans = -1;
for(int i = 1;i*i<=n;i++)
ans = max(ans,i*i);
cout << ans << endl;
re... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#defin... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int P,Q,R;
cin >> P >> Q >> R;
int answer;
answer = min(min(P+Q,Q+R),R+P);
cout << answer << endl;
}
| #include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i=0; i<int(n); i++)
#define all(c) (c).begin(), (c).end()
int main() {
int A, B, C, D, E, F;
cin >> A >> B >> C >> D >> E >> F;
int s = A + B + C + D... | 0 |
#include <stdio.h>
int main(){
int y,m,d;
scanf("%d/%d/%d" ,&y,&m,&d);
printf("2018/%02d/%02d" ,m,d);
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <time.h>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iomanip>
int main(void) {
//long double x = 0.1234567890;
//std::cout << x << std::endl;
//test??¨
//std::ifstream in("test.txt");
//std::cin.rdbuf(in.r... | 0 |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long n,m,d;
scanf("%ld %ld %ld", &n, &m, &d);
long k;
if(d == 0){
k = n;
}
else{
k = 2 * (n - d);
}
k = k * (m - 1);
double dAns = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m, d;
cin >> n >> m >> d;
cout << fixed << setprecision(20);
double ans = 0;
for (int i = 0; i < m - 1; i++) {
ans += (double)((double)(2 * n - 2 * d) / n) / n;
}
if (d == 0)ans *= 0.5;
cout << ans << endl;
} | 1 |
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
int main() {
string t;
while(getline(cin,t)) {
for(int i = 0; i < 26; i++) {
for(int j = 0; j < t.size(); j++) {
if(t[j] == ' ' || t[j] == '.') continue;
t[j] += 1;
if(t[j] > 'z') t[j] -= 26;
}
if(t.find("the") != string:... | #include <cstdio>
#include <cstring>
using namespace std;
int main() {
char s[100];
while (fgets(s, sizeof(s), stdin)) {
while (1) {
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] >= 'a' && s[i] < 'z') s[i]++;
else if (s[i] == 'z') s[i] = 'a';
else if (s[i] == '\n') s[i] = '\0';
... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
#define MAX 100100
inline int read()
{
int x=0;bool t=false;char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
if(ch=='-')t=true,ch=getchar();
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return t?-x:x;
}
int n,a[4][MAX],b[4],c[MAX],t[2];
... | #include<bits/stdc++.h>
using namespace std;
void gofail(){
cout<<"No\n";
exit(0);
}
const int N=100100;
int a[N],b[N],c[N],sum[3*N],sum1,sum2,n;
void add(int x){for(;x;x-=x&-x)sum[x]^=1;}
int qry(int x){int ans=0;for(;x<=3*n;x+=x&-x)ans^=sum[x];return ans;}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, R;
cin >> N >> R;
if(N>=10) {
cout << R << endl;
return 0;
}
else {
cout << R + 100 * (10 - N) << endl;
return 0;
}
}
| #include<stdio.h>
int main(){
int n, r, t;
scanf("%d %d", &n, &r);
t = 100 * (10 - n);
if(n<10){
printf("%d\n", r+t);
}
else{
printf("%d\n", r);
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 1 |
// ====================================
// author: M_sea
// website: https://m-sea-blog.com/
// ====================================
#include <bits/stdc++.h>
#define file(x) freopen(#x".in","r",stdin); freopen(#x".out","w",stdout)
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
typedef long long... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
using namespace std;
#define FOR... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int,int_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set_pair tree<pair<int,int>,int_type,less<pair<int,i... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi frist
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
int main(){
int n;
string s;
cin >> n >> s;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> W(n, 0);
vector<int> E(n, 0);
string s;
cin>>s;
if(s[0] == 'W'){
W[0]++;
}
if(s[0] == 'E'){
E[0]++;
}
for(int i=1; i<n; i++){
if(s[i] == 'W'){
W[i] = W[... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 4e6 + 10, M = 2e3 + 10, MOD = 1e9 + 7;
int fac[N], inv[N], dp[M][M], ps[M][M];
int sum(int a, int b) {return (a + b) % MOD;}
int mul(int a, int b) {return (a * b) % MOD;}
int Pow(int a, int b)
{
int res = 1;
for (; b; b>>=1, a =... | #include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 3000;
const int MAXM = MAXN*MAXN;
const int MOD = int(1E9) + 7;
int pow_mod(int b, int p) {
int ret = 1;
for(int i=p;i;i>>=1,b=1LL*b*b%MOD)
if( i & 1 ) ret = 1LL*ret*b%MOD;
return ret;
}
int fct[MAXM + 5], ifct[MAXM + 5];
int comb(int ... | 1 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int numa[1000000], numb[1000000];
int main(){
int n; cin >> n;
vector<int> a, b;
int x, y;
for (int i = 0; i < n; i++)
{
cin >> x;
a.push_back(x);
numa[x]++;
}
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector A(N, 0), B(N, 0);
for (auto &a : A) cin >> a;
for (auto &a : B) cin >> a;
auto f = [&]() {
for (int i = N - 1; i >= 0; i--) {
if (A.at(i) == B.at(i)) return false;
}
cout << "Yes" << "\n";
for (auto an... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long int;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int n,m,x,y;
cin>>n>>m>>x>>y;
vector<int>a(n);
vector<int>b(m);
rep(i,n)cin>>a[i];
rep(i,m) cin>>b[i];
sort(a.begin(),a.end());
sort(b.begin(),b.end());
if(max(a... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if ((a+b)>(c+d)) {
cout << "Left" << endl;
}
else if ((a+b)<(c+d)){
cout << "Right" << endl;
}
else {
... | 0 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
#define lli long long int
using namespace std;
using P = pair<int,int>;
int dignum(ll n) {
int res = 0;
whil... | #include <iostream>
#include<string>
#include<map>
using namespace std;
int main(){
string s; cin >> s;
int check[26] = {};
for(int i = 0; i < s.size(); i++){
int t = s[i]-'a';
check[t] = 1;
}
for(int i = 0; i < 26; i++){
if(check[i] == 0) {
char ans = 'a' + i;
cout << ans << endl;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, sum=0;
vector<int> v1(3);
for(int i=0;i<3;i++)
{
cin>>v1[i];
}
cin>>k;
sort(v1.begin(),v1.end());
for(int i=1;i<=k;i++){
v1[2]=v1[2]*2;}
for(int i=0;i<3;i++)
{
sum+=v1[i];
}
cout<<sum<<"\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
vector<int>v;
int a,b,c,k;
cin >> a >> b >> c >> k;
v.push_back(a);
v.push_back(b);
v.push_back(c);
int sum = 0;
while(k--)
{
sort(v.begin(),v.end());
v[2]*=2;
}
sum = v[0] + v[1] + v[2];
cout << sum << endl;
}
| 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
using namespace std;
int read(){
int s = 0,ne = 1; char c = getchar();
while(c < '0' || c > '9') ne = c == '-' ? -1 : 1, c = getchar();
while(c >= '0' && c <= '9') s = (s << 1) + (s << 3) + c - '0', c... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <utility>
#include <queue>
#define INF 1000000007
using namespace std;
typedef long long int ll;
int main(){
vector<int> dp(31,0);
dp[0]=1;
dp[1]=1;
dp[2]=2;
for (int i=3; i<31; i++) {
dp[i] = dp[i-1]+dp... | 0 |
//#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<map>
#include<vector>
#include<cmath>
#include<fstream>
#include <set>
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
//freopen("input.txt","r",stdin);
//freopen("ou... | #include<iostream>
#include<vector>
using namespace std;
void compute(vector<vector<int> > & cost,vector<vector<int> > & best,
vector<int> & A,int s,int e){
int minc = 0;
int mink = -1;
for(int k=s+1;k<=e;++k){
if (cost[s][k-1] < 0){
compute(cost,best,A,s,k-1);
}
if (cost[k][e] < 0) {
compute(cost,b... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<vector<long>> d(n + 1, vector<long>(5, LLONG_MIN));
d[0][0] = 0;
fo... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) ve... | #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>
#... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v)... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
int N;
cin >> N;
string S;
cin >> S;
string T;
char c = 'W';
for (int i = 0; i < N * 2; i++){
if (S[i] != c){
T += 'L';
c = 'B' + 'W' - c;
} else {
T += 'R';
c = 'B' + 'W' - c;
}... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <... | 1 |
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include ... | #include<iostream>
#include<iomanip>
#include<cassert>
#include<stdexcept>
#include<utility>
#include<functional>
#include<numeric>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<array>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<complex>
#include<set>
#inc... | 1 |
#include<iostream>
using namespace std;
#define NMAX 20
int main(){
int M,N,l;
int x[NMAX],y[NMAX];
char d;
bool ok[21][21];
while(1){
cin>>N;
if(N==0) break;
for(int i=0;i<N;i++){
cin>>x[i]>>y[i];
}
cin>>M;
int nx=10,ny=10;
for(int i=0;i<21;i++){
for(int j=0;j<21;j++){
ok[i][j]=fa... | #include <bits/stdc++.h>
using namespace std;
struct edge { int to, cost; };
bool operator<(const edge& e1, const edge& e2) { return e1.cost < e2.cost; }
int n, m, a1, a2, a3, a4, q;
int main() {
while(cin >> m >> n, n | m) {
vector<vector<edge> > G1(n), G2(n);
for(int i = 0; i < m; i++) {
cin >> a1 >> a2 >> a3... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, a, b) for(int i=(a); i<(b); i++)
#define per(i, a, b) for(int i=(b)-1; i>=(a); i--)
#define sz(a) (int)a.size()
#define de(a) cout << #a << " = " << a << endl
#define dd(a) cout << #a... | #include<bits/stdc++.h>
using namespace std;
template<class T> void chmax(T&x, T y){if(x < y) x = y;}
int N, K;
vector<int> G[100010];
int ans;
int dfs(int v, int p){
int mx = 1;
for(auto u : G[v]){
chmax(mx, dfs(u, v) + 1);
}
if(mx == K && p > 1) mx = 0, ans++;
return mx;
}
int main(){
... | 1 |
#include<iostream>
using namespace std;
int main(){
while(1){
int m, nmin, nmax;
cin >> m >> nmin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0)break;
int p[100002]; // 1-origin
for(int i = 1; i <= m; i++){
cin >> p[i];
}
int gap = 0, ans;
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cctype>
#include <cstdlib>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cfloat>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <string>
#i... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
string s;
ll c[26];
int main(){
cin >> s;
for(auto &e : s) c[e-'a']++;
ll ans = s.size() * (s.size()-1) / 2;
for(int i=0;i<26;i++){
ans -= c[i] * (c[i]-1) / 2;
}
cout << ans+1 << endl;
retur... | /*Lower_Rating*/
/*AGC040 B*/
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
using namespace std;
#define LL long long
#define MAXN 800000
#define MOD 998244353
#define Pr pair<int,int>
#define X first
#define Y second
#define INF 2000000000
#define mem(x,p) memset(x,p,sizeof(x... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
// GCD, LCM
// https://youtu.be/8lm8o8L9Bmw?t=2285
// https://youtu.be/XI8exXVxZ-Q?t=3595
// https://youtu.be/F2p_e6iKxnk?t=843
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
ll N,K;
cin >>N... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
string s = "";
string buf(w+2, '.');
s += buf;
for (int i = 0; i < h; i++) {
string si;
cin >> si;
s += "." + si + ".";
}
s += buf;
for (int i = 1; i < h+1; i++) {
for (int j = 1; j < w+1; j+... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,p;
while(cin>>n>>p,n+p)
{
int a[n];
for (int i = 0; i < n; ++i) a[i]=0;
int turn=0,s=p;
while(1)
{
if(s>0)
{
++a[turn],--s;
if(a[turn]==p) break;
++turn;
if(turn==n) turn=0;
}
else
{... | #include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w;
cin >> h >> w;
set<pair<int, int>> st;
multiset<int> mst;
for (int i = 0; i < w; i++) ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll linf = 1e18;
const db EPS = 1e-7;
template<class T> void chmin(T& x, T... | 0 |
#include <stdio.h>
typedef long long var;
const int N = 210005;
const int MOD = 1e9 + 7;
int h, w, a, b;
var inv[N + 1], fac[N + 1], invfac[N + 1];
var f(int n, int m);
var c(int n, int m);
int main() {
inv[0] = fac[0] = invfac[0] = inv[1] = 1;
for (int i = 2; i <= N; ++i)
inv[i] = ((MOD - MOD / i) * inv[M... | /* Author: Dhruv Rastogi */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(),sdk.end()
#define mll map<int, int>
#define pb push_back
#define rep(i,a,b) for(int i=a;i<b;++i)
#define repd(i,a,b) for(int i=a;i>=b;--i)
#define mp make_pair
#define hell 10... | 0 |
#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#inc... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int,int>;
struct edge{
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
using ll = long long;
using Graph = vector<vector<int>>;
using P = p... | 1 |
#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII>... | #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... | 1 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using v1 = vector<int>;
using vl = vector<long long>;
using v2 = vector<vector<int>>;
using v3 = vector<vector<char>>;
ll gcd(ll x, ll y){
if(x%y == 0) return y;
else return gcd(y, x%y);
}
int main(){
... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | 0 |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int x[N], y[N];
int n, m;
char s[N][11];
int main(){
... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T>
bool chmin(T& a, T b) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ld dp[305][305][305];
int main() {
ll n;
cin>>n;
ll a[n],x=0,y=0,z=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]==1) x++;
else if(a[i]==2) y++;
else z++;
}
for(int k=0;k<=n;k++)
for(int j=0;j<=n;j++... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define uu unsigned
#define io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MOD 1000000007
#define pl pair<ll,ll>
#define mkp make_pair
#define ss second
#define ff first
#define mit(a,b) map<a,b>::iterator
#define sit(a) set<a>::iterator
#defi... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define w(t) int t; cin>>t; while(t--)
#define AsmShuvo() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
AsmShuvo()
ll N, sum=0, i;
cin>>N;
for(i=1; i<=N; i++){
if(i%3 != 0 &... | #if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define Rep(i,n) for(int i=1;i<=n;i++)
const ll MOD = 1000000007;
long long modinv(long long a, long long m=MOD) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;... | #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;
}
| 0 |
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
using namespace std;
int n, k;
int main(){
while(1){
scanf("%d %d", &n, &k);
if(n == 0 && k == 0) break;
vector<string> v;
set<string> num;
for(int i=0; i<n; i++){
char tmp[3];
scanf("%s", tmp);
v.push_back(... | #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
int card[10],n,k,sen[10];
vector<int> vec;
void dfs(int h,int num){
if(h==k){
for(int i=0;i<vec.size();i++)
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ar array
#define endl '\n'
#define ll long long
#define in insert
#define pb push_back
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define Rep(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(ll i=a;i>... | #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--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
const ll mod = 1000000007;
const ll INF = 10010010010010010;
int main() {
int a,b; cin >> a >> b;
cout << (b+a-3) / (a-1) << endl;
return 0;
}
| #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert.h>
#include <deq... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
int main() {
int H,W; cin>>H>>W;
vector<vector<int>> A(H,vector<int>(W));
rep(i,H){
rep(j,W){
cin>>A.at(i).at(j);
}
}
rep(i,H) if(i%2==1) rev... | #include <iostream>
#include <cmath>
#include <tuple>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int H, W, A[509][509];
vector<tuple<int, int, int, int>> L;
int main() {
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) cin >> A[i][j];
}
for (int i = 1... | 1 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
inline char dif(char sp) {
if (sp == 'S') {
return 'W';
} else {
return 'S';
}
}
inline char next(char prevsp, char prevsay, char nowsp, char nowsay) {
char res;
if (nowsp == 'S') {
if (nowsay == 'o') {
res = prev... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int N, T;
cin >> N >> T;
vector<int> A(N), B(N);
for(int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<vector<int>> DP1(N, vector<int>(T, 0)), DP2(N, vector<int>(T, 0));
for(int i = 0; i < N; i++)... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 1 |
//https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Prelim/0566?year=2012
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> pt(static_cast<unsigned long>(n + 1));//各チームの得点
for (int i = 0; i < n * (n - 1) / 2; ++i) {
int a, b, c, d;
cin >> a... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i... | 0 |
#include<iostream>
using namespace std ;
int table[10010] = {} ;
void f(){
table[0] = 1 ;
table[1] = 1 ;
for( int i=2 ; i<=10000 ; i++ ){
if( !table[i] ){
for( int j=2 ; i*j<=10000 ; j++ ) table[i*j] = 1 ;
}
}
}
main(){
f() ;
int n ;
while( cin >> n , n ){
int p = 0 ;
for( int i=5 ; i<=n ; i++ ){... | /* All men have limits. They learn what they are and learn
not to exceed them, I ignore mine. -Batman */
#include <bits/stdc++.h>
//#include <Windows.h>
using namespace std;
int main(){
int i,j;
long long sum;
int n;
while(scanf("%d", &n) != EOF){
i = 0;
sum = 0;
while( i != 600){
sum += n... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod ll(1e9+7)
ll exp(ll a,ll b)
{
if(b==0)
return 1;
if(b%2==0)
return exp(a*a%mod,b/2);
return a*exp(a*a%mod,(b-1)/2)%mod;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9 + 7;
constexpr ll INF = 1e18;
ll m;
template <typename T>
T zero_sum_ranges(vector<T> A) {
T n = A.size();
T sum[n + 1] = {};
sum[1] = A[0];
map<T, T> mp;
for(size_t i = 0; i < n; i++) {
sum[i + 1] =... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
string s;
cin>>s;
int n=s.size();
ll ans=1;
map<char,int>mp;
rep(i,n){
mp[s[i]]++;
ans+=i+1-mp[s[i]];
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long tint;
typedef long double ld;
#define forsn(i, s, n) for(int i=s;i<int(n);i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define NACHO ios::sync_with_stdio(0); cin.tie(NULL);
#define dbg... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define fir first
#define sec second
#define mod 998244353
#define int long long
#define INF (int)(1e18)
inline int read()
{
char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-'... |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#inc... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N = 105;
int n, m, ex, ey;
char s[N][N], a[N][N];
short ans, dp[N][N][N][N], sum[N][N];
int Sum(int U, int L, int D, int R) {
if (U > D) swap(U, D);
if (L > R) swap(L, R);
return sum[D][R] + sum[U - 1][L - 1] - sum[D][L - 1] - sum[U - 1][R];
}
void Upd(short ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
... | 1 |
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.t... | #include <iostream>
using namespace std;
bool board[8][8];
char grid[8][8];
int upperlim = (1 << 8) - 1;
void solve(int row, int ld, int rd, int d)
{
// cout<<d<<endl;
if (d == 8)
{
for (int i = 0; i < 8; i++)
{
for (int j = 0; j < 8; j++)
{
if (board... | 0 |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include<stdio.h>
#define N 101
int main(){
int n;
int p[N];
int m[N][N];
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d",&p[i-1],&p[i]);}
for(int i=1;i<=n;i++)
m[i][i]=0;
for(int l=2;l<=n;l++){
for(int i=1;i<=n-l+1;i++){
int j=i+l-1;
/*2<<21*/
m[i][j]=2097152;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)
int main(){
while(1){
int n, m;
cin>>n>>m;
if(n==0) break;
int a[n];
REP(i, n) cin>>a[i];
sort(a, a+n, greater<int>());
int sum = 0;
REP(i, n) sum+=a[i];
for(int i=m-1; i<n; ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FO... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
map<int, int> m;
int x;
rep (i, n){
cin >> x;
if (m[x] == 0) m[x] = 1;
else m[x] = 0;
}
int count = 0;
for (P p : m){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9 * 2;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int count ... | 1 |
#include <bits/stdc++.h>
#define F first
#define S second
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define in(x) insert(x)
#define forr(i, a, b) for(int i = a;i <= b;i++)
#define sz(s) (int)(s.size())
#define all(x) x.begin(), x.end()
#define did_you_calis_enough ios_base::sync_with_stdio(0); cin.tie(0);... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a != b && b != ... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
template<typename T>
istream& operator>> (istream& is, vector<T> &vec){
for(T& x: vec) is >> x;
return is;
}
int main(){
ll n, k; cin >> n >> k;
vector<ll> x(n); ... | #include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for(ll (i)=0; (i)<(ll)(n); (i)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define A... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
bool dfs(const vector<vector<int64_t>>& adjs, vector<int64_t>& colors,
int64_t v, int64_t c) {
colors[v] = c;
for (auto u : adj... | 0 |
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3f
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define N 305
using namespace std;
typedef pair<int,int> Pair;
const int mod = 1e9 + 7;
inline int add(int x, int y) { return (x += y) - (x >= mod ? mod : 0); }
inline void inc(int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n);++i)
using namespace std;
const long long inf = 1ll << 60;
const long long mod = 1000000007;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,-1,0,1};
int dz[4] = {1,-1,-1,1};
int dw[4] = {1,1,-1,-1};
int main() {
int n;cin >> n;
vector<pair<int,int> > x(n)... | #include <iostream>
#define SIZE 8
void threaten(int board[][SIZE], int x, int y)
{
for (int i=0; i<SIZE; i++) {
board[i][y]++; board[x][i]++;
}
for (int i=-x; i<SIZE-x; i++) {
if (0 <= y+i && y+i < SIZE) board[x+i][y+i]++;
if (0 <= y-i && y-i < SIZE) board[x+i][y-i]++;
}
board[x][y]+=100;
}
void unthreate... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int w[10];
int k[10];
for(int i=0;i<10;i++){
cin >>w[i];
}
for(int i=0;i<10;i++){
cin >>k[i];
}
sort(w,w+10,greater<int>());
sort(k,k+10,greater<int>());
cout<<w[0]+w[1]+w[2]<<' '<<k[0]+k[1]+k[2]<<endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main()
{
string stro, str;
while(getline(cin, stro)){
for(int i = 0; i < 26; i++){
str = stro;
for(int j = 0; j < stro.length(); j++){
if(str[j] >= 'a' && str[j] <= 'z')
if(str[j] + i > 'z')
str[j] += i - 26;
else
str[... | 0 |
#include<cstdio>
#include<iostream>
#include<cstring>
#define RG register
#define si short int
using namespace std;
const int N=101;
si n,m,x,y,ans,dp[N][N][N][N],sum[N][N];
char g[N][N];
template<typename I> inline void read(I &ot){
I ch=getchar(), x=0, f=1;
while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); }
... | #include <algorithm>
#include <cstdio>
#define upd(x, y) (x) = std::max(x, y)
char str[105];
int dp[105][105][105][105], row_pre[105][105], col_pre[105][105];
int main()
{
// freopen("AGC004-E.in", "r", stdin);
int n, m, x, y;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
scanf("%s", str);
for (int j = ... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,N) for(int i = 0; i < (N); i++)
#define erep(i,N) for(int i = N - 1; i >= 0; i--)
const ll INF = 1000000000;
//const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
template<class T... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i=0; i<n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
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) { i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long total = 0;
for (long long i = 1; i * i <= N; i++) {
if (N % i == 0) {
total = i;
}
}
long long result = N / total;
long long count = 0;
while (result != 0) {
result = result / 10;
count++;
}
cout << count <... | #include <stdio.h>
int main(void){
int i;
scanf("%d", &i);
i = i*i*i;
printf("%d\n", i);
} | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int l = 1, r = n - 1;
string ls, rs;
cout << 1 << endl;
cin >> ls;
if (ls == "Vacant") return 0;
cout << n - 1 << endl;
cin >> rs;
if (rs == "Vacant") return 0;
... | 0 |
#include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
int ai = 0;
int bi = 0;
int ci = 0;
char x = 'a';
char ans = '\0';
while (1) {
switch (x) {
case 'a':
... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e6+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=500... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base ::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int d,t,s;
cin>>d>>t>>s;
if(s*t>=d) cout <<"Yes\n";
else cout <<"No\n";
} | 1 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#include <numeric>
#include <functional>
#define _overload3(_1,... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans =0;
if(s == "RRR"){ans = 3;}
if(s == "RRS"){ans = 2;}
if(s == "RSR"){ans = 1;}
if(s == "SRR"){ans = 2;}
if(s == "RSS"){ans = 1;}
if(s == "SRS"){ans = 1;}
if(s == "SSR"){ans = 1;}
if(s == "SSS"){ans = 0;}
cout <... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
inline int read()
{
int sum=0,ff=1; char ch=getchar();
while(!isdigit(ch))
{
if(ch=='-') ff=-1;
ch=getchar();
}
while(isdigit(ch))
sum=sum*10+(ch^48),ch=getchar();
return sum*ff;
}
const int N=1e5+5;
int n,m,a[N],k,... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
int N, M; cin >> N ... | 0 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _... | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n;
cin >> n;
vector<int64_t> ans;
for (auto i : irange(2L, 55556L)) {
if (i % 5 != 1) {
... | 1 |
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <stack>
#include <list>
#include <map>
#include <unordered_map>
#include <chrono>
#include <numeric>
using namespace std;
using ll = long long;
const ll INF = (ll)1e18+1;
const ll D... | #include <stdio.h>
#include <string.h>
#include <algorithm>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
typedef long long LL;
const int MOD=998244353;
const int N=2000005;
LL fac[N],inv[N];
void upd(LL &x,LL v) {
x+=v; (x>=MOD)?(x-=MOD):0;
}
void pre() {
fac[0]=fac[1]=inv[0]=inv[1]=1;
rep(i,2,N-1) {
fac[i]=f... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | ///بِسْمِ الّٰلهِ الرَّحْمٰنِ الرَحِيْمِ
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
ll int i,n,t,j=0,p,x,a=0,b,l=0,r=0,y,k,c,sum=0,m,d;
cin>>a>>b;
l=max(a,b);
r=min(a,b);
p=16-(a+b);
... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int mod = 1000000007;
int main(void){
int N, M; cin >> N >> M;
int A[N]; rep(i, N) cin >> A[i];
int B[M]; rep(j, M) cin >> B[j];
sort(A, A+N); reverse(A, A+N);
sort(B, B+M); reverse(B,... | #include<bits/stdc++.h>
using namespace std;
int main(void) {
constexpr long MOD = 1e9 + 7;
long n, m;
cin >> n >> m;
vector<long> a(n), b(m);
for(auto &e: a) cin >> e;
for(auto &e: b) cin >> e;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
long x = 0, y = 0;
auto aid... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
long long mod = 1e9 + 7;
const int iINF = 0x3f3f3f3f;
const long long INF = 1LL << 60;
using namespace std;
using pint = pair<int, int>;
template <class T>
in... | #include <cstdio>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
int n, p;
int x[50];
int main(){
while(scanf("%d%d", &n, &p), n){
int c = 0;
int q = p;
while(1){
if(q > 0){
++x[c];
--q;
if(x[c] == p){
printf("%d\n", c);
break;
}
}
... | 0 |
#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 <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
while(cin>>n, n) {
int now, max;
cin>>now;
max=now;
for(int i=1; i<n; i++) {
int t;
cin>>t;
if(now<=0) now=t;
else now+=t... | 1 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
using namespace std;
void read(int &x){
x=0; char c=getchar(); int p=1;
for (;c<48;c=getchar())if (c=='-')p=-1;
for (;c>47;c=getchar())x=(x<<1)+(x<<3)+(c^48);
x*=p;
}
void read(ll &x){
x=0; char c=getch... | #include <bits/stdc++.h>
using namespace std;
const long long B = 1e9;
int n;
int f[25][25];
int calc(long long t) {
int x = 0, y = 0;
while (t % 2 == 0) { ++ x; t /= 2; }
while (t % 5 == 0) { ++ y; t /= 5; }
x = max(0, 18 - x);
y = max(0, 18 - y);
//assert(t == 1);
int ans = 0;
fo... | 1 |
#include <bits/stdc++.h>
#define l_ength size
const int inf = (1<<30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
const int bound = 1000*1000+10;
bool besucht[bound];
void init(){
for( int i = 0; i < bound; ++i ) besucht[i] = false;
}
int no(){
cout << 0 << endl;
return 0;
}
int main(... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N, M; cin >> N >> M;
vector<int> A(N), B(M); unordered_map<int, int> a, b; bool ok = true;
REP(i, 0, N) {
ci... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
string s;
cin >> s;
bool ok = true;
if (s[0] != 'A')
ok = false;
int cnt = 0;
for (int i = 2; i <= s.size() - 2; i++)
{
... |
#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<cmath>
#include<set>
//#include<bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d... | 1 |
/*
* ALDS1_5_D.cpp
*
* Created on: Apr 30, 2018
* Author: 13743
*/
#include<cstdio>
long mergeCount(int* A, int l, int r) {
if(l+1 == r) {
return 0;
}
int mid = (l + r) / 2;
long c1 = mergeCount(A, l, mid);
long c2 = mergeCount(A, mid, r);
int n1 = mid - l;
int n2 = r - mid;
int A1[n1+1];
int A... | #include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int ans = 0;
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >> x;
sort(a.begin(), a.end());
for (int i = 0 ; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1... | 0 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
constexpr int INF = 1 << 30;
constexpr int MOD = 1000000007;
int bubble_sort(vector<int>... | #include <cstdio>
#include <iostream>
using namespace std;
int INFTY = 1000000001;
long long merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[n1];
int R[n2];
for (int i = 0; i < n1; ++i) {
L[i] = A[left + i];
}
for (int i = 0; i < n2; ++i) {
R[i] = A[mid +... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 10;
const int MAX_NODE_CNT = MAXN << 6;
int n, m, lst[MAXN];
struct Persistent_Segment_Tree {
#define mid ((l + r) >> 1)
#define ls(_) t[_].ls
#define rs(_) t[_].rs
#define lq(_) t[_].ls, l, mid
#define rq(_) t[_].rs, mid + 1, r... | // by ynymxiaolongbao
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define N 500010
//FenwickTree↓
int dat[N];
void init(){
rep(i,N)dat[i]=0;
}
void add(int i,int x){
for(;i<N;i+=i&-i)dat[i]+=x;
}
int sum(int i){
int res=0;
for(;i>0;i-=i&-i)res+=dat[i];
return... | 1 |
/* ?????????????????? */
#include <bits/stdc++.h>
using namespace std;
int e;
int main() {
while (1) {
scanf("%d", &e);
if (e == 0) return 0;
int ans = e;
for (int z=0; z*z*z<=e; z++) {
int z3 = z*z*z;
for (int y=0; y*y+z3<=e; y++) {
int y2 = y*y;
ans = min(ans, y+z+e-y2... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int d;
while (cin >> d) {
int ans = 0;
for (int a = d; a <= 600 - d; a += d) ans += a * a * d;
cout << ans << endl;
}
} | 0 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int main()
{
char s[81];
while(gets(s) != NULL){
int len = strlen(s);
if(strstr(s,"this") || strstr(s,"that") || strstr(s,"the")){
cout << s << endl;
continue;
}
for(int i = 0;i < 'z... |
// D - Match Matching
// DPによる解法
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
string dp[10030]; // dp[i]: i本のマッチで作れる最大の数
int m[10] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
string max_v(string v1, string... | 0 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
const ld pi = 3.141592653589793;
int w[4];
int main() {
for (int i = 0; i < 4; i++) {
cin >> w[i];
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a, b, c, d;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c >> d;
if (a + b > c + d) {
cout << "Left" << endl;
} else if (a + b < c + d) {
cout << "Right" << endl;
} else {... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int partition(int *A, int p, int r){
int x=A[r];
int i=p-1;
for(int j=p;j<r;j++){
if(A[j]<=x){
i++;
int tmp=A[i];
A[i]=A[j];
A[j]=tmp;
}
}... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
vector<int> Zalgorithm(vector<int> S) {
vector<int> A(S.size());
A[0] = S.size();
int i = 1, j = 0;
while (i < S.size()) {
while (i+j < S.size() && ... | 0 |
#include <iostream>
#include <set>
using namespace std;
class Solver {
public:
int n, m;
int a[10000], b[10000];
int solve() {
set<int> friends, friends_friends;
for (int i = 0; i < m; ++i) {
if (a[i] == 1) {
friends.insert(b[i]);
}
}
for (set<int>::iter... | #include <iostream>
using namespace std;
int main() {
int n, p;
while (1) {
int flag = 0;
int player[50] = { 0 };
cin >> n >> p;
if (n == 0 && p == 0) break;
int p_max = p;
while (1) {
for (int j = 0; j < n; j++) {
if (p != 0) player[j] += 1, p--;
else p = player[j], player[j] = 0;
if (p... | 0 |
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<climits>
#include<iostream>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k;
string s;
cin >> k >> s;
if (s.size()>k) {
string sub = s.substr(0, k);
cout << sub << "..." <<endl;
}
else{
cout << s <<endl;
}
}
| 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.