code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c; cin >> a >> b >> c;
bool ok = true;
if(a==b && b!=c){ok = false;}
if(b==c && c!=a){ok = false;}
if(c==a && a!=b){ok = false;}
if(!ok){cout << "Yes" << endl;}
else cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll power(ll p,ll n){
ll result=1;
while(n!=0){
if(n%2==0){
n/=2;
p*=p;
}
else{
n--;
result=result*p;
}
}
return result;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,t,a,b,c,d... | 1 |
#include <stdio.h>
int main() {
int A, B;
scanf("%d %d", &A, &B);
int length = A + B + 1, cnt = 0;
char S[50];
scanf("%s", S);
if (S[A] == '-') {
for(int i = 0; i < length; i++) {
if (S[i] >= '0' && S[i] <= '9') {
cnt++;
}
}
if (cnt == length -1) {
printf("Yes\n");
} else {
printf("N... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
#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;
#ifdef rd
#d... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | #include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(long long i=a; i<b; i+=1)
#define repr(i,a,b) for(long long i=a; i<=b; i+=1)
#define vec vector<ll>
#define mapa map<char,int>
#define repa(p,A) for(auto p:A)
#define pb push_back
/*#define sort(a) sort(a.begin(),a.end())*/
#define reverse(a) reverse(... | #include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
int m=n;
int ans=0;
for(int i=0;i<n;i++)
{
int p;
cin>>p;
if(p<=m)ans++;
m=min(p,m);
}
cout<<ans<<"\n";
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
string a;
int b;
int main(){
cin>>a>>b;
for(int i=0;i<a.size();i+=b)
cout<<a[i];
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll,ll> pairs;
vector<pairs> p;
ll gcd(ll A,ll B){
if (A%B==0)return(B);
else return(gcd(B,A%B));
}
ll keta(ll N){
int tmp{};
wh... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<char> sL(n), sR(n);
for (int i = 0; i < n; i++) {
cin >> sL[i];
}
for (int i = 0; i < n; i++) {
cin >> sR[i];
}
map<pair<string, string>, int> mpL;
for (int bit = 0; bit < 1<<n; bit++) {
string reds = "", blues = "";
fo... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 1000000007
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)... | 0 |
#include<cstdio>
typedef long long ll;
const ll mod=998244353;
inline ll rev(ll x)
{ll k=mod-2,r=1;for(;k;k>>=1,(x*=x)%=mod)if(k&1)(r*=x)%=mod;return r;}
ll fac[1111111],inv[1111111];
inline ll C(int n,int r)
{return((((fac[n]*inv[r])%mod)*inv[n-r])%mod);}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
if(n<m)n^=m,m^=n,... | #pragma GCC optimize("Ofast","inline")
#include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof (x))
#define For(i,a,b) for (int i=a;i<=b;i++)
#define Fod(i,b,a) for (int i=b;i>=a;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define _SEED_ ('C'+'L'+'Y'+'A'+'K'+'I'+'O'+'I')
#define ... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... | 1 |
#include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
UL S[2001][2001] = {};
UL J1[2001][2001] = {};
UL J2[2001][2001] = {};
void Query() {
UL y1, y2, x1, x2; cin >... | #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>
#include <iomanip>
#include <lim... | 0 |
#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 M1 1000000007
#define M2 998244353
const double pi = 3.14159265;
#define ll long long
#... | #include <bits/stdc++.h>
using namespace std;
int main(){
int d,g,m;
m=pow(10,5);
cin >> d >> g;
vector<pair<int,int>> v;
int a,b;
for(int i=0;i<d;i++){
cin >> a >> b;
pair<int,int> p(a,b);
v.push_back(p);
}
for(int i=0; i<(1<<d); i++){
bitset<10> bit(i);
bitset<10> check(0);
... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define MAX 100
int min(int,int);
int p[MAX+1]={},m[MAX+1][MAX+1]={};
int min(int n1,int n2){
if(n1>n2) return n2;
else return n1;
}
int main()
{
int n,l,i,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d",&p[i-1],&p[... | #include <bits/stdc++.h>
#define N 101
using namespace std;
int A[N];
int mem[N][N],used[N][N];
int dfs(int l,int r){
if(l == r) return 0;
if(r - l == 1) return A[l]*A[r]*A[r+1];
if(used[l][r]++) return mem[l][r];
int res = 1e9;
for(int i=l;i<r;i++){
int a = dfs(l,i);
int b = dfs(i+1,r);
int c... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
int32_t main()
{
int n, q;
cin >> n >> q;
string s;
cin >> s;
vector<int> index;
int c = 0;
index.push_back(c);
for (int i = 0; i < s.size() - 1; i++)
{
if (s[i] == 'A')
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll factorial(int i) { //階乗
if (i == 0) return 1;
return (factorial(i - 1)) * i;
}
int main() {
int n, q;
cin >> n >> q;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void MAIN() {
int n, m;
cin >> n >> m;
int cnt = 0;
vector<string> s(n + 1);
for (int i = 1; i <= n; i++) {
cin >> s[i];
s[i] = "-" +... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i < (n); ++i)
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
using ll = long long;
#define INF 1e9
int N, M;
vector<vector<int>> graph;
vector<int> deg, order;
void toporo(){
queue<int> q... | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma warning(disable : 4996)
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#incl... | #include <bits/stdc++.h>
using i64 = long long;
long long *fact, *inv;
template <typename T, typename U, typename V>
auto pow(T x_, U n_, V mod_) {
using R = std::common_type_t<T, U, V>;
R ret = 1, x = x_, n = n_, mod = mod_;
while(n > 0) {
if ((n & 1) == 1) ret = (ret * x) % mod;
x = (x *... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int K;
cin>>K;
string S;
cin>>S;
if(S.size()<=K) cout<<S<<endl;
else cout<<S.erase(K)+"..."<<endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
int t=1;
//cin>>t;
while( t-- )
{
int k;
cin>>k;
string s;
cin>>s;
if( s.size()<=k )
cout<<s;
else
{
for( int i=0 ;... | 1 |
/*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#d... | #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>>n){
int x[n];
map<long long,long long>mp;
for(i=0;i<n;i++){
cin>>x[i];
}
sort(x,x+n);
long long a=0,b=0;
for(i=n-... | 1 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Segtree {
int n;
T e;
vector<T> dat;
typedef function<T(T a, T b)> Func;
Func f;
Segtree(){}
Segtree(int n_input, Func f_input, T e_input){
initialize(n_input, f_input, e_input);
}
void initialize(int... | //c++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#inclu... | 0 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 1 |
#include<iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a,b,c;
a=N/100, b=(N/10)%10, c=N%10;
if (a == 7 || b == 7 || c == 7){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2... | 1 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
const int INF=1001001001;
int main() {
string s;
cin>>s;
int n=s.size();
stack<char>k;
for(int i=0;i<n;i++){
if(k.empty()){k.push(s[i]);}
else if(s[i]=='S'){k.push(s[i]);}
else if(s[i]=='T'){
if(k.top()=='T')... | //#include<bits/stdc++.h>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
/*#define fast ios_base::sync_with_stdio(0); cin.tie(0)*/
#define ff first
#define ss second
#define pb push_back
#define mp make_pa... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
class Graph {
vector<vector<int>> adj;
vector<int> color;
public:
Graph(int n) : adj(n), color(n, -1) {}
void connect(int a, int b) {
adj[a].push_back(b);
adj[b].push_back(a);
}
boo... | /*====Corycle====*/
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<cstdio>
#include<vector>
#include<cmath>
#include<ctime>
#include<stack>
#include<queue>
#include<map>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int... | 0 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (n);i++)
using ll = long long;
const ll MOD=1000000007;
int main()
{
ll N; cin>>N;
vector<ll> vecA(N);
rep(i,N)
{
cin>>vecA.at(i);
}
sort(vecA.begin(),vecA.end());
reverse(vecA.begin(),vecA.end... | 1 |
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,b) loop(i,0,b)
typedef pair<int, int> pii;
int main(){
int n;
while(cin >> n && n){
vector<pii> v(n);
rep(i,n) v[i].second = i;
int game = n * (n... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define forever for (;;)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecisio... | 1 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | #include<iostream>
using namespace std;
const int N=2e5+10;
int n,k;
int d[N];
int hs(int x){
int f=0;
while(x>0){
if(d[x%10]) f=1;
x/=10;
}
if(f) return 0;
else return 1;
}
int main(){
cin>>n>>k;
for(int i=1;i<=k;i++){
int x;
cin>>x;
d[x]=1;
}
for(int i=n;;i++)
if(hs(i)){
printf("%d",i);
bre... | 1 |
#include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n,... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using graph=vector<vector<int>>;
void add_directed_edge(graph& G,int u,int v){
G[u].emplace_back(v);
}
vector<int> topological_order(const graph& D){
int n=D.size();
vector<int> deg(n);
rep(u,n) for(int v:D[u]) deg[v]++;
ve... | 0 |
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
#define rg register
void read(int &x){
char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok)x=-x;
}
const int maxn=2010,mod=1e9+7,... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k; cin >> n >> k;
vector<double> v(n);
vector<double> expected(n);
for(int i = 0; i < n; ++i)
{
cin >> v[i];
expected[i] = ((v[i]*(v[i]+1.0))/2.0)/v[i];
if(i)
expected[i] += expected[i-1];
}
double maxi = expected[k-1];
double to... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m; cin >> n >> m;
string ans = "";
for (int i = 0; i < n; i++) {
ans += 'x';
}
for (int i = 0; i < m; i++) {
int s; char c; cin >> s >> c;
s--;
if (ans[s] != 'x') {
if (ans[s] == c) {}
else { // ans[s] != c
... | #include <bits/stdc++.h>
#define MAX 1010
using namespace std;
vector<int> adj[MAX];
int visited[MAX];
int graph[MAX][MAX];
vector<int> dfs(int v, int root)
{
vector<int> ans;
visited[v] = 1;
if (v != root)
{
for (int i : adj[v])
{
if (i != root && visited[i]) return ans;
}
if (graph[v][root])
{
a... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2010;
int H, W, f[maxn][maxn], pre[maxn], suf[maxn];
char s[maxn][maxn];
bool chk[maxn][maxn];
int main() {
scanf("%d %d", &H, &W);
for (int i = 1; i <= H; i++) {
scanf("%s", s[i] + 1);
for (int j = 1; j <= W; j++) {
if... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctim... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
ll N,D;
ll A[200005];
cin>>N>>D;
ll ret = D*(N-1);
for(int i = 0;i < N;i++){
cin>>A[i];
ret += A[i];
}
for(int i = 1;i < N;i++){
A[i]=min(A[i-1]+D,A[i]);
}
for(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1<<18;
const ll INF=1LL<<55;
int n;
pair<ll,int> dat[2*MAX-1][2];
void init(int n_){
n=1;
while(n<n_) n*=2;
for(int i=0;i<2*n-1;i++){
dat[i][0]={INF,i-(n-1)};
... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7, K = 18;
vector<int> cld[N];
int par[N], level[N], anc[N][K];
bool done[N];
int n, k;
priority_queue<pair<int, int>> pq;
void setup(int u) {
if (par[u] != u) level[u] = level[par[u]]+1;
pq.push({level[u], u});
anc[u][0] = par[u];
for (i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
int N,M; cin>>N;
vector<string> s(N);
rep(i,N) cin>>s[i];
cin>>M;
vector<string> t(M);
rep(i,M) cin>>t[i];
int ans=0;
rep(i,N){
string taka = s[i];
in... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
#define ff first
#define ss second
char s[1000010];
bool comp(ii a, ii b){
return a.ss > b.ss;
}
int32_t main(){
int n;
scanf("%d", &n);
vector<ii> v1, v2;
for(int z=0; z<n; ++z){
scanf("%s", s);
int q = 0;
int tam = int(strlen(s));
... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#d... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, x;
cin >> n >> x;
ll a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
int ans = 0;
int index = 0;
while (x > 0 && index < n) {
if (x >= a[index]) {
an... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL 1LL << 39
#define INF 100000000
#define MOD 1000000007LL
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define prique priority_queue
#define PI acos(-1)
typedef pair<int, ... | 0 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> p(60000,1);
vector<int> q;
for(int i=2;i<55556;i++){
if(p[i]){
for(int j=i*2;j<=55555;j+=i){
p[j]=0;
}
if(i%5==1){
q.push_back(i);
}
}
}
for(int i=0;i<N;i++){
cout<<q[... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i)... | 1 |
//
// Created on 2020/08/10.
//
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).b... | 0 |
# include <iostream>
using namespace std;
static const int ans[] = {
0, 3, 14, 39, 84, 155, 258, 399, 584, 819, 1110
};
int main() {
int a;
cin >> a;
cout << ans[a] << endl;
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<iterator>
int main(){
std::string str;
std::cin >> str;
std::reverse_copy(str.begin(), str.end(),
std::ostream_iterator<char>(std::cout,""));
std::cout << std::endl;
return 0;
} | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 100010;
const ll mod = 1e9 + 7;
ll fac[N << 1], inv[N << 1];
int h, w, a, b;
ll power(ll a, int b) {
ll ans = 1;
while(b) {
if(b & 1) ans = ans * a % mod;
a = a * a % mod; b >>= 1;
}
return ans;
}
ll C(int n, in... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,k;
cin>>a>>b>>c>>d>>k;
int x = (c-a);
int y = (d-b);
int ans = (x*60)+y;
ans=ans-k;
cout<<ans<<endl;
} | 0 |
#include <bits/stdc++.h>
#ifdef local
#define debug(a...) qqbx(#a, a)
template <typename H, typename ...T> void qqbx(const char *s, const H &h, T&&...a) {
for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr<<*s;
std::cerr<<" = "<<h<<(sizeof...(T) ? ", " : "\n");
if constexpr(sizeof...(T)) qqbx(++s, a...);
}... | #include <iostream>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> A(N);
unordered_map<int, int> Acnt;
rep(i, N) {
cin >> A[i];
Acnt[A[i]]++;
}
vector<int>... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define loop(i,n)for(i=0;i<n;i++)
#define INF 1000000000
using ll = long long int;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
#define MAX 100005
int main()
{
I... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
int N; cin >> N;
vi P(N); rep(i,N) ci... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
string s;
int w;
cin >> s >> w;
int n = s.length();
string ans;
for (int i = 0; i < n; i += w) {
ans += s[i];
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define ll long long
long long min(long long x,long long y){return (x<y ? x:y);}
long long max(long long x,long long y){return (x>y ? x:y);}
#define ld long double
int stoi(stri... | 0 |
#include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
#define sz(x) int(x.size())
//#define int int64_t
using namespace std;
typedef pair<int, int> pii;
const int N = 302;
const int mod =... | // 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 <iostream>
#include <cmath>
using namespace std;
int dummy_prime(int n,int i){return i>1 ? n%i ? dummy_prime(n,i-1) : 0 : 1;}
int isprime(int n){return n>1 ? dummy_prime(n,(int)sqrt(n)) : 0;}
int main(){
int n;
while(cin >> n && n){
while(n>4){
if(isprime(n) && isprime(n-2)){
cout << n-2 << " " <... | #include<algorithm>
#include<functional>
#include<cstdio>
#include<iostream>
using namespace std;
int flg[1000000];
int main(void)
{
int i,j,k,n,f;
for(i=2;i<=1000000;i++) flg[i]=1;
for(i=2;i*i<=1000000;i++){
if(flg[i]==1){
for(j=2;j*i<1000000;j++) flg[i*j]=0;
}
}
cin>>n;
while(n) {
for(i=n;i>=4;i--) {
... | 1 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
cout << n / 3;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
int n, k;
int d[11];
inline int nextCombination(int comb)
{
int x = comb & -comb, y = comb + x;
return (((comb & ~y) / x) >> 1) | y;
}
template<typename T> inline void _tostr(const T t, string& s){ostringstream o;o<<t;s=o.str(... | #include<iostream>
#include<set>
#include<algorithm>
using namespace std;
int main(){
int n, k;
while(cin >> n >> k){
if(n + k == 0) break;
string x[n];
for(int i = 0; i < n; i++) cin >> x[i];
sort(x, x+n);
set<int> ans;
do{
string tmp = "";
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m);
int odd = 0;
for (int i = 0; i < m; i++) {
cin >> a[i];
odd += a[i] & 1;
}
if (odd > 2) {
cout << "Impossible\n";
return 0;
}
for (... | ////////////////////////// Author
////////////////////////// Nasim Hossain Rabbi
////////////////////////// JU-CSE28
////////////////////////// CF - imnasim3.1415
////////////////////////// UVA - imnasim3.1415
////////////////////////// Mail - imnasim3.1415@gmail.com
#include<bits/stdc++.h>
using namespace std;
#define... | 0 |
#include <cstdio>
#include <algorithm>
using namespace std;
char S[1001001];
int D[10], F[10];
int main()
{
scanf ("%s", S);
for (int i = 0; i < 10; i++) D[i] = i;
for (int t = 0; S[t]; t++){
for (int j = 0; j < 10; j++) F[j] = 1e9;
for (int j = 0; j < 10; j++) for (int i = 0; i < 10; i++){
int k = j * 10 ... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i+... | 1 |
#include <bits/stdc++.h>
using namespace std;
int dp[1001][1001];
int main(){
string s1,s2; cin>>s1>>s2;
for(int i=0;i<1001;i++){
for(int j=0;j<1001;j++) dp[i][j]=INT_MAX;
}
dp[0][0]=0;
for(int i=1;i<=(int)s1.size();i++) dp[i][0]=i;
for(int i=1;i<=(int)s2.size();i++) dp[0][i]=i;
for(int i=1;i<=(int)s1.size();i... | #include <stdint.h>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <iostream>
#include <bitset>
#include <array>
#include <stdio.h>
using namespace std;
# define MAX 1000
uint64_t D0[MAX]={0}, HP[MAX]={0}, HN[MAX]={0}, VP[MAX]={0}, VN[MAX]={0};
uint64_t Cmap[MAX][20] ... | 1 |
#include <bits/stdc++.h>
using namespace std;
string field[12];
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
void sol(int x, int y);
int main()
{
while (cin >> field[0]){
long ct = 0;
for (int i = 1; i < 12; i++){
cin >> field[i];
}
for (int i = 0; i < 12; i++){
for (int j = 0... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
typedef long long ll;
typedef long ... | 0 |
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typede... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
ty... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n';
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << c << " " << a << " " << b << endl;
}
| #include <bits/stdc++.h>
#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++)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long ... | 0 |
#include<bits/stdc++.h>
using namespace std;
string a;
int main()
{
cin>>a;
if(a.size()==2)
cout<<a<<endl;
else
cout<<a[2]<<a[1]<<a[0]<<endl;
} | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 305;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int hikaku(int a,int b,int c,int d){
int A=a*a+b*b;
int C=c*c+d*d;
if(A>C)return 1;
if(C>A)return -1;
if(a>c)return 1;
if(c>... | 1 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll =... | #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 mt make_tuple... | 0 |
#include <bits/stdc++.h>
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define SORT(a) sort(a.begin(), a.end())
#define REVERSE(a) reverse(a.begin(), a.end())
#define Lower_bound(v, x) d... | #include <cstdio>
typedef long long ll;
int n,x,y,z,s,t;
int f[50][1<<17],Ans=1;
const int p=1000000007;
int main()
{
scanf("%d%d%d%d",&n,&x,&y,&z);
for(int i=1;i<=n;++i)Ans=(ll)Ans*10%p;
t=(1<<(x-1))|(1<<(x+y-1))|(1<<(x+y+z-1));
s=(1<<(x+y+z))-1;
f[0][0]=1;
for(int i=1;i<=n;++i)
for(i... | 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(){
string s;
cin >> s;
int n = s.size();
cout << s.substr(0,n-8) << endl;
return 0;
}
| #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <math.h>
#include <utility>
#include <vector>
#include <map>
#include <cstdlib>
#define div1 1000000007
const long long INF = 1LL << 60;
using namespace std;
// a>b -> a==b;
template<class T> inline bool chmin(T& a... | 1 |
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
using pil = pair<int,ll>;
using ld = long double;
using ui = unsigned int;
using ull = unsigned long long;
using ui128 = __uint128_t;
#define all(x) (x).begin(),(x).end()
#def... | #include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<tuple>
#include<bitset>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll n;
vector<vector<P>>v;
bool check(int bit) {
for (int i = 0; i < n; i++... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int board = 1;
int N, K;
cin >> N >> K;
int i;
for(i = 0; i < N; i++){
if(board > K)
break;
board *= 2;
}
for(;i < N; i++)
board += K;
cout << board << endl;
} | #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;
cin >> a >> b;
if (a < 9 && b < 9) {
cout << "Yay!" << endl;
} else {
cout << ":(" << endl;
}
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
const int mod = 1e9+7;
const int mx = INT_MAX;
const long double pi = 4*atan((long d... | #include<iostream>
#include<string>
using namespace std;
int main() {
string str, cmd;
int a, b, q;
cin >> str >> q;
for (int i = 0; i < q; i++) {
cin >> cmd >> a >> b;
if (cmd == "print") {
for (int j = a; j <= b; j++)
cout << str[j]; cout << endl;
}
else if (cmd == "reverse") {
int fend = (b... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define f first
#define s second
using namespace std;
int main(){
int x, y;
cin >> x >> y;
int a[100]; memset(a,0,sizeof(a));
bool ok = true;
int cnt = 0;
for(int i = 1; i <= 16; i++){
cnt++;
if(cnt > 100){
ok = false; b... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0 ,-1};
signed main(){
int A,B;
cin >> A >> B;
if(A <= 8 && B <= 8) {
cout << "Yay!" << endl;
}
else {
cout << ... | 1 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
ll n;cin>>n;
string s;
while(n){
n--;
s+=(char)('a'+n%26);
n/=26;
}
reverse(all(s));
cout<<s<<endl;
} | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,p,P;
int have[50];
int remain=0;
int plase=0;
while(1){
for(int i=0;i<50;i++){
have[i]=0;
}
cin>>n>>p;
P=p;
plase=0;
if(n==0 && p==0) break;
while(1){
if(have[plase%n]==P) break;
if(p==0){
p=have[plas... | 1 |
#include<bits/stdc++.h>
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
using namespace std;
const int N=1000005;
int n,pos,ans,head,tail,q[N];
char s[N],t[N];
int main(){
scanf("%d%s%s",&n,s+1,t+1);
if(!strcmp(s+1,t+1)){
puts("0");
return 0;
}
pos=n;
head=1,tai... | #include <bits/stdc++.h>
using namespace std;
int main() {
//
int num, l;
int sum = 0;
int small = 999999;
cin >> num >> l;
for (int i = 1; i <= num; i++) {
int tmp;
tmp = l + i - 1;
sum += tmp;
if (abs(tmp) < abs(small)) small = tmp;
}
cout << sum... | 0 |
#include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
double x1,x2,y1,y2;
double d;
cin >> x1 >> y1 >> x2 >> y2;
d = (double)sqrt(((x2-x1)*(x2-x1))+((y2-y1)*(y2-y1)));
printf("%.6lf\n",d);
return 0;
} | #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 <cstdio>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int n, m, c[1009], s[510009], t[510009], cnt[32777], sum[32777];
int main() {
while (scanf("%d%d", &n, &m), n) {
for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
sort(c, c + n);
int b = 0;
for (int i = 0; i <= n; i++) {... | #include<iostream>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<cstdlib>
#include<typeinfo>
#include<sstream>
#include<list>
#include<set>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#de... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a;
for(int i=1;i<=n;++i){
if(i%3==0)
a.push_back(i);
else if(i%10==3)
a.push_back(i);
else if(i/10%10==3)
a.push_back(i);
else if(i/100%10==3)
a.push_back(i);
else if(i/1000%10=... | #include <bits/stdc++.h>
using namespace std;
void call(int);
int main() {
int n;
cin >> n;
call(n);
return 0;
}
void call(int n)
{
for (int i = 1; i <= n; i++)
{
if (i % 3 == 0)
{
cout << " " << i;
continue;
}
else if (i % 10 ... | 1 |
//Tonight's the night and it is going to happen again and again.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define T ll t; cin>>t; while(t--)
#define mod 1000000007
#define inf 1000000000000000000
#define mem(name,val) memset(name,val,sizeof(name))
#def... | #include<bits/stdc++.h>
#define int long long int
#define mod 998244353
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output1.txt","w", stdout);
#endif
int n;
cin>>n;
int a[n]... | 1 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
int main()
{
int n,m;cin >> n >> m;
vector<int> a(m);
rep(i,m) cin >> a[i];
vector<vector<int>> dp(m+1, vector<int>(n+1, -1));
sort(a.... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string str;
int num,rest=0,result=0;
cin>>str;
for(long int i=str.size()-1;i>=0;i--){
num=str[i]-'0'+rest;
if(num<(10-num) || (num==5 && str[i-1]<'5')){
rest=0;
result+=num;
}
else{
... | #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() {
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int64_t m = s.size();
vector a(1, 0L);
i... | 0 |
#include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i < N; i++)
#define ll long long int
using namespace std;
int main(){
ll N, Ans = 1000000000, K;cin >> N >> K;
bool C = 0;
vector<ll> n;
vector<ll> p{0};
rep(i, 0, N){
ll a;cin >> a;
... | #define _GLIBCXX_DEBUG
#include"bits/stdc++.h"
using namespace std;
//loops
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define OneToN(i,n) for(ll i=1;i<(ll)(n+1);i++)
#define ZeroToN(i,n) for(ll i=0;i<(ll)(n+1);i++)
#define AToB(i,a,b) for(ll i=a;i<(ll)(b+1);i++)
#define... | 1 |
#include <bits/stdc++.h>
using namespace std;
vector< int64_t > divisor(int64_t n) {
vector< int64_t > ret;
for(int64_t i = 1; i * i <= n; i++) {
if(n % i == 0) {
ret.push_back(i);
if(i * i != n) ret.push_back(n / i);
}
}
return (ret);
}
int main(){
cin.tie(0); ios::sync_with_stdio(fal... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int n;
cin>>n;
cout<<(1+n)*n/2-(3+n-n%3)*(n-n%3)/3/2-(5+n-n%5)*(n-n%5)/5/2+(15+n-n%15)*(n-n%15)/15/2<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N, O = 0;
cin >> N;
for (ll i = 0; i <= N; i++) {
if (i % 3 != 0 && i % 5 != 0) {O += i;}
}
cout << O << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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(void) {
int n; ll x, cnt=0;
cin >> n >> x;
ll a[n];
rep(i,n) cin >> a[i];
rep(i,n-1) {
if(a[i+1] > 0) {
if(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, X;
cin >> N >> X;
vector<long long int> A(N);
long long int ans = 0;
for (long long int i = 0; i < N; i++) cin >> A.at(i);
for (long long int i = 1; i < N; i++) {
if (A.at(i) + A.at(i - 1) > X) {
ans += A.at(i) + A.at(i -... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\... | #include <bits/stdc++.h>
using namespace std;
double solve(vector<vector<vector<double>>> &dp,int a, int b, int c, int n) {
if (dp[a][b][c]) return dp[a][b][c];
if (!a&&!b&&!c) return 0;
dp[a][b][c] = 1.0*n/(a+b+c);
if (a) dp[a][b][c] += solve(dp,a-1,b,c,n)*a/(a+b+c);
if (b) dp[a][b][c] += solve(dp,a+1,b-1,c,... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... | #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... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
string S;
int w;
cin >> S >> w;
int ... | #include"bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string S;
int w;
cin >> S >> w;
rep(i, S.size()) {
if (i % w == 0) {
cout << S.at(i);
}
}
cout << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep2(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
const ll INF = 1L... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define join(a, d) accumulate(a.begin() + 1, a.end(), a[0], [](string s, s... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string s, t, r;
int n, a, b;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> t >> a >> b;
if (t == "print")
cout << s.substr(a, b - a + 1) << endl;
else if (t == "reverse")
for (int j = 0; j < (b - a + 1) / ... | // class point の練習（クラスの高度な実装）
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>
typedef long long llong;
using namespace std;
int main() {
char strin[1010];
int a, b;
int q;
char querin[10];
char repin[1100];
char revin[1100];
scanf("%s", strin);
getchar();
cin ... | 1 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int wh, bk; cin >> wh >> bk;
int h = 100 / 2, w = 100;
cout << h * 2 << " " << w << endl;
auto func = [&](char c0, char c1, int cnt) {
vector<string> s(h, string(w, c0));
for (int i = 1; i < h -... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
FASTINOUT;
ll a,b,k;
cin>>a>>b>>k;
bool t=1;
while (k--)
{
if (t)
{
if (a&1)
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, Q;
cin >> N >> Q;
vector<vector<int>> vec(N,vector<int>(3));
for(int i=0; i<N; i++){
for(int j=0; j<3; j++){
cin >> vec.at(i).at(j);
}
}
vector<int> query(Q+2,-1e9);
for(int i=1; i<=Q; i++){
cin >> query.at(i);
}
query.a... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
inline int Calcu(int a,int b){
return min(a, b);
}
class SegTree{
public:
int n;
int g;
std::vector<int> data;
SegTree(std::vector<int> a, int _g){
g = _g;
for (n = 1; n < (int) a.size(... | 1 |
#include <iostream>
#include <string>
int func(int x)
{
return x * x;
}
int main(void)
{
const int max_x = 600;
int d = 0;
while (std::cin >> d) {
int loop = max_x / d;
int sum = 0;
for (int i = 0; i < loop; i++) {
sum += d * func(d * i);
}
std::cout << sum << std::endl;
}
re... | #include<stdio.h>
int main()
{
int h1,h2,m1,m2,k;
scanf("%d%d%d%d%d",&h1,&m1,&h2,&m2,&k);
m1+=60*h1;
m2+=60*h2;
printf("%d\n",m2-m1-k);
return 0;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
class MP
{
public:
vector<long long> pattern;
long long plen;
vector<long long> table;
MP(const vector<long long>& s) : pattern(s), plen((long long)pattern.size()), table(plen + 1){
table[0] = -1;
long long j = -1;
for(long long i = 0... | #include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define vi vector<int>
#define pi pair<int,int>
#define mp make_pair
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int mod=1e9+7;
mt... | 0 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template<typename T> using pq = priority_queue<T>;
template<typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
te... | 1 |
#include<bits/stdc++.h>
#define prDouble(x) cout<<fixed<<setprecision(10)<<x
using namespace std;
int n;
double dp[301][301][301];
double solve(int x, int y, int z){
if(x<0 || y<0 || z<0)
return 0.0;
if(x==0&&y==0&&z==0)
return 0.0;
if(dp[x][y][z] > -0.9)
return dp[x][y][z];
double exp = n + x*solv... | #include <iostream>
#include <math.h>
#include <stdio.h>
#define MAX 100001
int A[MAX];
int n;
int partition(int r) {
int judge_n = A[r];
int i = -1;
int j = 0;
for (j = 0; j < n; j++) {
if (A[j] <= judge_n) {
i++;
std::swap(A[i], A[j]);
}
}
return i;
}
... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 0 |
#include <iostream>
using namespace std;
void bubble_sort(int N, float* A){
int nchange = 0;
bool cont = true;
for(int i=0; cont; i++){
cont = false;
//未ソート部分列のスワップが発生しない場合停止
for(int j=N-1; j>i; j--){
if(A[j-1] > A[j]){
swap(A[j-1], A[j]);
cont = true;
nchange++;
}
}
}
for(int i=0; i<... | #include <iostream>
#include <iterator>
#include <sstream>
#include <string>
#include <set>
#include <list>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
using namespace std;
namespace patch
{
template <typename T>
string to_string(const ... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
if (i % 3 == 0) {
cout << " " << i;
continue;
}
for (int x = i; x > 0; x /= 10) {
if (x % 10 == 3) {
cou... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
unordered_map<ll, ll> mp;
rep(i, n){
cin >> a[i];
if (mp.find(a[i]) != mp.end()){
mp[a[i]] += 1;
... | 0 |
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#include<bits/stdc++.h>
#define ll long long
#define d double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
stri... | #include <bits/stdc++.h>
const int INF =1e9;
const int MOD =1e9+7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= ... | 0 |
#include <bits/stdc++.h>
#define MOD 998244353
using namespace std ;
int n , m , k ;
int jc[ 200005 ] ;
int ans = 0 ;
inline int qpow ( int a , int b ) {
int res = 1 ;
while ( b ) {
if ( b & 1 ) res = 1LL * res * a % MOD ;
b >>= 1 ;
a = 1LL * a * a % MOD ;
}
return res % MOD ;
}
... | #include<stdio.h>
#include<math.h>
int main(){
double x1,x2,y1,y2,ans;
scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2);
ans=(x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
printf("%lf\n",sqrt(ans));
return 0;
}
| 0 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(void){
// Your code here!
long long int N,H,W,i,j,k,ans,count,cost,tmp;
long long int S[200010];
long long int Ssum[200010];
string T;
bool flag;
count=0;
ans=std::pow(10,18);
flag=false;
cin >>N... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int k,x,st,i;
cin>>k>>x;
x-=--k;
k=2*k+1;
while(k--)
cout<<x++<<" ";
} | 1 |
#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 = 1e5+23;
int a[N];
void solve() {
int n, m; scanf("%d%d", &n, &m);
map<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
ll N, M;
ll A[100010];
int main(int... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define long long ll
#define f(i,n) for(int i=0;i<n;i++)
const int maxn=305;
double dp[maxn][maxn][maxn];
double recur(int k, int b, int c,int n){
if(dp[k][b][c]>=0)return dp[k][b][c];
if(k==0&&b==0&&c==0)return 0.0;
double res=0.0;
// dp[k][b][c]=0.0;
if(k>0)res+=(k)*... | #include <bits/stdc++.h>
using namespace std;
double dp[305][305][305];
int main(){
int n, a;
cin >> n;
vector<int> sushi(3);
for(int i=0; i<n; ++i){
cin >> a;
++sushi[a-1];
}
int sum1 = sushi[2];
int sum2 = sushi[1] + sushi[2];
int sum3 = sushi[0] + sushi[1] + sushi[2];
for(int k=0; k <= su... | 1 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main() {
int n, u, v;
cin >> n >> u >> v;
vector<int> graph[n];
for (int a, b; cin >> a >> b; ) {
graph[a - 1].emplace_back(b - 1);
graph[b - 1].emplace_back(a - 1);
}
int takahashi[n], aoki[n], parent[n], result = 0;
... | #include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using namespace std;
using ll=long long;
using pii=pair<int, int>;
using vi=vector<int>;
const ll INF=1LL<<60;
const int MOD=998244353;
const int N=2e5+5;
int main(){
int N, u, v; cin >> N >> u >> v;
u--, v--;
vector<... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
string s ;
cin >> s ;
int n ;
cin >> n ;
double t=s.size();
string a ;
for(int i=0 ; i<(t/n) ; i++ ){
a+=s.at(0+i*n);
}
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
string s; int w; cin>>s>>w;
int k=s.size();
rep(i,k){
if(i%w==0) cout<<s[i];
}
cout<<endl;
} | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define int long long
#define mp make_pair
#define inf 1000000007
#define ll long long
using namespace std;
ll dp[210][100009];
int ka[214514],inv[214514];
void setkaijo(int n){
ka[0]=1;
for(int i=1;i<=n;i++){
ka[i] = ka[i-1] * i;
ka[i] %= inf;
}
}
int modpow(int x,i... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
const int N=205,M=1e5+5;
const int mod=1e9+7;
int dp[N][M],a[N],n,X;
int dfs(int u,int x) {
if(!u) return x%a[u];
if(dp[u][x]!=-1) return dp[u][x];
return dp[u][x]=(dfs(u-1,x%a[u])+1LL*u*dfs(u-1,x))%mod;
}
int main() {
scanf("%d%d... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
int MOD = 1e9+7;
//ll po(ll b, ll p){ return !p?1:po(b*b%MOD,p/2)*(p&1?b:1)%MOD;}
// ll pomd(ll a, ll k, ll md) { ll p; if (k == 0){ return 1; } p = pomd(a, k / 2, md); p = p * p % md; if (k % 2){ p... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
int n,m;
cin >> n >> m;
set<int> s;
for(int i = 2;i<=sqrt(m);i++){
if(m%i==0) {
... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
cout << min(N % K, 1) << endl;
return 0;
} | #include <stdio.h>
int main() {
int start = 1, n, t, x = 0;
scanf("%d", &n);
scanf("%d", &t);
for(int i = 0; i < (n-x); i++) {
while(start < t) {
if(x >= n) {
break;
}
start *= 2;
x++;
}
if(x >= n) {
break;
}
start += t;
}
printf("%d", start);
return 0;
} | 0 |
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 |
#include <bits/stdc++.h>
#include <math.h>
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++)
typedef long long ll;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef LOCAL
#include<debug.h>
#else
#define db(...) 21
#endif
#define debug(x) cout << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e)... | 1 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int M,ans=-1,g=0;
cin>>M;
vector<pair<int,int>> A(M);
for(pair<int,int> &p:A){
cin>>p.first>>p.second;
ans+=p.second;
g+=p.first*p.second;
}
cout<<ans+(g-1)/9<<endl;
} | #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 all(x) (x).begin(),(x).end()... | 1 |
#include<iostream>
using namespace std;
int a[13][32];
void day(void)
{
int check=3;
for(int i=1;i<13;i++){
for(int j=1;j<32;j++){
a[i][j]=check;
check++;
if(check==7)check=0;
if((i==4||i==6||i==9||i==11)&&j==30)break;
else if(i==2&&j==29)break... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int month[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int m,day,sumday;
while(1){
cin >> m; // 月
if (m==0){ break;}
cin >> day; //日付
for(int i=0;i<m;i++){
day+=month[i];
}
switch(day%=7){
case 1:
cout<<"Thursday"<<endl;... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.