code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int,int> pr;
int main() {
// your code goes here
int w,h;
while(cin >> w >> h && w!=0){
int xs,ys,xg,yg,n,m,s,sum,c,d,x,y;
int dx[]={0,1,-1,0},dy[]={1,0,0,-1};
cin >> xs>>ys>>xg>>yg >> n;
bool map[102][102]={};
int color[1... | #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n, m;
int x[20];
int y[20];
char d[30]; // ??????
int s[30]; // ?§???????
bool grid[21][21];
while (1)
{
cin >> n;
if (n == 0) return 0;
for (int i=0;i<n;i++) cin >> x[i] >> y... | 0 |
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <string>
#include <map>
#include <bitset>
#include <stack>
//#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define urept(soeji, start, n) for (int soeji = start; soeji <... | #include<iostream>
#include<cstdlib>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
int len = s.size();
int cnts = 0, cntst = 0;
for (int i = 0; i < len; ++i) {
if (s[i] == 'S')
cnts++;
else if (s[i] == 'T' && cnts != 0) {
cnts--;
cnts... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... | #include<bits/stdc++.h>
using namespace std;
#include <string>
int main(){
int k;
cin>>k;
string palabra;
cin>>palabra;
int tamano;
tamano=palabra.size();
if (tamano>k){
for(int i=0;i<k;i++){
cout<<palabra[i];
}
cout<<"...";
}
else{
cout<<pala... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MOD=1000000007;
const int INF= int(1e9);
const int MAX =1007;
string a,b;
int n,m;
int dp[MAX][MAX];
int solve ( int n,int m) {
if(dp[n][m] != -1) {
r... | //Edit distance
#include <bits/stdc++.h>
using namespace std;
#define MAX 1000
string s,t;
int dp[MAX+1][MAX+1];
int d(int i,int j){
if(s[i]==t[j]) return 0;
else return 1;
}
int main(){
cin>>s>>t;
for(int i=0;i<=s.size();++i) for(int j=0;j<=t.size();++j){
if(i==0||j==0){
dp[i][j]=max(i,j);
continue;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define int long long
#define ld long double
#define fi first
#define se second
#define all(uiet) uiet.begin(),uiet.end()
#define read(UIET) for(int i = 0; i < n; ++i) cin >> UIET[i]
#define out(UIET) for(in... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
main()
{
string s, sub;
int a;
vector<int> v;
cin >> s;
for(int i = 0; i < s.size()-2; i++){
sub = s.substr(i, 3);
a = stoi(sub);
v.push_back(abs(753-a));
}
sort(v.begin(), v.end());
cout << v.fr... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef pair<l_l,ll> lll;
typedef vector<string> vs;
const ll dx[4]={1,-1,0,0};
const... | #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... | 0 |
// Written by newbiechd
#include <cstring>
#include <iostream>
#include <string>
const int maxN = 13;
int n;
const std::string ans[][7] = {
{
"aabc",
"ddbc",
"efgg",
"efhh"
},
{
"aabbd",
"ccf.d",
"eefgg",
"..hij",
"..hij"
},
{
"aabbcc",
"ddeeff",
"ghi...",
... | #include<iostream>
using namespace std;
int main(){
long long int dp[31];
dp[0]=1;
dp[1]=1;
dp[2]=2;
for(int i=3;i<=30;i++)dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
int n;
while(cin>>n,n){
long long int ans=dp[n];
ans=(ans-1)/10+1;
ans=(ans-1)/365+1;
cout<<ans<<endl;
}
} | 0 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;ins(rest...);}
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) for(int i=0,_i=(n);i<_i;++i)
#define _rep3(i,a,b) for(int i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, n) for (int i = 1; i < (int)(n+1); i++)
#define rep4(i, s, n) for (int i = (s... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>//next_permutation
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
u... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<pair<int, int>, int> p;
#define MOD 1000000007
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
ll power(ll n, ll k){
ll res = 1;
while(k > 0){
if (k & 1)
res = res * n % MOD;
n = n * n % MOD;
k >>= 1;
}
return res;
}
ll genfact(ll n, ll k){
ll res = 1;
k-... | 0 |
#define _USE_MATH_DEFINES
#include <iostream> //cin, cout
#include <vector> //vector
#include <algorithm> //sort,min,max,count
#include <string> //string,getline
#include <ios> //fixed
#include <iomanip> //setprecision
#include <utility> //swap
#include <cstdlib> //abs(int)
#include <cmath> //sqrt
#include <sstream> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
vector<string> V { "SUN","MON","TUE","WED","THU","FRI","SAT" };
int tmp = 0;
for (int i = 0; i < V.size(); i++) {
if (V.at(i) == S) tmp = i;
}
cout << 7 - tmp << "\n";
} | 1 |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/rope>
//using namespace __gnu_cxx
//#include<ext/pb_ds/priority_queue.hpp>
//using namespace __gnu_pbds;
#define lowbit(x) (x&-x)
#define pb push_back
#define empb emplace_back
#define all(x) (x).begin(),(x).end()
#define clr(a,b) memset(a,b,sizeof(a))
#define... | #include <iostream>
using namespace std;
const long long MOD = 1e9+7;
//aのMODbでの逆元
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; swap(u, v);
}
u %= m;
if (u < 0) u += m;
ret... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define... | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#includ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N; // 1 <= N <= 1+10^15 1000000000000001
string abc = "abcdefghijklmnopqrstuvwxyz";
string name = "";
for(int i = 0; i < 11; i++){
name = abc[(N-1)%26]+name;
N = (N-1)/26;
if(N == 0) break;
}
cout << name << endl;
}... | #include <stdio.h>
#define LL long long
#define ULL unsigned long long
#define UI unsigned int
#define UC unsigned char
#define UL unsigned long
int main() {
LL llMax = 1000000000000001, llN;
scanf("%lld", &llN);
//a = 97
int iChar[20], iCnt = 0;
llN--;
while (iCnt < 20) {
iChar[iCnt++] = llN % 26;
if (llN ... | 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
typedef tuple<int, int, int, int> T;
int H, W;
int a[510][510];
vector<T> ans;
signed main() {
cin.tie(0); ios::sync_with_stdio(false);
cin >> H >> W;
rep(i, H) rep(j, W) cin ... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 501;
int a[N][N];
struct Move {
int x1, y1, x2, y2;
};
// u... | 1 |
#include <iostream>
using namespace std;
void bubble(int *pbuff, int n){
int v;
int j;
int flag=1;
int i=0;
int count=0;
while(flag){
flag=0;
for(int i=n-1;j<i;i--){
if(pbuff[i]<pbuff[i-1]){
v=pbuff[i];
pbuff[i]=pbuff[i-1];
pbuff[i-1]=v;
count++;
}
flag=1;
}
j++;
}
for(int j=0... | //FIRST THINK THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define MOD 998244353
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define rrep(i,a,b) for(ll i=a;i>b;--i)
#define FOR(i,n) for(ll i=0;i<n;i++)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define v... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k, t; cin >> k >> t;
vector<int> a(t);
for(int i=0; i<t; i++) cin >> a[i];
sort(a.begin(), a.end());
int sum = 0, ans = 1e9;
for(int i=0; i<t; i++){
sum += a[i];
ans = min(ans, abs(k-sum-sum));
}
cout << max(0, ans - 1) << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k, t, a[109];
cin >> k >> t;
for(int i=0;i<t;i++)cin >> a[i];
int ans=0;
for(int i=0;i<t;i++){
int rest=max(a[i]-(k+1)/2, 0);
if(rest==1)ans++;
else if(rest>1){
ans += 1+2*(rest-1);
}
}
cout << ans << endl;
}
| 1 |
#include<bits//stdc++.h>
using namespace std;
int main(){
int n,p;
while(cin>>n>>p&&n!=0&&p!=0){
int a[50];
fill(a,a+n,0);
int m=0,p2=p;
while(true){
if(p==0){
p+=a[m];
a[m]=0;
}
else{
p--;
a[m]++;
}
if(p==0&&a[m]==p2) break;
m++;
if(m==n) m=0;
}
cout<<m<<endl;
}
} | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#i... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#pragma region Macros
#define FOR(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T> bool chmin(T &a,... | 0 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define endl "\n"
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define all(x) (x).begin(), (x).end()
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string a, b, c;
... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <time.h>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <sstream>
#include <stack>
#include <string>
#include <bitset>
using namespace std;
#define FOR(I,F,N) for(int I... | 0 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | //============================================================================
// Name : hoba.cpp :)
// Author : (O_O Diab) (Why_not) (el 3AQ)
// Version :
// Copyright : please, Don't touch me :(
// Description : problem (I) in C++
// MAIN IDEA : max sum of S(X) + S(S(X)) => 100 so brute force
//==... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll N, T;
cin >> N >> T;
vector<ll> time(N);
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> time[i];
}
for (int i = 0; i < N-1; i++) {
if (time[i+1] - time[i] < T) {
ans += time[i+1]- time[i];
} el... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
char str[1002],cmp[8]="Hoshino";
scanf("%d%c",&n,&str[0]);
for(int i=0;i<n;i++){
gets(str);
int cnt=0;
int j=0;
while(str[j]!='\0'){
if(str[j]==cmp[cnt])cnt++;
else cnt=0;
if(str[j]==cmp[cnt])cnt++;
if(cnt==... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
int k[1000000];
int p(int A,int B){
if(!B)return 1;
if(B%2)return p(A,B-1)*A%mod;
int C=p(A,B/2);
return C*C%mod;
}
int c(int A,int B){
if(A<B)return 0;
return k[A]*p(k[A-B]*k[B]%mod,mod-2)%mod;
}
signed main(){
k... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 998244353;
int main(){
const int maxSize = 2000001;
vector<long long> inv(maxSize);
vector<long long> fact(maxSize);
vector<long long> factInv(maxSize);
for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[i] = 1;
for(int i=2;i<maxSize;i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
string s;cin >>s;
int n=s.size();
vector<int>cnt(26,0);
for (int i = 0; i <... | #include<iostream>
#include<string>
using namespace std;
int main() {
string s;
cin >> s;
int mini = 10000;
for (int i = 0; i < s.length()-2; i++) {
int x = atoi(s.substr(i, 3).c_str());
mini = min(abs(x - 753), mini);
}
cout << mini << endl;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define lx x<<1
#define rx x<<1|1
#define reg register
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define il inline
int main... | #include <iostream>
using namespace std;
int main() {
long long x;
cin >> x;
long long moves = 2 * (x / 11);
if (x % 11 > 0) moves++;
if (x % 11 > 6) moves++;
cout << moves << endl;
return 0;
} | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int n;
ll t[500005];
void inc(int x, ll v) {
for (; x <= n; x += x & -x) t[x] += v;
}
ll que(int x) {
ll z = 0;
... | #include <bits/stdc++.h>
#include <atcoder/all>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
using namespace atcoder;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool ... | 1 |
#include <algorithm>
#include <cstdio>
const int N=1000005;
int f[N];
char a[N],b[N];
bool check(int n){
for (int i=1;i<=n;i++)
if (a[i]!=b[i]) return 0;
return 1;
}
int main(){
int n;scanf("%d\n%s%s",&n,a+1,b+1);
if (check(n)){
printf("0\n");
return 0;
}
int ans=1;
for (int i=n,j=n,x=0;i;i--)
if (b[i]!=b... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int mod=998244353;
const int maxn=1000... | 0 |
#include<bits/stdc++.h>
#define rep(i,a) for(int (i)=0; (i)<(a); (i)++)
#define rrep(i,a) for(int (i)=a-1; (i)>=(0); (i)--)
#define rep2(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
using namespace std;
int ... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
class SCC {
private:
int V;
int E;
vector<int> G[100001];
vector<int> rG[100001];
vector<int> vs;
bool used[100001];
int cmp[100001];
auto dfs(int v) -> vo... | 0 |
#include<stdio.h>
int main (){
int A;
int B;
char str1[100];
int hasil;
scanf("%d %d", &A,&B);
char str[(A+B)+1];
scanf("%s", &str);
for(int i=0;i<A+B+1;i++){
if(i!=A){
if(str[i]>='0'&&str[i]<='9'){
hasil++;
}
}else if(str[i]=='-'){
hasil++;
}
}
if(hasil==A+B+1){
printf("Yes");
}else... | #include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
int a,b;
string s;
signed main(){
ios_base::sync_with_stdio(0);
cin>>a>>b... | 1 |
#include <iostream>
#include<string>
#include<cmath>
#include<ciso646>
#include<cstring>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<utility>
#include<map>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
ll Max = 10 + 1e12;
int N = 5 + 1e5;
int main... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int e;
while ((cin >> e) && e != 0) {
int m = e;
for (int z=0; z<=100; z++) {
int zzz = z*z*z;
if (zzz > e) break;
for (int y=0; y<=100000; y++) {
int yy = y*y;
if (yy+zzz > e) break;
int x... | 0 |
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory>
#include<cmath>
#include<algorithm>
#include<vector>
double min_double(double a,double b){
if(a<b) return a;
else return b;
}
void swap(int *x,int *y){
int tmp;
tmp=*x;
*x=*y;
*y=tmp;
}
int gcd(int a,int b){
if(a<b) sw... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#d... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <queue>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
template <typename T>
using... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
const int N=1e5+2;
int n,inv[2],flip[2],pos[N],map[3][N];
struct B_I_T{
int tr[N];
inline void init(){
memset(tr,0,sizeof(tr));
}
inline void add(int x,int v){
for(;x<=n;x+=x&-x){
tr[x]+=v;
}
}
inline int ask(int x){
int ans=0;
for... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | //Δ_E
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 1<<20;
const int MO = 1e9+7;
int n... | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#include<map>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vec... | #include<iostream>
using namespace std;
int main(){
int n;
char c;
int f;
cin >> n;
getchar();
f = 0;
while(n){
c = getchar();
if(f == 1){
if(c == 'o')f++;
else f = 0;
}else if(f == 2){
if(c == 's')f++;
else f = 0;
}else if(f == 3){
if(c == 'h')f++;
... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for(int i = 1, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define PRINT(A) std::cout << (#A) << ":" << (A) << std::endl;
using namespace std;
#define repi(itr, ds) for(auto itr = ds.... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,n2=1,q,a[500010],lst[500010],dat[2000010... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int vote[101];
int N,Q,M;
int day;
int tmp;
int ans;
int i,j;
while(1){
tmp=0;
ans=0;
for(i = 0 ; i < 101 ; i++){
vote[i]=0;
}
cin >> N >> Q;
if(N == 0 && Q == 0){
break;
}
tmp=Q-1;
for(i = 0 ; i < N ; i++){
cin >> M;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
... | 0 |
#include <stdio.h>
#include <stdlib.h>
#define MAX_INPUT_SIZE 1024
int
main(int argc, char* argv[])
{
char input[MAX_INPUT_SIZE];
int n = atoi(fgets(input, sizeof(input), stdin));
int ret = n * n * n;
printf("%d\n", ret);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 |
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#include <x86intrin.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tr... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<long long> a(n), base;
for(auto & e : a) cin >> e;
long long all = 0;
for(auto & e : a) all ^= e;
for(auto & e : a) e &= ~all;
for(auto e : a){
for(auto b : base) e = min(e, e ^ b);
if(e){
base.push_back(e);
}
}
sor... | 1 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(... | #include <bits/stdc++.h>
using namespace std;
//using Graph = vector<vector<edge>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<... | 0 |
#include <algorithm>
#include <cstdio>
const int N=2005;
int l[N][N],r[N][N];
bool a[N][N];
char s[N];
int main(){
int h,w;
scanf("%d%d\n",&h,&w);
for (int i=0;i<h;i++){
scanf("%s",s);
for (int j=0;j<w;j++) a[i][j]=(s[j]=='#');
}
for (int i=h-1;i;i--){
for (int j=0;j<w;j++) a[i][j]^=a[i-1][j];
for (int j=w... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=2200;
int a[N][N],n,m,d[N][N],h[N][N],ans,stack[N][2],top,tt;
char ch;
int main(){
// freopen("1.in","r",stdin);
scanf("%d%d\n",&n,&m);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
scanf("%c",&ch);... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = long long ;
using P = pair<ll,ll>;
ll INF = 1000000007;
// ll INF = 9223372036854775807;
// ll INF = 998244353;
struct Sieve {... | 1 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) fo... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 |
#include<bits/stdc++.h>
using namespace std;
int N,arr[200200],mod = 1e9 + 7;
long long prefix[200200],sum;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>N;
for(int i = 1;i <= N;i++){
cin>>arr[i];
prefix[i] = prefix[i - 1] + arr[i];
}
for(int i = 2;i <= N;i++){
sum += ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
class Combination {
/*
:)
*/
public :
const int mod = 1e9 + 7;
ll add(ll x, ll y) {
x += y;
if (x >= mod) return x - mod;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0... | 1 |
#include<stdio.h>
#include<string.h>
int main(){
char A[11], B[11], C[11];
scanf("%s %s %s", A, B, C);
if (A[strlen(A) - 1] == B [0] && B[strlen(B) - 1] == C [0]){
printf ("YES\n");
}
else {
printf ("NO\n");
}
return 0;
} | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <b... | 1 |
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define m... | #include<iostream>
#include<stdio.h>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<time.h>
#include<cstdlib>
typedef long long ll;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#de... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define mkp make_pair
#define fi first
#define se second
void read(int &x){
char ch=getchar();x=0;
for (;ch==' '||ch=='\n';ch=getchar());
for (;ch!=' '&&ch!='\n';x=x*10+ch-'0',ch=getchar());
}
void write(int x){
if (x>9) write(x/10);
putchar(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define w(x) int x; cin>>x; while(x--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll a,b;
cin>>a>>b;
ll c=1,d=0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 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 1e9
typedef long long ll;
using namespace std;
int main() {
int n;
double avg = 0, count = 0;
cin >> n;
std::vector<int> v(n), x(n), y... | #include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;i++)
int main()
{
ll n;
cin >> n;
vector<ll> x(n)... | 1 |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cmath>
#include<string>
#include<fstream>
using namespace std;
//const int N = 1e3 + 5;
int main(){
int n,d=0,t=0,count=0;
cin >> n;
if (0 <= n&&n <= 2){
cout << 0 << endl;
return 0;
}
while (n)
{
n -=3;
if (n >= 3)
count++;
else{
c... | #include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
n=n/3;
printf("%d\n",n);
} | 1 |
#include <bits/stdc++.h>
using Int = int64_t;
using UInt = uint64_t;
using C = std::complex<double>;
#define rep(i, n) for(Int i = 0; i < (Int)(n); ++i)
#define guard(x) if( not (x) ) continue;
struct DisjointSet {
DisjointSet(Int n)
: ps(n, -1), ns(n, 1) {}
std::vector<Int> ps, ns;
Int find(Int x) {
... | #include "bits/stdc++.h"
using namespace std;
int main(){
int N,M;
cin>>N>>M;
vector<vector<int>>edge(N,vector<int>(N));
for(int i=0;i<M;i++){
int a,b,c;
cin>>a>>b>>c;
a--;
b--;
edge[a][b]=c;
edge[b][a]=c;
}
vector<int>box(1<<N);
for(int i=0;i<1<<N;i++){
for(int j=0;j<N;j++... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
deque<int> jewel;
for (int i = 0; i < N; i++) {
int num;
cin >> num;
jewel.push_back(num);
}
int ans = -1;
for (int i = 0; i <= min(N, K); i++) {
for (int j = 0; j <= min(N, K)-i; j++... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 100... | 1 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
#define low lower_bound
#define upp upper_bound
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define Rep(i,n) for (int i = (int)(n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
#define rever(vec) reverse(all(v... | #include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include<tuple>
#include<algorithm>
#include<cmath>
#include<limits>
#include<set>
#include<deque>
#include<queue>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
string S;
int K;
int dp[300][300][300];
int rec(int left, int right, int rest) {
if(left >= right) return left == right;
if(~dp[left][right][rest]) return dp[left][right][rest];
int ret = max(rec(left + 1, right, rest), rec(left, right - 1, rest));
if(rest > 0) r... | // luogu-judger-enable-o2
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftre... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N,A,B,counter=0;
cin>>N>>A>>B;
long long a[100000];
for(int j=0; j<N;j++){
cin>>a[j];}
for(int j=0; j<N-1;j++){
if((a[j+1]-a[j])*A<=B){
counter+=A*(a[j+1]-a[j]);}
else
counter+=B;
}
cout<<counter<<endl;}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int n;
cin >> n;
int a[n+1];
a[0] = 0;
for(int i=1; i<=n; i++) cin >> a[i];
int s = 0;
for(int i=0; i<n; i++){
s += abs(a[i+1]-a[i]);
}
... | 0 |
#include <iostream>
using namespace std;
const int MOD = 1000000007;
int dv[1000];
int sqrt(int x) {
int l = 1, r = x;
while (l + 1 < r) {
int m = (l + r) / 2;
(m * m <= x ? l : r) = m;
}
return l;
}
void memoDivisor(int n) {
while (n > 1) {
for (int i = 2; i <= n; ++i) {
if (n % i == 0... | #include <bits/stdc++.h>
using namespace std;
int p[168], q[168], mod = 1000000007;
int primecheck(int n) {
int d = 0;
for (int i = 1; i <= sqrt(n); i++)
{
if (n % i == 0) d++;
if (d == 2) break;
}
if (d > 1) return 0;
else return 1;
}
int main() {
int k = 0, n, l;
long l... | 1 |
#include <stdio.h>
int main (){
char name1[105];
char name2[105];
scanf("%s%s",&name1,&name2);
printf("%s%s\n",name2,name1);
return 0;
} | #include<iostream>
#include<string>
using namespace std;
const int MAX_DICE_NUMBER = 5;
void moveNorth(int diceRot[3]) {
int temp = diceRot[2];
diceRot[2] = diceRot[1];
diceRot[1] = MAX_DICE_NUMBER - temp;
}
void moveSouth(int diceRot[3]) {
int temp = diceRot[1];
diceRot[1] = diceRot[2];
diceRot[2] = MAX_DICE... | 0 |
#include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
// -----------... | #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 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define ll long long
#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=getc... | #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<ll,ll>;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
//xにはvectorなどの... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define SZ(X) ((int)(X).size())
#define endl "\n";
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int a,b;
cin>>a>>b;
cout<<(a+b-3)/(a-1);
return... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
... | 0 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
typedef double ld;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoc... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, K, a[maxn];
int main() {
scanf("%d %d", &n, &K);
int g = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]), g = __gcd(a[i], g);
}
if (K <= *max_element(a + 1, a + n + 1) && !(K % g)) {
printf("POSSIBLE... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int m... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
string s; int n;
int K;
int dp[300][300][301]; //dp[l][r][x] = 区間[l, r]内における最長回文の長さ（変更数≦x)
int iter[2][300][26]; //iter[left or right][pos][moji] = (leftの場合)s[pos],…,s[n-1]の間において文字mojiが出現する最初の場所
... | //beet
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
#define MAX 114514
vector<P> G[MAX*5];
map<int,int> M[MAX];
int dist[MAX*5];
signed main(){
int n,m;
cin>>n>>m;
int cnt=n;
for(int i=0;i<m;i++){
int p,q,c;
cin>>p>>q>>c;
p--;q--;
auto add_edge = [... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
// cout << fixed << setprecision(10) << flush;
int n;
cin >> n;
vector<vector<int>> x(n, vector<int>());
vector<vector<int>> y(n, vector<int>());
for(int i=0; i<n; i++){
int a;
cin >> a;
... |
#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i-... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long double ld;
typedef long long ll;
const int MOD = 1000000007;
const int IINF = INT_MAX;
const ll INF = 1LL << 60;
int main() {
int n; cin >> n;
if(n <= 111) cout << 111 << endl;
el... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_st... | 1 |
#include <vector>
#include <algorithm>
using namespace std;
void scc_dfs(int at, int &cnt, vector<int> &inum, vector<bool> &used, const vector<vector<int>> &graph)
{
used[at] = true;
for (int ne : graph[at]) {
if (!used[ne]) scc_dfs(ne, cnt, inum, used, graph);
}
inum[cnt] = at;
cnt++;
}
... | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
#define int long long
#define ll long long
#define mod 1000000007
#define INF (1LL<<60)
void bfs(int s, vector<vector<int>>& g, vector<int>& visited){
queue<int> q;
q.push(s);
visited[s] = s;
while (!q.empty()){
int u = q.front(); q.pop()... | 0 |
#include<iostream>
#include<vector>
using namespace std;
int m;
int g[1000000];
int cnt=0;
std::vector<int> G;
void insertionSort(int array[], int n, int g){
int tmp,j;
for(int i=g;i<n;i++){
tmp = array[i];
j= i-g;
while(j>=0 && array[j]>tmp){
array[j+g] = array[j];
j=j-g;
cnt++;
}
array[j+g]=tmp;... | #include <iostream>
#include <utility>
#include <cstdio>
using namespace std;
void insertionSort(int A[], const int n, const int g, int *cnt)
{
for( int i = g; i < n; ++i ){
int tmp = A[i];
int j = i - g;
while( -1 < j && tmp < A[j] ){
//cout << A[j+g] << "<-->" << A[j] << endl;... | 1 |
#ifdef __unix__
#include <bits/stdc++.h>
#else
#include <iostream>
#include <algorithm>
#include <math.h>
#include <functional>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <bitset>
#endif
#define fastIO ios_base::sync_with_stdio(0), cin.tie(NULL)... | #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;
int main() {
ios::sync_with_stdio(fal... | 0 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
char buf[128] = { 0 };
short grid[64][64] = { {0} };
int H,W;
fgets(buf, sizeof(buf), stdin);
sscanf(buf, "%d %d", &H, &W);
for(int i = 0; i < H; i++){
memset(buf, 0, sizeof(buf));
fgets(buf, sizeof(... | 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
// output
#define SPBR(w, n... | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define MOD 1000000007
#define INF (1<<29)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P... | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
void all_enum(string R, string B, string &S, map... | 1 |
#include <cstdio>
#include <cstring>
char ans3[4][4]={"aab","b.b","baa"};
char ans4[5][5]={"aacd","bbcd","dcaa","dcbb"};
char ans5[6][6]={"aabc.","..bcd","ccd.d","d.daa","dccbb"};
char ans6[7][7]={"a..bcc","a..bdd",".bccb.",".baab.","ddb..a","ccb..a"};
char ans7[8][8]={"aacd...","bbcd...","ccaab..","..b.bdd","..baacc"... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
vector<bool>A(55556,true);
for(int i=2;i<55556;i++){
if(!A.at(i))
continue;
else{
for(int j=2;i*j<=55555;j++)
A.at(i*j)=false;
}
}int a=0;
vector<int>B;
for(int i=2;i<55556;i++){
if(A.at(i)){if(i%5==1){B.push_... | 0 |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define ll long long int
#define ld long double
#define all(a) a.begin(), a.end()
#define pii... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
for(int i = 0; i < N; i++){
cin >> A.at(i);
}
sort(A.begin(), A.end());
int ans = 0;
for(int i = 0; i < K; i++){
ans += A.at(N - 1 - i);
}
cout << ans << endl;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int , int>
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MAXX 1005
int n , m , X , Y;
int x[MAXX];
int y[MAXX];
int main()
{
_FastIO;
int a , b;
cin >> n >> m >> X >> Y;
for(int i = 0;... | #include <cctype>
#include <string>
#include <iostream>
using namespace std;
int main()
{
string S; int C = 0;
while (getline(cin, S))
{
for (int i = 0; i < 26; i++)
{
if (!(S.find("this") == string::npos && S.find("that") == string::npos && S.find("the") == string::npos))
{
cout << S << endl;
... | 0 |
#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>
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 <... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define very_slow ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb ... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(... | 1 |
#include <bits/stdc++.h>
#define FAST_INPUT ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) ... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int maxn = 1e4+3;
int dp[maxn][102][2];
char s[maxn], d;
int main()
{
scanf("%s %d", s+1, &d);
int len = strlen(s+1);
dp[0][0][1] = 1;
for (int i = 0; i < len; ++i)
for (int j = 0; j < d; ++j)
for (int k = 0; k < 10; ++k)
{
int t... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
ll x;
cin>>x;
ll ans=x/5.5;
if(2*x%11==0||2*(x+5)%11==0)
cout<<ans<<endl;
else
{
cout<<ans+1<<endl;
}
return 0;
}
| #include <iostream>
int main()
{
int64_t x;
std::cin >> x;
// 5と6を交互に出す
// どちらから始めてもいいので、最後を6にできる
const auto r = x % 11;
std::cout << x / 11 * 2 + (r + 5) / 6 << std::endl;
return 0;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define int unsigned long long
#define fi first
#define se second
#define pb push_back
#define ins insert
#define er erase
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int oo = 1e18 + 7, mod = 1e9 + 7, mul = (1 << 30);
int n, pw[... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<stack>
#include<queue>
#include<list>
#include<set>
#include<cmath>
#define REP(i,n) for(int (i) = 0;(i) < (n);(i)++)
using namespace std;
int C[10001];
int partition(int *A,int p,int r){
int x = A[r];
int i = p-1;
for (int j =... | 0 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll... | #include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0;
int H, W, N;
cin >> H >> W >> N;
int MAX = max(H, W);
ans = (N + MAX - 1) / MAX;
cout << ans << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int M=S.size();
int N=0,A=0,B=0;
for(int i=0;i<M;i++){
if(S[i]=='S'){
B++;
}
else{
A++;
}
N=max(N,A-B);
}
cout<<N*2<<endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std ;
#define int long long
int32_t main(){
int n;
cin >> n;
int a[n] ;
for(int i = 0 ; i < n ; i++) cin >> a[i] ;
int ans = 0 ;
int mx = 0 ;
for(int i = 0 ; i < n ; i++){
mx = max(mx , a[i]) ;
ans += mx - a[i] ;
}
cout << ans ;
return 0 ;
}
| #include<stdio.h>
int s[500000],n;
long long count;
void Merge(int left,int mid,int right){
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1],R[n2 + 1];
for(int i = 0;i < n1;i++)
L[i] = s[left + i];
for(int i = 0;i < n2;i++)
R[i] = s[mid + i];
L[n1] = 2000000000;
R[n... | 0 |
#include<iostream>
using namespace std;
void checknum(int &i, int &n);
void endchecknum(int i, int n)
{
i++;
if (i <= n)
{
checknum(i, n);
}
else
{
cout << endl;
}
}
void include3(int &x, int &i, int &n)
{
if (x % 10 == 3)
{
cout << " " << i;
endchecknum(i, n);
}
else
{
x /= 10;
if (x)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5, mod = 1e9 + 7, inf = INT_MAX;
int main()
{
//ios::sync_with_stdio(false);cin.tie(nullptr);ios_base::sync_with_stdio(false);
int ans = inf, n, x, c;
cin >> n;
while (n--)
{
c = 0;
cin >> x;
... | 0 |
#include<iostream>
#include<string>
using namespace std;
class DICE
{
private:
const int dice_tem[5][6] = { { 3,2,6,1,5,4 },{ 2,6,3,4,1,5 },
{ 5,1,3,4,6,2 },{ 4,2,1,6,5,3 },{1,2,3,4,5,6} }; //{0}:W {1}:N {2}:S {3}:E {4}:defalut
const string dice_rl = "AWWWNWWWNWWWWNWWWSWWWSWWW";
const int n = 6;
int dice_i[6] ... | #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 n;
cin >> n;
int min = n;
int ans = 0;
vector<i... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fw(p) for(int w=0;w<(p);w++)
#define fx(p) for(int x=0;x<(p);x++)
#define fy(p) for(int y=0;y<(p);y++)
#define fz(p) for(int z=0;z<(p);z++)
#define fyg(p,g) for(int y=(g);y<(p);y++)
#define fzg(p,g) for(int z=(g);z<(p);z++)
#define ce(d) cout<<... | #include<bits/stdc++.h>
using namespace std;
string str;
signed main()
{
cin>>str;
for(int i=0;i<str.size()-8;i++) cout<<str[i];
return 0;
} | 1 |
#include <iostream>
using namespace std;
int main(){
int N;
cin>>N;
long long answer=0;
long long before=-1;
int judge=0;
for(int i=0;i<N;i++){
long long A;
cin>>A;
if(A>before+1){
cout<<-1<<endl;
judge++;
break;
}
else if(A<=before) answer+=before;
if(i==N-1) answe... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
rep(i,n) c... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) // rep(i, 1, 5) --> {1,2,3,4} // rep(i, 5, 1) --> {4,3,2,1} // rep(it, end(v), begin(v)) --> *it
using namespace std;
int main()
... | #include<iostream>
using namespace std;
typedef long long ll;
int main(){
ll n;
while(cin>>n){
ll ans,x;
ans=n/11<<1;
x=n%11;
if(x>6)
ans+=2;
else if(x)
ans++;
cout<<ans<<endl;
}
return 0;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void... | #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 <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int w,h;
int sx,sy;
int gx,gy;
int n;
vector<vector<int>> field;
int de[] = {1, 0, -1, 0};
void dfs(int x ,int y, int c) {
if(x < 1 || x > w || y < 1 || y > h... | #include<iostream>
#include<queue>
using namespace std;
int main() {
int w, h, sx, sy, gx, gy, n;
while (cin >> w >> h, w) {
cin >> sx >> sy >> gx >> gy >> n;
int map[110][110] = {};
for (int i = 0; i < n; i++) {
int c, d, x, y; cin >> c >> d >> x >> y;
map[x][y] = c;
map[x][y + 1] = c;
map[x + 1][y... | 1 |
#include <iostream>
using namespace std;
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, 1, -1 };
int field[20][20];
int dfs(int W, int H, int x, int y, int step, int limit){
if(++step > limit){ return limit; }
for(int i = 0; i < 4; ++i){
int fx = x + dx[i], fy = y + dy[i];
if(fx < 0 || fx >= W || fy < 0 || fy... | /* 駄実装の典型 皆さんはstackではなくてn進法を使いましょう */
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <set>
#include <deque>
#include <algorithm>
using namespace std;
int main() {
while (1) {
int n;
int k;
vector<string> element_strings;
set<string> generated_stri... | 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>;
int main()
{
... | #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <bitset>
#include <string>
using namespace std;
#define REP... | 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>;
const int INF=1001001001;
int dy[4]={-1,0,1,0};
int dx[4]={0,-1,0,1};
int main(){
int h,w;
cin>>h>>w;
int ans=0;
vector<string>s(h);
rep(i,h)cin>>s[i];
rep(i,... | #include<iostream>
#include<queue>
using namespace std;
int main() {
int H, W; cin >> H >> W;
int N = H*W;
int A[N]; string str;
int white_num = 0;
for (int i = 0; i < H; i++) {
cin >> str;
for (int j = 0; j < W; j++) {
white_num += A[i*W+j] = (str[j] == '.');
}
}
queue<pair<int, int>> ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int read(){
int x=0; char c=getchar(); int flag=1;
while(!isdigit(c)) { if(c=='-') flag=-1; c=getchar(); }
while(isdigit(c)) { x=((x+(x<<2))<<1)+(c^48); c=getchar(); }
return x*flag;
}
const int N=1e5+50;
int n,k;
struct Edge{
int to,next;
}edge[N<<1];
int head[N... | #include <bits/stdc++.h>
using namespace std;
#define N 100000
#define pb push_back
int n, k, len, a[N + 5], d[N + 5], vis[N + 5], ans;
vector<int> G[N + 5];
struct Cmp {
bool operator () (const int &a, const int &b) const {
return d[a] < d[b];
}
};
priority_queue<int, vector<int>, Cmp> pq;
void dfs1(int u) {
... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int cnt = 0;
void PrintfArray(int a[], int n)
{
for(int i = 0; i < n; i++)
{
if( i )
cout << endl;
cout << a[i];
}
cout << endl;
}
void insertionSort(int a[], int n, int g)
{
for(int i = g; i < n; i++)
{
... | #include <cmath>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <vector>
#include <string>
using namespace std;
void insertion_sort(vector<int> &list, int interval, int &count) {
for (int i = interval; i < list.size(); ++i) {
int key = list[i];
int j = i - interval;
while (j >= 0 &... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n; int64_t ans = 0;
vector<int64_t> a(n), b(n);
priority_queue<pair<int64_t, int>> que;
for (auto i = 0; i < n; i++) {
cin >> a[i] >> b[i]; que.push({{a[i] + b[i]}, i});
}
for (auto i = 0; i < n; i++) {
auto... | 0 |
#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... | #include<bits/stdc++.h>
using namespace std;
const double pi=acos(-1.);
int x[233],y[233],n,sz;
double ans,st[666];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",x+i,y+i);
for(int i=1;i<=n;i++){
sz=0;
for(int j=1;j<=n;j++)
if(i^j)
st[++sz]=atan2(x[j]-x[i],y[j]-y[i]);
sort(st+1,st+sz... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int n = s.length();
if(n%2!=0) {
cout<<"No\n";
return 0;
}
for(int i =0;i<n;i+=2)
{
if(s[i]=='h' && s[i+1]=='i') continue;
else{
cout<<"No\n";
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll mo = 998244353;
const int MAX = 510000;
const int MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
ll mypow(ll a, ll b){
ll res = 1;
a %= mo;
while (b)
{
if (b & 1)
... | //Be Name Khoda, Besmellah Rahmane Rahim, In The Name Of God;
//#include<bits/stdc++.h>
#include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include<bitset>
#include<list>
#include<cassert>
#include<numeric>
#include... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<time.h>
#include<vector>
using namespace std;
int main()
{
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
int n,x,... | #include<iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#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 x,y,z;
cin>>x>>y;
z =x*y;
cout <<z<<endl;
ret... | 0 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ?... | 0 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int month[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int main(){
int m,d;
while(scanf("%d %d",&m,&d),(m!=0)){
for(int i=0;i<m;i++){
d=d+month[i];
}
d=d%7;
switch(d){
case 0:
cout<<"Wednesday"<<endl;
break;
case 1:
cout<<"Thursday"<<endl;
break... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.