code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#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 = 1e5 + 5;
const ll... | #include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
typedef uint64_t ull;
typedef int64_t sll;
static const ull MOD = 1000000007LL;
int n;
int k;
int q;
ull a[200019];
ull umin (ull a, ull b) {
return (a < b) ? a : b;
}
ull umax (ull a, ull b) {
return (a > b) ? a... | 1 |
#include <stdio.h>
int main(){
int a, b, c, d;
int K;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &K);
int diff1 = c - a;
int diff2 = d - b;
int min = (diff1 * 60) + diff2;
printf("%d", min - K);
return 0;
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
// freopen("input.txt", "r", stdin);
int main() {
vector<string> deck;
str... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
int main() {
int H,W,ans=0; cin>>H>>W;
vector<vector<char>> S(H,vector<char>(W));
queue<p... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int H, W, ans=1; cin >> H >> W; string A[H];
REP(i, H){ cin >> A[i]; }
int B[H][W]={}; vector< pair<int, int> > C;
REP(i, H){ REP(j, W){
if(A[i][j]=='#'){ B[i][j]=1; C.push_back(make_pair(i, j)); }
} }
REP(i, ... | 1 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
class Prints {
private:
class _... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
int cnt = 0;... | #define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define al... | 1 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main()
{
fast;
int n,a,b,i;
cin>>n;
vector<pair<pair<int,int>,int>> pts;
for (i=0;i... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#de... | 0 |
#include <iostream>
using namespace std;
int main(){
int n;
while( cin >> n, n ){
int pm, pe, pj;
while( n-- > 0 ){
cin >> pm >> pe >> pj;
if( pm == 100 || pe == 100 || pj == 100 ||
(pm+pe)/2 >= 90 || (pm+pe+pj)/3 >= 80 ){
cout << 'A' << ... | #include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 11;
int a[N];
int main() {
ios :: sync_with_stdio(false);
int n;
while(cin >> n) {
if(n == 0) break;
for(int i = 0; i < n; i ++)
cin >> a[i];
int ans = a[0], pre = min(a[0], 0);
for(int i = 1; i < n; i ++) {
a[i] += a[i - 1];
ans = ... | 0 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair... | #include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
int main(){
int n;
cin >> n;
int a,b,c = 100000001;
if(n == 2)cin >> a >> b;
if(n == 3)cin >> a >> b >> c;
int mn = min(a,min(b,c));
if(n == 2)c = 0;
for(int i = 1 ; i <= mn ; i++ ){
if(a%i == 0 && b%... | 1 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v(n, 0);
for... | #include<bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i... | 0 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<62;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
ll n;
vector<vector<ll>> graph(1000*1000);
vector<ll> vdist(1000*1000,-1);
vector<ll> seen(1000*1000,-1);
ll dfs(ll now)
{
if(seen.at(now) == 2) return vdist.at(now);
se... | 1 |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int N,i,j,k,ans=0;
cin>>N;
vector<int> L(N);
for (i=0;i<N;i++) cin>>L[i];
for (i=0;i<N-2;i++) {
for (j=i+1;j<N-1;j++) {
if (L[i]==L[j]) continue;
for (k=j+1;k<N;k++) {
if (L[i]==L[k] || L[j]==L[k]) continue;
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
/*
N=1000ならN*Nで順番付けできそう
違うかな
BFSみたいな
1-2
2-1ならOK
1-2
2-3
3-2
ならOK
みたいな
先頭同士でペアが作れるかどうか
a<bでpair{a,b}を格納して、ペアになったらOKとか
TLEなんだが
N^3になるのか
マッチしたやつだけ再検査すればいいのかな
毎回入れなおしがきつい
*/
int main(){
ll N; cin>>N;
ll end=N*(N-1);
end/=2;
vector<queue<ll>> Q(N... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <typename Graph>
struct StronglyConnectedComponents {
Graph &g;
int n;
vector<vector<int>> gg;
vector<vector<int>> rg;
vector<bool> used;
vector<int> order;
vector<int> comp;
StronglyConnectedComponents(Graph &g)
: g(g), n(g.n), gg(n), rg(n), u... | #include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n... | 1 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
main(){
int e;
while(cin>>e,e){
int ans=1e9;
for(int z=0;;z++){
if(z*z*z>e)break;
for(int y=0;;y++){
if(z*z*z+y*y>e)break;
int a=e-z*z*z-y*y;
ans=min(ans,a+y+z);
}
}
cout<<ans<<endl;
}
}
| #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include ... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int solve(int n, vector<int> & dims){
int dp[100][101] = {{0}};
for (int span = 2; span != n + 1; ++span){
for (int first = 0; first + span != n + 1; ++first){
for (int last = first + span; last != n + 1; ++last... | #include <cstdio>
#include <algorithm>
using namespace std;
const int kMax = 100 + 5;
int n;
int num[kMax], dp[kMax][kMax];
int main() {
scanf("%d", &n);
for(int i = 1;i <= n;++ i) scanf("%d%d", &num[i-1], &num[i]);
for(int l = 2;l <= n;++ l) {
for(int i = 1;i <= n - l + 1;++ i) {
in... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_postal_code(void) {
int a, b;
string s;
string msg = "Yes";
cin >> a >> b >> s;
if (s.size() != a + b + 1) msg = "No";
else if (s[a] != '-') msg = "No";
else {
for (int i = 0; i < a + b + 1; i++) {
if (... | #include<stdio.h>
int main()
{
int A, B;
scanf("%d %d", &A, &B);
int sum = A + B + 1;
char str[sum];
scanf("%s", &str);
int ctr = 0;
for(int i = 0; i < sum; i++){
if(i == A){
if(str[i] != '-'){
printf("No\n");
return 0;
}
}else{
if(str[i] >= '0' && str[i] <= '9'){
++ctr;
}
}
}
i... | 1 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
using namespace std;
#define N 1001
#define M 20
#define mod 998244353
vector<int> adj[N];
int vis[N],par[N];
int depth[N];
int anc[N][M];
int outSize = 100000;
vector<int> ret;
void dfs(int node... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <iomanip>
#include <complex>
#define rep(i, j, n) for (int i = (j); i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; i >= (j); --i)
using namespace std;
using ll = long long;
constexpr ll INF = 1LL << 60;
int n, ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll M;
deque<ll> d;
deque<ll> c;
deque<ll> e;
int main(){
cin >> M;
for(int i=0;i<M;i++){
ll a,b;
cin >> a >> b;
d.push_back(a);
c.push_back(b);
}
ll count = 0;
while(d.size() > 0){
if(c[0] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
int main(){
int N; cin >> N;
ll nofd = 0, sum = 0;
rep(i,N){
ll d,c; cin >> d >> c;
nofd += c;
sum += d*c;
}
cout << (nofd - 1) + (sum-1)/9 << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
//#include <boost/multiprecision/cpp_int.hpp>
//using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll h,w;
ll direction2[4][2]={{1,0},{0,1},{0,-1},{-1,0}};
bool valid(int a,int b)
{
if(a>=1&&a<=h&&b>=1&&b<=w)return true;
else return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x=1000000;
cin>>n;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; ... | #include<bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
int m;
cin>>m;
if(n==0&&m==0){break;}
vector<vector<int>> v(n+1);//??¨?????????
vector<int> s(n+1,0);//??????
s[1]=1;
for(int i=0;i<m;i++){
int a;
cin>>a;
int b;
cin>>b;
v[a].push_back(b);
... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
cin >> n;cin.get( );
//n++;
string ss;
for(int j=0;j<n;j++)
{
getline(cin,ss);
int len =ss.size();
for(int i=6;i<len;i++)
{
//cout << ss[i];
if(ss.substr(i-6,7)==... | #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++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
vector<int> antenna (5);
REP... | 0 |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<sstream>
#include<cstdlib>
using namespace std;
int main(){
while(1){
int n,k;
scanf("%d%d",&n,&k);
if(n==0)
break;
vector<int> card(n);
for(int i=0;i<n;i++){
scanf("%d",&card[i]);
}
sort(card.begin(),card.end());
vector... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
using namespa... | 1 |
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<vector>
#define rep(i,n) for(int i=0;i<int(n);i++)
#define sint(n) scanf("%d",&n);
using namespace std;
int main(){
while(1){
int a,b,c;
sint(a)
sint(b)
sint(c)
if(a==0){break;}
int k;
sint(k)
int buhin[301]={0};
... | #include <iostream>
using namespace std;
struct results{
int a;
int b;
int c;
int result;
};
int main(){
while(true){
int parts[1000]={0};
int aa,bb,cc,n;
cin >> aa >> bb >> cc;
if(aa+bb+cc==0)
break;
cin >> n;
resul... | 1 |
//author rhythmicankur
//god_is_almighty
#pragma GCC optimize("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#def... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unro... | 0 |
#include<cstdio>
#include<iostream>
using namespace std;
char masu[50][50] = {{0}};
void saiki(int x,int y){
masu[y][x] = '0';
if(masu[y+1][x] == '1') saiki(x,y+1);
if(masu[y-1][x] == '1') saiki(x,y-1);
if(masu[y][x+1] == '1') saiki(x+1,y);
if(masu[y][x-1] == '1') saiki(x-1,y);
}
int main(){
wh... | #include <bits/stdc++.h>
#define ctz __builtin_ctz
const int N = 648;
int n, D1, D2;
int a[N][N];
void coloring(int dist, int bit) {
int i, j, L = ctz(dist) / 2; dist >>= 2 * L;
switch (dist & 3) {
case 0: throw "gg"; break;
case 1: for (i = 0; i < n; ++i) for (j = 0; j < n; ++j) a[i][j] |= ((i ^ j) >> L & 1) ... | 0 |
/*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(fa... | #include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (long ... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
static const int MAX = 100;
#define INF 2000000000000ll
int V, E;
long long dp[MAX][MAX];
void Warshall_Floyd() {
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
for (int j =0 ; j < V; j++) {
if (dp[i][k] == INF || dp[k... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) fprintf(stderr, "#%s.%d (%s) = (%ld)\n", __func__, __LINE__, #x1, x1);
#define dumpll(x1, x2) fprintf(stderr, "#%s.%d (%s, %s) = (%ld, %ld)\n... | 1 |
#include<bits/stdc++.h>
using namespace std;
template<class T>inline void read(T &re)
{
char ch;
while((ch=getchar())<'0'||ch>'9');
re=ch-48;
while((ch=getchar())>='0'&&ch<='9')
re=(re<<3)+(re<<1)+ch-48;
}
int n,m,Q,pt[4005][4005],eg[4005][4005];
char mp[2005][2005],s[4005][4005];
int main()
{
// freopen("duty.in"... | #include<stdio.h>
#include<cstdio>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<functional>
#define pi 3.14159
#define Inf (int)pow(2., 12.)
using namespace std;
typedef std::pair<int, int> mypair;
q... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include<bits/stdc++.h>
#define ll long long int
#define f first
#define s second
#define pb push_back
#define PII pair<ll,ll>
ll const MOD = 998244353;
ll const N = 1000005;
ll const LN = 20;
ll const inf = 8e18;
using namespace std;
ll n, m, a[N];
ll cnt[N];
ll fact[N];
ll ifact[N];
ll bexpo (ll x, ll n, ll m)
{
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
struct LowLink{
vector<vector<int>>& edges;
// 関節点
vector<int> art;
vector<pair<int,int>> bridge;
vector<int> used, ord, low;
int k;
void dfs(int idx, int par){
ord[idx] = k++;
... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
struct ArticularPoint {
int n;
vector<vector<int>> g;
set<int> points;
vector<int> parent;
vector<int> discTime;
vector<int> lowTime;
vector<bool> visited;
vector<bool> isAp;
int time = 0;
ArticularP... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int h, w;
cin >> h >> w;
char s[h][w];
rep(i, h) rep(j, w) cin >> s[i][j];
rep(i, h) rep(j, w) {
if (s[i][j] == '.') continue;
bool ok = false;
for... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define of(i,l,r) for(int i=l;i>=r;i--)
#define fe(i,u) for(int i=head[u];i;i=e[i].next)
using namespace std;
typedef long long ll;
inline void open(const char *s)
{
#ifndef ONLINE_JUDGE
char str[20];
sp... | 0 |
#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
typedef pair<int, int> P;
int data[12][12] = {};
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1 ,0 ,-1};
void dfs(int sx, int sy) {
queue<P> que;
data[sx][sy] = 2;
que.push(P(sx, sy));
while(que.size()) {
P p = que.front();
que.po... | #include <iostream>
#include <string>
#define MAP 12
using namespace std;
int map[MAP][MAP];
bool valid(int y, int x) {
if ((0 <= y && y < MAP) && (0 <= x && x < MAP)) {
if (map[y][x] == 1)
return true;
}
return false;
}
void remove_island(int y, int x) {
int nx, ny;
int dx[4] = {1, 0, -1, 0};
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#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(string s) {return atoi(s.c_str());}
int k... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 300003
#define MOD 1000000007
#define INF 1000000000000000
int main(){
int A,B,C;
cin>>A>>B>>C;
if((C-A)*(B-C)>=0){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
string s;
cin>>s;
if(s.length()==2)cout<<s<<endl;
else
{
for(int i=2;i>=0;i--)cout<<s[i];
cout<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int n ;
cin>> n ;
double ans=4*acos(0.0)*(double)n ;
cout<<ans ;
}
int main(){
int y ;
y=1 ;
//cin>>y ;
while(y--)
{
solve() ;
}
} | 0 |
//https://atcoder.jp/contests/abc160/tasks/abc160_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin>>x;
ll a;
a=x/500;
ll fin1;
fin1=a*1000;
ll b;
b=x%500;
ll c;
c=b/5;
ll fin2;
fin2=c*5;
ll sum=0;
sum=fin1+fin2;
cou... | #include <bits/stdc++.h>
using namespace std;
double eps = 1e-9;
double pi = acos(-1);
#define fast_io ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define en "\n"
#define ff first
#define ss second
#define sp(x) fixed << setprecision(x)
#define VECT(v) vector<int>v
#define SCAN(v) int temp; f... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int matrix_rank(vector<unsigned long long> A){
int n=A.size(),r=0;
rep(i,64){
int piv=-1;
for(int j=r;j<n;j++) if(A[j]>>i&1) {
piv=j;
break;
}
if(piv==-1) continue;
for(int j=r;j<n;j++) if(j!=piv && A[j]>>i&1) {
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define x first
#define y second
#define sz(a) ((int)(a.size()))
using namespace std;
const int mod = 998244353;
int mult(int a, int b)
{
return a * (ll) b % mod;
}
int add(int a, int b)
{
return a + b >= mod ? a + b - mod : a +... | 1 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong h, w;
llong a[100][100];
llong ... | #include <bits/stdc++.h>
using namespace std;
int H, W;
vector<vector<char>> maze(51, vector<char>(51));
vector<vector<bool>> check(51, vector<bool>(51));
bool goal;
queue<pair<int, int>> BFS(queue<pair<int, int>> q, pair<int, int> p) {
int y = p.first, x = p.second;
//cout << y << " " << x <<endl;
if (y == H -... | 0 |
#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... | #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... | 1 |
#include <iostream>
#define MX 1000000000
using namespace std;
int M[100][100],N; //M[i][j]:i©çjÜÅÌRXg
int dijkstra(int s , int g){
bool visited[100];
int d[100];
for(int i=0;i < N;i++) d[i] = MX , visited[i] = false;
d[s] = 0;
while(1){
int u;
int mincost = MX;
for(int i=0;i<N;i++)... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
#define MAX_V 100
using namespace std;
typedef struct edge{
int to;
int cost;
edge(){
}
edge(int _to,int _cost){
to = _to;
cost = _co... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
#include <utility>
#include <stdio.h>
#include <unistd.h>
using namespace std;
typedef long long int ll;
#define rep(i, n) ... | #include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef pair<int,int> pii;
const int N = 1e4+10;
string dp[N], val[15];
string num = "123456789";
int c[] = {2,5,5,4,5,... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 2e5+6;
int bit[55][55];
void add(int x, int y){
for(int i=x;i>0;i-=(i&-i)){
for(int j=y;j>0;j-=(j&-j)){
bit[i][j]++;
}
}
}
ll g... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <math.h>
unsigned int factorial(unsigned int n){
if (n==0) return 1;
else return n*factorial(n-1);
}
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
... | 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(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int A,B,K;
cin >> A >> B >> K;
rep(i,K)
if(i%2) {
if(B%2)
--B;
B /= 2;
A += B;
} else {
if(A%2)
--A;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N,K; cin >> N >> K;
vector<ll> v(N+1,0);
for(int i = 0; i < N; i++){
ll tmp; cin >> tmp;
v[i+1] = tmp;
}
for(int i = 1; i <= N... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
#define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios_ba... | #include <bits/stdc++.h>
using namespace std;
const int N_MAX = 302;
const int MOD = 998244353;
int n, k;
string s;
int m;
int a[N_MAX];
int spa[N_MAX];
int dp[N_MAX][N_MAX][N_MAX];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> s >> k;
n = s.size();
s = ... | 1 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ... | #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define LLINF ((long long) 1e18)//1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-7) //0.0000001 the value
#defi... | 0 |
#include <iostream>
int main (){
std::string rightName = "Hoshina";
std::string wrongName = "Hoshino";
//num of data n
int n = 0;
std::cin >> n;
//skip "\n"
std::cin.ignore();
for(int i = 0; i < n; ++i){
std::string line;
//input string
getline(std::cin, line);
... | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(), x.end()
#define watch(x) cout<<#x<<" : "<<x<<endl
#define tr(container, it) for(typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define testCa... | 0 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using cd = complex <double>;
typedef pair <int, int> pii;
const int N = 3e3 + 5;
const long long INF = 1e18;
const int mod = 998244353;//786433;//998244353;
const double Pi = acos(-1);
void ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
#define cout(val) cout << (val) << endl
using namespace std;
typedef long long ll;
int main(){
int h, w;
char t;
cin >> h >> w;
vector<vector<bool>> c(h, vector<bool>(w, false));
queue<pair<int, int>> que1, que2;
rep(i, ... | 1 |
#include <iostream>
using namespace std;
int main() {
int n,g,m;
cin>>n>>g;
m=(g*2)-n;
cout<<m<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int d = 2;
int sum = 0;
while(d--){
if(a>b){
sum+=a;
a=a-1;
}
else if(a<b){
sum+=b;
b=b-1;
}
else if(a==b && d==2){
sum = a+b;
}
else{
sum+=a;
}
}
cout << sum << endl;
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | #include <bits/stdc++.h>
using namespace std;
void Main()
{
int n, m;
cin >> n >> m;
int a[m], b[m];
int j = 0;
int sp = 0;
for (int i = 0; i < m/2; i++)
{
a[i] = j;
j++;
sp++;
}
int sp2 = sp;
if(m % 2 == 1){
a[sp] = j;
j++;
b[sp]... | 0 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)... | #include<bits/stdc++.h>
using namespace std;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define inf 1... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int n;
long long int ans = 3;
cin >> n;
int a[n], rgb[3] = {0};
for(int i = 0; i < n; ++i) {
cin >> a[i];
}
if(a[0] != 0) {
cout << 0 << '\n';
return 0;
}
rgb[0] = 1;
for(int i =... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;
int a[maxn];
int main() {
ios_base::sync_with_stdio(false);... | 1 |
#include<bits/stdc++.h>
#define pb push_back
#define Nmax 210
#define M 63
using namespace std;
typedef long long ll;
string s;
int N, n, T;
bitset<M> A[Nmax];
ll a[Nmax];
bool gauss() { //true if linearly dep
int i=0,j=0;
while(i<N && j<M) {
int k;
for(k=i;k<N;++k) if(A[k][j]) break;
if(k==N) { ++j... | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#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;
typedef l... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> in... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#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 ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,v... | 1 |
#include <iostream>
using namespace std;
int Rates(int A){
if (A>=10){
return 0;
}else{
return 100*(10-A);
}
}
int main(){
int N,R;
cin >>N>>R;
cout <<R+Rates(N)<<endl;
}
| #include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#define ll long long
int main()
{
int N, R;
std::cin >> N >> R;
if(N >= 10) {
std::cout << R << std::endl;
}
else {
std::cout << R + (10-N)*100 << std::endl;
}
} | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N ;
string str = to_string(N);
int length= str.size();
int div=0;
for(int i=0; i<length; i++){
div+=(int)(str[i] - '0');
}
if(N%div == 0){
cout<< "Yes" <<endl;
}else{
cout<< "No" <<end... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
//#define fr(i,j,k) for(int i=j;i<k;i++)
//#define f(n) fr(i,0,n)
//#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const ll mod = 1e11 + 7;
const int maxn = 2e5+5;
#include<atcoder/all>
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define LOL cout<<'\n';
#define MOD 1000000007
#define sz(x) ((int)x.size())
#define INF LONG_LONG_MAX
#define NINF LONG_... | 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 ... | #include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int64_t f(int64_t x,int64_t y){
if(y==0)
return 1;
else if(y%2==0)
return (f(x,y/2)*f(x,y/2))%mod;
else
return (x*((f(x,y/2)*f(x,y/2))%mod))%mod;
}
int64_t comb(int64_t n,int64_t k){
int64_t a=1;
for(int64_t i=1;i<=k;i++){... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>> n;
set<int>st;
int input;
int ans = 0;
for(int i = 1; i <= n; i++)
{
cin>> input;
st.insert(input);
if(input == *st.begin())
ans++;
}
cout<< ans;
return 0;
}
| #include<bits/stdc++.h> //---------------------------------------------------------------
# define ll long long
# define mod 1000000007
# define MAX 100005
# define PI 3.141592653589793238 ... | 0 |
#include <stdio.h>
int main(void)
{
int day[13][32];
int i, j;
int n = 4;
int month;
int da;
for (i = 1; i <= 12; i++){
if (i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10 || i == 12){
for (j = 1; j <= 31; j++){
day[i][j] = n;
n++;
if (n == 8){
n = 1;
}
}
}
else if (... | #include <iostream>
#include <vector>
#include <string>
int main()
{
std::vector<std::string> day_of_week{
"Thursday",
"Friday",
"Saturday",
"Sunday",
"Monday",
"Tuesday",
"Wednesday"
};
std::vector<int> day_num_of_month{
31,
29,
31,
30,
31,
30,
31,
31,
30,
31,
30,
31
};
in... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll n,m,k,ans=0,tmp=1;
ll power(ll a,ll b) {return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
int main()
{
cin>>n>>m>>k;
for(ll i=0;i<=k;i++){
ans=(ans+(tmp*m%mod)*power(m-1,n-i-1))%mod;
tmp=tmp*(n-i-1)%mod*pow... | #include<bits/stdc++.h>
using namespace std;
#define MAX 100001
#define MOD 1000000007
#define ll long long
#define ld long double
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
int main() {
fast;
int t = 1;
// cin >> t;
while(t--) {
int n, x, t;
cin >> n >> x >> t;
int an... | 0 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int N; string S; vi l,r;
void input()
{
cin>>N>>S;
}
void solve()
{
int count=0;
for(int i=0;i<N;++i) {
if(S[i]=='W') ++count;
l.emplace_back(coun... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl/*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, l... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if ((a < c && b > c) || (a > c&& b < c)) puts... | 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> Pll;
using Graph = vector<vector<int>>;
using Graphl = vector<vector<ll>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i+... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <cstdio>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <s... | 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
vector< pair<int,int> > V;
vector< pair< pair<int,int>,int> > E;
vector<pair<int,int> > G[500005];
int dist[500005];
map<pair<int,int>,int> mp;
int main(){
int N,M;
cin>>N>>M;
for(int i = ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int>v(m + 3), v2, stick(12), val(12, -1), vis(12, 0);
stick[1] = 2, stick[2] = 5, stick[3] = 5, stick[4] = 4, stick[5] = 5, stick[6] = 6, stick[7] = 3, stick[8] = 7, stick[9] = 6;
for(int i = 0; i < m; i++){
... | 0 |
#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 <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
#define rrep(i, j, n) for (int i = (int)n - 1; j <= i; --i)
int main() {
ll n;
cin >> n;
ll m = (ll)sqrt((double)n);
auto d = [](ll x) {
ll res = 0;
... | 1 |
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s;
std::cin >> s;
int minv = 1000;
for (int i = 0; i < s.size() - 2; ++i) {
minv = min(minv, abs(stoi(s.substr(i, 3)) - 753));
}
std::cout << minv << std::endl;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
int main(){
int n;
cin >> n;
vector <int> s(4);
rep(i,4){
s[3-i] = n%10;
n /= 10;
}
vector <char> ansi(3);
for(int i=0; i<(1<<3... | 0 |
#include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <cmath>
#include <set>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
using namespace std;
typedef long long ... | #include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
int n;
int ary[100][100];
while(1)
{
cin >> n;
int sumx = 0;
int sumy = 0;
int sumxy = 0;
if(n == 0)
{
break;
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)
{
cin >> ary[i][j];
}
}
for(int i... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;
}
int main(){
int n;
ll k;
cin >> n >> k;
ll a[n];
int flag = 0;
ll max = 0;
for(int i = 0; i < n; i++){
cin >> a[i];
if(max < a[i]){
max = a[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
int K;
cin >> K;
vector<int> A(N + 1,0);
for(int i = 0; i < N; i++) {
cin >> A.at(i + 1);
}
for(int i = 1; i < N; i++) {
A.at(i + 1) += A.at(i);
}
int ans = 0;... | 0 |
#if 0
2019.12.30
朴素 dp 设 f[i][p][q] 表示前 i 次操作后当前棋子为 (p, q) 的最小代价。
事实上由于第 i 次操作后一定有一个棋子是 x[i] ，因此可以优化一维：
f[i][j] 表示前 i 次操作后当前棋子为 (j, x[i]) 的最小代价。
转移有两种：
1) f[i - 1][j] + |x[i - 1] - x[i]| -> f[i][j]
2) min(f[i - 1][k] + |x[i] - k|) -> f[i][x[i - 1]]
用线段树维护 f[~][j] ，第一种转移就是全局加，第二种是单点取 min 。
第二种转移可以把左边的绝对值拆开：
f[i - 1][k... | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, x;
cin >> n >> x;
vector<ll> vec(n);
for (auto &v : vec)
cin >> v;
ll ans = 0;
for (ll i = 1; i< n; ++i) {
ll vsum = vec[i] + vec[i-1];
if (vsum <= x)
continue;
else if (vsum - x <= v... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
int main() {
string s;
cin >> s;
bool ans = true;
rep(i,s.size()){
if(s.size()%2!=0){
ans = false;
break;
}
if(s.at(i)!='h' || s... | 1 |
#include<iostream>
#include<iomanip>
#include<functional>
#include<algorithm>
#include<string>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
#define LL long long
int n,a[111111]={},sum=0;
int main() {
cin>>n;
for(int i=1;i<=n;i++)... | #include <stdio.h>
#include <iostream>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
int S[n];
for (int i = 0; i < n; i++)
{
scanf("%d", &S[i]);
}
int q;
scanf("%d", &q);
int T[q];
for (int i = 0; i < q; i++)
{
scanf("%d", &T[i]);
}
int cnt = 0;
for (int i = 0; i < q; i+... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int maxn = 4000 + 10;
int n, k;
ll inv[maxn], fac[maxn], facinv[maxn], ans[maxn];
void init()
{
inv[0] = inv[1] = 1;
fac[0] = facinv[0] = 1;
for(int i = 1; i < maxn; ++i)
fac[i] = fac[i - 1] * i % mod;
for(int i = ... | // ※※※ 解答不能 ※※※
// 解き直し.
// scott_wu氏.
// https://atcoder.jp/contests/arc102/submissions/3114772
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL MOD = 998244353;
const int MAXN = 4100;
int K, N;
LL pascal[MAXN][MAXN];
int main(){
pascal[0][0] = 1;
for(int i = 1; i < MAXN; i++){
... | 1 |
#include<iostream>
using namespace std;
class dice {
private:
int n[7];
public:
dice(int, int, int, int, int, int);
int getcur() { return n[1]; }
void rotate(char);
};
dice::dice(int n1, int n2, int n3, int n4, int n5, int n6) {
n[1] = n1;
n[2] = n2;
n[3] = n3;
n[4] = n4;
n[5] = n5;
n[6] = n6;
}
void dice... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define rep(i, a) for (int i = 0; (i) < (int) (a); (i)++)
#define reps(i, a, b) for (int i = (int) (a); (i) < (int) (b); (i)++)
#define rrep(i, a) for (int i = (int) a-1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int) (a)-... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int put(int a, int b)
{
int ans = 1;
while (b) {
if (b & 1)
ans = 1LL * ans * a % MOD;
a = 1LL * a * a % MOD;
b /= 2;
}
return ans;
}
const int NMAX = 2e6;
int fact[NMAX], invfact[NMAX];
void precalc()
{
fact[0] = 1;
for (int i ... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define nl '\n'
#define INF 1e9 + 5
#define f(i, n) for (int i = 0; i < n; ++i)
using namespace std;
pair<int, int> get(vector<int>& a, bool even, int skip) {
int n = a.size();
unordered_map<int, int> book;
pair<int, int> res = {0... | #include<iostream>
using namespace std;
int m[101];
int main(){
int n,q;
int i,j;
int d,x;
int max,a,f;
while(1){
f=0;
max=-1;
for(i=0;i<101;i++){
m[i]=0;
}
cin >> n >> q;
if(n==0 && q==0)break;
q--;
for(i=0;i<n;i++){
cin >> d;
if(d==0)f=1;
for(j=0;... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b;
cin >> a >> b;
int maxv = max(a, b);
int minv = min(a, b);
int c = minv - 1;
int d = maxv - c;
int count = 0;
bool da[100][100];
fill(da[0], da[0]+100*100, false);
for (int i = 0; i < 25; i++) {
for (int j = 0; j < 25; j++) {
if (!... | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | 0 |
#include<bits/stdc++.h>
#define ll long long
#define N 20
#define inf 1e9
#define rep(i,j,k) for(ll i=j;i<=k;++i)
using namespace std;
inline ll read(){
ll x=0,f=0;char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=1;
for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+ch-48;
return f?-x... | %:pragma GCC optimize "-O3"
%:pragma GCC optimize("Ofast")
%:pragma GCC optimize("inline")
%:pragma GCC optimize("fast-math")
%:pragma GCC optimize("unroll-loops")
%:pragma GCC optimize("inline-functions")
%:pragma GCC optimize("no-stack-protector")
%:pragma GCC optimize("inline-small-functions")
%:pragma GCC optimize(... | 1 |
#include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (long long i = 0; i < N; i++)
using ll = long long;
void solve(long long N, long long K) {
if (N % K == 0) {
cout << 0 << endl;
} else {
cout << 1 << endl;
}
}
int main() {
long long N;
scanf("%lld", &N);
long ... | 1 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
const long long INF = 1LL << 60; // 1.15x10^18
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using edge = pair<int, long long>;
using Graph = vector<vector... | #include<stdio.h>
#define INF 1000000
void warshall_floyd();
int min(int,int);
int graph[101][101],n,c,d;
int main(){
int k,i,j,x,e,a,b;
while(scanf("%d %d",&n,&k),n,k){
for(i=0;i<=n;i++)
for(j=0;j<=n;j++)
graph[i][j]=i==j?0:INF;
for(i=0;i<k;i++){
if(scanf("%d",&x),x){
scanf("%d %d %d",&c... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n; cin>>n;
vector<int> a(n);
for(auto& i:a) cin>>i;
unordered_map<int,int> m;
for(auto& i:a){ ++m[i]; if(m[i]>1){ cout<<"NO"; return 0;}}
cout<<"YES";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
set<ll> S;
for(ll i=0;i<N;i++) {
ll A;
cin>>A;
if(S.count(A)) {
cout<<"NO"<<endl;
return 0;
}
S.insert(A);
}
cout<<"YES"<<endl;
}
| 1 |
#include <iostream>
using namespace std;
int main()
{
int date[13][32];
for(int i = 1;i<=31;i++)date[1][i] = i;
for(int i = 1;i<=28;i++)date[2][i] = i+3;
for(int i = 1;i<=31;i++)date[3][i] = i+4;
for(int i = 1;i<=31;i++)date[4][i] = i;
for(int i = 1;i<=31;i++)date[5][i] = i+2;
for(int i = 1;i<=31;i++)date[6][i]... | #include <iostream>
#include <string>
using namespace std;
int main( void )
{
int days[13] = { 0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
string d[7] = { "Thursday", "Friday", "Saturday", "Sunday", "Monday", "Tuesday", "Wednesday" };
while (1)
{
int month;
int day;
cin >> month >> day;
if ( month... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
long long int P = 998244353;
int A[310] = {};
int S = 0;
for(int i = 1; i <= N; i++){
cin >> A[i];
S += A[i];
}
long long int dp[310][90010] = {}; // はじめi枚まででRがjになるようなRGBの組の個数
dp[0][0] = 1;
for(int i = 1; i <= N; i++){
f... | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (300L)
#define MAX_A (300L)
#define NUM_MOD (998244353L)
long dp0ss[MAX_N + 1][2 * MAX_N * MAX_A + 1],
dp1ss[MAX_N + 1][2 * MAX_N * MAX_A + 1];
long mod(long n, long k) { return n % k >= 0 ? n % k : n % k + k; }
int main(int argc, char *argv[]) {
// read in... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#de... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[101][101], b[101][101];
bitset<20001> f[101][101];
int main(int argc, char** argv)
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> a[i][j];
for (int i = 1;... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#defin... | 1 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) ... | #include<bits/stdc++.h>
#define tmp(x) std::cout<<"& "<<(x)<<" &\n"
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
typedef long long ll;
... | 1 |
// Author :
// Date :
// Problem:
// Solution:
// Comment:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#define pp push
#define pb push_back
#define mp make_pair
#define xx first
#define... |
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1144&lang=jp
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#defi... | 0 |
#include<bits/stdc++.h>
#define mod (long)(1e9 + 7)
using namespace std;
long dp[10000][2][100];
long solve(int curr, int tight, int sum, string &s, int d) {
if(curr == s.size()) {
return (sum == 0);
}
if(dp[curr][tight][sum] != -1) return dp[curr][tight][sum];
if(tight) {
long res = 0;
for(int i = 0; i <= ... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
using llong = long long;
llong h, w;
llong a[100][100];
llong ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)... | #include <bits/stdc++.h>
using namespace std;
long long get_rev(long long x) {
long long nx = 0;
while (x) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
long long get_rev(long long x, int len) {
long long nx = 0;
while (len--) nx = nx * 10 + x % 10, x /= 10;
return nx;
}
int cnt;
long long solve(long long d, l... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
int x;
x = 1;
for(int i = 0; i < N; i++){
if(2 * x > x + K)
x = x + K;
if(2 * x <= x + K)
x = 2 * x;
}
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
const long long INF = numeric_limits<long long>::max();
template <class T> inline bool chmin(T& a, T b) {
if (a... | 1 |
#include<bits/stdc++.h>
using namespace std;
static const int64_t mod=1000000007;
int64_t f(int64_t x,int64_t y){
if(y==0)
return 1;
else if(y%2==0)
return (f(x,y/2)*f(x,y/2))%mod;
else
return (f(x,y/2)*((x*f(x,y/2))%mod))%mod;
}
int64_t comb(int64_t x,int64_t y){
int64_t ans=1;
for(int64_t i=y;1<=i;i--... | #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 maxn=(1e5)+10;
const int mod=(1e9)... | 1 |
#include <bits/stdc++.h>
using namespace std;
// [l, r)
int cnt_w(vector<int> &csum, int l, int r) { return csum[r] - csum[l]; }
int cnt_e(vector<int> &csum, int l, int r) {
return (r - l) - (csum[r] - csum[l]);
}
int main(int argc, const char *argv[]) {
int n;
string s;
cin >> n >> s;
vector<int> csum(n ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,mn=1000000;
string s;
cin>>n>>s;
vector<int> v(n+2);
vector<int> u(n+2);
v[0]=0;u[0]=0;
for(int i=0;i<n;i++){
if(s[i]=='W'){v[i+1]=v[i]+1;}
else v[i+1]=v[i];
}
reverse(s.begin(),s.end());
for(int j=0;j<n;j++){
if(s[j]=='E'){u[j+1]... | 1 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int tmp;
int dp[100];
cin>> tmp;
do{
fill(dp,dp+100,0);
dp[0] = 1;
for (int i = 0; i<tmp;i++)
{
for(int j = 1;j < 4;j++)
dp[i+j] += ... | #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[3],k;
cin>>a[0]>>a[1]>>a[2]>>k;
sort(a,a+3);
f... | 0 |
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 998244353;
int main() {
// freopen("input.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
... | #include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#inc... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string a, b, c;
cin >> a >> b >> c;
if (a.at(a.length() - 1) == b.at(0) && b.at(b.length() - 1) == c.at(0))cout << "YES" << endl;
else cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | 1 |
#include<iostream>
#include<cstdio>
using namespace std;
class Dice_c{
private:
int me[4];
int topbot[2]; // top,bottom
public:
void Input();
void Roll(char c);
void Output();
};
int main(){
Dice_c dice;
char com;
dice.Input();
while(1){
scanf("%c",&com);
if(com=='\n')
break;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
vector<bool> app(26);
rep(i, s.size()) app[s[i] - 'a'] = true;
rep(i, 26) if(!app[i]) {
cout << string(1, i + 'a') << "\n";
... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#i... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef pair<int,int> P;
const int INF = 1e9+7;
int main(){
int r;
cin >> r;
if(r<1200){
cout << "ABC";
}else if(1200<=r&&r<2800){
cout << "ARC";
}else{
cout << "AGC... | 0 |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
int cx = M + 1, cnts = 0;
for (int i = M; i >= 1; i--) {
if (N % 2 == 0 && (cx - i) * 2 >= N && cnts == 0) { cx++; cnts = 1; }
cout << i << " " << cx << endl;... | #pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=998244353;
int main(... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define sayyes cout<<"Yes"<<endl;
#define sayno cout<<"No"<<endl;
using namespace std;
typedef long long ll;
const double PI=acos(-1);
typedef pair<int,int>P;
const int mod =1e9+7;
int main()
{
int a,b;
cin>>a>>b;
cout<<max(max(a+b,a-b),a*b);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main(){
ll A,B;
cin >> A >> B;
if(max(A+B,A*B) > A-B) cout << max(A+B,A*B) << endl;
else cout << A-B << endl;
}
| 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.