code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
#include <string>
using namespace std;
int main()
{
string S, T;
cin >> S >> T;
int len = S.length();
bool ans = false;
for (int i = 0; i < len; i++) {
int p;
for (p = 0; p < len; p++) {
if (S[p] != T[(p+i)%len]) break;
}
if (p == len) ans = true;
}
if (ans) cout ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin>>n;
ll t[n],a[n];
for(int i=0;i<n;i++){
cin>>t[i];
}
for(int j=0;j<n;j++){
cin>>a[j];
}
ll dp[n];
dp[0]=1;
if(n==1&& t[0]==a[0]){
cout<<1<<endl;
}else if(t[n-1]!=a[0]){
cout<<0<<endl;
}else{
... | 0 | 58,591,721 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,k;
cin >> n >> m >> k;
vector<int> col(n + 1);
vector<int> row(m + 1);
vector<set<int>> rem(n + 1);
vector<vector<int>> pos(m + 1);
for (int i = 1;i <= k;i++) {
int x,y;
cin >> x >> y;
col[x]++;
row[y... | #include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define ALL(r) (r).begin(),(r).end()
typedef long long int ll;
#define FOR(i,m,n) for(ll i=(ll)(m) ; i < (ll) (n) ; ++i )
#define FORN(i,m,n) for(ll i=(ll)(m-1) ; i >= (ll) (n) ; --i )
#define RUN_FAST ios::sync_with_stdio(false);
using namespace std;
v... | 0 | 61,237,717 |
#include <bits/stdc++.h>
#define N 100000
using namespace std;
int n;
int A[2000010],B[2000010];
void Csort(){
int cnt[N]={};
for(int i=0;i<n;i++) cnt[A[i]]++;
for(int i=1;i<N;i++) cnt[i]+=cnt[i-1];
for(int i=0;i<n;i++) B[cnt[A[i]]--] = A[i];
}
int main(){
cin>>n;
for(int i=0;i<n;i++) scanf("%d",&A[i]);
C... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 200005;
const int MOD = 1000000007;
vector<int> g[MAXN];
ll even,odd,isolated,tim;
int vis[MAXN];
int dfs(int a,int f){
vis[a] = f;
int ans = 0;
for(int i:g[a]){
if(vis[i] && (vis[a] - vis[i]) == 0) ans = 1;
if(!vis[i]){
int k... | 0 | 18,364,524 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> v(N);
for(int i = 0; i < N; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
for(int i = 0; i < N; i++) {
}
double ans = v.at(0);
for(int i = 1; i < N; i++) {
ans = (ans + v.at(i)) / 2;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int abcd;
cin >> abcd;
for(int i=0;i<(1<<3);i++){
int result=0;
int x=abcd;
string ans="";
for(int j=1;j<(1<<3);j*=2){
ans = to_string(x % 10)+ ans;
if(i&j){
... | 0 | 87,367,866 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,LL> PL;
const int MOD=1000000007;
int INF=100100100;
int main(){
int a,b;cin>>a>>b;
if(a%2==1 && b%2==1)cout<<"Odd"<<endl;
else cout<<"Even"<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 57,785,796 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
vector<long long> fact, fact_inv, inv;
template< typename T >
void init_combi(size_t size, const T mod) {
size += 1;
fact.resize(size);
fact_inv.resize(size);
inv.resize(size);
fact[0] = fact[1] = 1;
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll inf=1e18;
const int N=2e5+10;
int main()
{
ll n, k;
cin >> n >> k;
ll j = k;
for (int i = 1; i < n; i++)
j *= (k - 1);
cout << j << endl;
return 0;
} | 0 | 81,051,378 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
deque<char> dq;
for (int i = 0; i < S.size(); i++) {
dq.push_back(S.at(i));
}
bool b = 1;
while (!dq.empty()) {
if (dq.size()>= 5 && dq.at(0)=='d' && dq.at(1)=='r' && dq.at(2)=='e' && dq.at(3)=='a' && dq.at(4)=='m') {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int lcm(string s, string t, vector<vector<int>> dp){
int m = s.size();
int n = t.size();
int maxl = 0;
s = " " + s;
t = " " + t;
for(int i=0; i<=m; i++) dp[i][0] = 0;
for(int j=0; j<=n; j++) dp[0][j] = 0;
for(int i=1; i<... | 0 | 77,868,045 |
#include <cmath>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <vector>
#include <map>
#include<cstdio>
#include<functional>
#include <bitset>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#d... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
templ... | 0 | 42,613,958 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b){
return b ? gcd(b, a%b) : a;
}
int main(){
long long N, X; cin >> N >> X;
if(X>N/2){
X=N-X;
}
long long ans=gcd(X, N)*(N/gcd(X, N)-1)*3;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
string S;
cin >> S;
int K;
cin >> K;
int N = S.size();
int dp[105][4][2] = {};
dp[0][0][0] = 1;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 2; k++) {... | 0 | 18,155,837 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define bizarre ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define ll long long
#define ld long double
#define pi acos(-1)
#define poi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
typedef pair<double, double> P;
double arct(P x) {
double a = x.first, b = x.second;
if (a==0&&b==0) return 0;... | 0 | 73,267,232 |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
int ans[N], n, a, b;
pair <int, int> check() {
vector <int> f(n + 5, 0), g(n + 5, 0);
int c, d; c = d = 0;
for (int i = 1; i <= n; ++i) {
f[i] = g[i] = 1;
for (int j = 1; j < i; ++j) {
if (ans[i] > ans[j]) f[i] = max(f[i], f[j] + 1);
if (... | #include "bits/stdc++.h"
using ll = long long;
using namespace std;
#define debug(...) 42
const int mod = 998244353;
void solve() {
int n;
cin >> n;
vector <int> d(n), cnt(n);
for(int i = 0; i < n; i++) {
cin >> d[i];
cnt[d[i]]++;
}
bool ok = true;
ok &= d[0] == 0;
ok &= cnt[0] == 1;... | 0 | 32,476,733 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
i... | #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... | 0 | 16,090,309 |
#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define _rrep(i, n) rrepi(i, n, 0)
#define rrepi(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define rep(...) _overload3(__VA_... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int main(){
vector<int>v;
for(int i=0;i<3;i++){
int a;
cin >> a;
v.push_back(a);
}
sort(v.begin(),v.end());
for(int i=0;i<3;i++){
cout << v[i];
if(i!=2) cout << " ... | 0 | 54,923,512 |
#include <bits/stdc++.h>
#define F first
#define S second
#define _sz(x) (int)x.size()
#define pb push_back
#define error(x) cout << #x << " = " << x << endl
using namespace std ;
using ll = long long ;
using ld = long double ;
using pii = pair <int , int> ;
const int N = 1e5 + 20;
int n, m;
vector <int> g[N];
int cnt[... | #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 <numeric>
using namespace std;
#define repl(i,a,b) for(in... | 0 | 81,442,935 |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000000LL;
constexpr int inf = 1000000000;
int main() {
ll n, l,... | #include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(long long N, long long M, std::vector<std::string> A, std::vector<std::string> B){
bool ans = false;
REP(i, N - M + 1) REP(j, N - M + 1) {
... | 0 | 78,782,401 |
#include <iostream>
#include <stdio.h>
using namespace std;
typedef long long int lint;
void swap(int& a, int& b)
{
int tmp = a;
a = b;
b = tmp;
}
void answer()
{
int a, b, c;
cin >> a >> b >> c;
if (a > b) swap(a, b);
if (b > c) swap(b, c);
if (a > b) swap(a, b);
printf("%d %d %d\n", a, b, c);
}
int main()
{
... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define all(a) (a).begin(),(a).end()
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=10000000000000000;
int main(){
int n;
cin >> n;
long double ans=0;
... | 0 | 22,962,874 |
#include"bits/stdc++.h"
#define sz(a) (int)a.size()
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
int n; cin>>n; vector<int>a(n),v1(n),v2(n); for(int i=0;i<=n-1;i++){ cin>>a[i]; }
v1[0]=a[0]; v2[n-1]=a[n-1]; for(int i=1;i<=n-1;i++) v1[i]=max(a[i],v1[i-1]); for(int i=n-2;i>=0;i--... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main()
{
string s; cin>>s; ll f1=0,f2=0;
for(ll i=0;i<s.size();i++)
{
if(s[i]=='<') f1=1;
if(s[i]=='>') f2=1;
}
if(f1==0 || f2==0)
{
ll n=s.size();
cout<<(n*(n+1))/2;
... | 0 | 75,778,999 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
ll euclidean_gcd(ll a, ll b) {
while(1) {
if(a < b) swap(a, b);
if(!b) break;
a %= b;
}
return a;
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int x = c-a, y = d-b;
cou... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
double kaijyo(int n){
int k(1);
for(int i=n;i>0;i--){
k *= i;
}
return k;
}
double distance(int x[],int y[],int i,int j){
int dx = (x[i] - x[j]) ... | 0 | 97,258,738 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#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 << 60;
const int INF = 1e9 + 7;
bool Co... | 0 | 96,553,360 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vector<int>>;
using pii = pair<int,int>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
int main() {
vi p(1010);
int n,k,ans=0; cin>>n>>k;
rep(i,n)... | #include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); ++i)
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind (int n) {
par.resize(n, -1);
rank.resize(n, 1);
}
int find (int a) {
if (par[a] == -1) return a;
retu... | 0 | 13,436,580 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | #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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
using M = map<int, int>;
int main()
{
int n;
cin >> n;
int x = 0, y = 0, z = 0;
int t[n], a[n], b[n];
r... | 0 | 73,904,421 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int ans = 0;
for(int i = A; i <= B; i++){
string S = to_string(i);
if(S[0] == S[4] && S[1] == S[3]) ans++;
}
cout << ans << end... | #include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
if(x&1) ans=ans*a%MOD;
a=a*a%... | 0 | 1,836,232 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
void printvP(vector<P> ans){
int n = ans.size();
for(int i=0; i<n; ++i){
printf("%d %d\n",ans[i].first,ans[i].second);
}
}
int main(){
int n;
cin >> n;
vector<int> an(n);
for(int i=0; i<n; ++i) cin >> an[i];
sort(an.begin(),an.en... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | 0 | 5,435,537 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef vector<bool> vbool;
typedef vector<int> vint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
#define rep(i,n) for(ll i=0;i<(n;i++)
typedef long long ll;
using namespace std;
int main(void){
int A,B,C,K;
cin >> A >> B >> C >> K;
while(B<=A){
... | 0 | 41,605,645 |
#include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define ALL(x) (x).begin(), (x).end()
#define SORT(c) sort((c).begin(), (c).end())
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> ... | #include <bits/stdc++.h>
#define ll long long
#define mk make_pair
#define pb push_back
#define ff first
#define sc second
#define all(x) x.begin(), x.end();
ll gcd(ll a, ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll sum(int n){
if(n == 0){
return n;
}else{
return sum(n/10) + n%10;
}... | 0 | 22,872,090 |
#include <bits/stdc++.h>
using namespace std;
#define N 110000
int n,tot;
int head[N],nex[N<<1],to[N<<1];
int sg[N];
void add(int x,int y)
{
tot++;
nex[tot]=head[x];head[x]=tot;
to[tot]=y;
}
void dfs(int x,int y)
{
for(int i=head[x];i;i=nex[i])
if(to[i]!=y)
{
dfs(to[i],x);
sg[x]^=sg[to[i]]+1;
}
}
int ... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
using namespace std;
#define mod (1e9 + 7)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) x... | 0 | 34,947,328 |
#define _USE_MATH_DEFINES
#include <math.h>
#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <numeric>
#include <stdio.h>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
int main() {
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | 0 | 81,076,510 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <math.h>
using namespace std;
int main(){
int k,n,ans=0;
cin>>n>>k;
vector<int>a(10000);
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(a.begin(),a.end(),greater<>());
for(int i=n-1;i>n-k-1;i-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M, X;
cin >> N >> M >> X;
vector<ll> price(N);
vector<vector<ll>> book(N, vector<ll>(M));
for(ll i = 0; i < N; i++) {
cin >> price.at(i);
for(ll j = 0; j < M; j++) {
cin >> book.at(i).a... | 0 | 9,622,847 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y;
cin>>n;
x=n*800;
for(int i=1;i<=n/15;i++)
{
y++;
}
y=y*200;
cout<<x-y;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define VS vector<string>
#define VB vector<bool>
#define VP vector<pair<ll,ll>>
#define VVL vector<vector<ll>>
#define VVP vector<vector<pair<ll,ll>>>
... | 0 | 22,354,102 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll... | #include <iostream>
using namespace std;
int main(void){
for(;;){
int N, M, P;
cin >> N >> M >> P;
if(N == 0 && M == 0 && P == 0){
return 0;
}
int X[N];
for(int i = 0 ; i < N ; i++){
cin >> X[i];
}
int sum = 0;
for(int i = 0 ; i < N ; i++){
sum += 100 * X[i];
... | 0 | 93,197,095 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout)... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#define inf 1e9+7
using namespace std;
typedef long long ll;
const double pi=acos(-1);
int main(){
int n,k;
cin >> n >> k;
vector<int> h(n);
for(int i=0;i<n;i++) cin >> h[i];
vector<int> dp(n,inf);
dp[0]=0;
... | 0 | 17,902,702 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> a(n);
for(int i=0;i<n;i++)
cin>>a.at(i);
for(int _=0;_<k;_++){
vector<int> p=a;
vector<int> d(n+1,0);
for(int i=0;i<n;i++){
d.at(max(i-p.at(i),0))++;
d.at(min(i+p.at(i)+1,n))--;
}
a.at(... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) /... | 0 | 39,771,494 |
#include <bits/stdc++.h>
#include <string>
#include <cmath>
using namespace std;
int main(){
string s, ss;
cin >> s >> ss;
int t = s.size();
int ts = ss.size();
string ans ="Yes";
if( t != ts - 1) ans = "No";
for (int i = 0; i < t; i++){
if (s.at(i) != ss.at(i)) ans = "No";
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
string s, t; cin >> s >> t;
int ans = 99999;
for (int i = 0; i + t.size() <= s.size(); i++) {
int tr = 0;
for (int j = 0; j < t.size(); j++) {
if ... | 0 | 79,235,664 |
#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 n;
cin >> n;
vector<int> a(n+1);
rep(i, n+1) cin >> a[i];
vector<ll> cum(n+1);
cum[n] = a[n];
for (int i = n-1; i >= 0; i--) {
cum[i] = a[i] + cu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 54,725,942 |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
int numbers[3];
for (int i = 0; i < 3; ++i)
{
cin >> numbers[i];
}
sort(numbers, numbers + 3);
printf("%d %d %d\n", numbers[0], numbers[1], numbers[2]);
return 0;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 64,960,284 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
vec... | #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... | 0 | 59,210,861 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
int main(){
int n,k;
cin >> n >> k;
vector<int> a(n);
for(int i=0; i<n; i++)
cin >> a[i];
for(int x=0; x<k; x++){
vector<int> b(n+1);
for(int i=0; i<n; i++){
int l=max(0,i-a[i]);
int r=min(i+a[i]+1,n... | #include <bits/stdc++.h>
#define double long double
using namespace std;
const int N = 100010;
const int INF = 1LL<<55;
const int mod = (1e9)+7;
const double EPS = 1e-8;
const double PI = 6.0 * asin(0.5);
typedef pair<int,int> P;
typedef long long ll;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class... | 0 | 43,359,985 |
#include<bits/stdc++.h>
using namespace std;
#define pf printf
#define PF(a) printf("%d\n",(a))
#define PF2(a,b) printf("%d %d\n",(a), (b))
#define PF3(a,b,c) printf("%d %d %d\n",(a), (b), (c))
#define PFL(a) printf("%lld\n",(a))
#define PFL2(a,b) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 4,927,045 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
constexpr ll infl = 10000000000000007LL;
constexpr int inf =... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 0 | 25,603,433 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <queue>
#include <deque>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <random>
#include <ctime>
#include <utility>
#include <fstream>
#pr... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#define eps 0.00000001
#d... | 0 | 26,986,435 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
scanf("%d%d%d", &A, &B, &C);
cout << max({A,B,C})-min({A,B,C}) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = int... | 0 | 54,674,498 |
#include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(),x.end()
#define cmin(a,b) (a>b?a=b:a)
#define cmax(a,b) (a<b?a=b:a)
#define mem(a,k) memset(a,k,sizeof(a))
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
#define fore(i... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n;
cin >> n;
vector<int> b(n - 1);
rep(i, n - 1) cin >> b.at(i);
vector<int> a(n);
a.at(0) = b.at(0);
rep... | 0 | 97,987,496 |
#include <iostream>
int main(){
int N, M, A;
std::cin >> N >> M;
int sum = 0;
for(int i=0; i<M; ++i) {
std::cin >> A;
sum += A;
}
std::cout << (sum <= N ? N - sum : -1) << std::endl;
return 0;
} | #include <iostream>
#include <string>
using std::string;
int main()
{
while (true) {
string in;
std::cin >> in;
if (in == "-") {
break;
}
int shuffle_num;
std::cin >> shuffle_num;
int head = 0;
while (shuffle_num--) {
int cards_... | 0 | 74,454,298 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
while(cin >> N >> M, N || M){
int D[10001] = {0}, P[10001] = {0};
long long sum = 0;
for(int i = 0; i < N; i++) cin >> D[i] >> P[i], sum += D[i]*P[i];
while(M > 0){
int idx = max_element(P, P + N) - P;
if(P[idx] == -1)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 0 | 96,060,852 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
ll sum = 0;
ll m = 1e10;
bool flag = true;
for(int i = 0; i < n; i++)
{
ll a, b;
cin >> a >> b;
sum += a;
if(a > b)
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long l... | 0 | 3,826,335 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <iomanip>
#include <cassert>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
while(true){
string s;
getline(cin, s);
i... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long n;
cin>>n;
int minimum=100;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
long long a=i;
long long b=n/a;
int cnt1=0;
int cnt2=0;
while(a>0){
cnt1++;
a/=10;
}
while(b>0){
cnt2++;
b/=1... | 0 | 54,043,886 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t a,b,c,ans,cou;
cin>>a>>b>>c;
cou=0;
vector<vector<char>> data(a, vector<char>(b));
for(int64_t i=0;i<a;i++){
for(int64_t j=0;j<b;j++){
cin>>data.at(i).at(j);
}
}
for(int64_t i=0;i<pow(2,a);i++){
for(int64_t j=0;j<pow(2,b);j++){
int64_t... | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
double x[4],y[4];
for(int j=0;j<4;j++)
cin>>x[j]>>y[j];
if(abs((x[3]-x[2])*(y[1]-y[0])-(x[1]-x[0])*(y[3]-y[2]))<1e-10)
cout<<"YES"<<endl;
else
... | 0 | 62,242,991 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
long long N;
cin >> N;
if(N % 2 == 1){
cout << 0 << endl;
return 0;
}
N /= 2;
long long cnt = 0;
long long t = 5;
while(N >= t){
cnt += N / t;
t *= 5;
}
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define mx 100035
int a[mx],n,l,t,x,cnt;
int main(){
scanf("%d%d%d",&n,&l,&t);
for (int i=1; i<=n; i++){
scanf("%d%d",&a[i],&x);
if(x==1)
a[i]+=t;
else
a[i]-=t;
cnt += a[i]/l;
if(a[i]%l<0) cnt--;
a[i]=((a[i]%l)+l)%l;
... | 0 | 45,427,970 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct card{
char c;
int num;
};
template<typename T>
void bsort( typename vector<T>::iterator itr_first, typename vector<T>::iterator itr_last){
for(int i=0; i < itr_last - itr_first; ++i){
for(auto itr=itr_last-1;itr!=it... | #include <iostream>
#include <vector>
using namespace std;
void set_right(vector<vector<int>>& P, uint xBase) {
if (xBase >= P[0].size()) return;
for (uint x=xBase; x<P[0].size(); ++x) {
for (uint y=0; y<P.size(); ++y) {
P[y][x] = 0;
}
}
};
void set_left(vector<vector<int>>& P, u... | 0 | 42,752,755 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
int main() {
int N, M, ... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | 0 | 55,694,022 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,m;
cin>>n>>m;
vector<string>p(m);
vector<string>s(m);
for(long long i=0;i<m;i++){
cin>>p[i]>>s[i];
}
long long cnt=0;
long long cnt2=0;
map<string,int>mp;
map<string,int>mp2;
for(long long i=0;i<m;i++){
if(s[i]=="AC"&&m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> s(n);
for(int i=0; i<n; i++) cin >> s[i];
for(int i=0; i<n; i++) {
if(i >= 1 && s[i][0] != s[i-1][s[i-1].size()-1]) {
cout << "No" << endl;
return 0;
}
if(count... | 0 | 43,906,276 |
#include<iostream>
using namespace std;
int main() {
string s;
int i;
cin >> s;
int num = 0;
char a[10];
for (i = 0; i < s.length(); i++) {
if (s[i] == '0' || s[i] == '1') {
a[num] = s[i];
num++;
}
else {
if (num > 0)num--;
}
}
for (i = 0; i < num; i++) {
cout << a[i];
}
cout << endl;
retu... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define debug freopen("in.txt","r",stdin),freopen("out.txt","w",stdout);
#define pb push_back
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using namespace std;
typedef long long ll;
t... | 0 | 21,502,564 |
#include<bits/stdc++.h>
#define mx 1000000007
#define ll long long int
using namespace std;
int n;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>> n;
int arr[n+1];
for(int i=1;i<=n;++i)
cin>> arr[i] ;
int dp[n+1]={0};
dp[n-1]=abs(arr[n-1]-arr[n]);
for(int i=n-2;i>... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;
int main() {
Int n;
cin >> n;
map<Int, Int> mp;
for (Int i = 2; i <= n; i++) {
... | 0 | 30,527,296 |
#include <iostream>
#include <vector>
#include <deque>
#include <cmath>
#include <map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include "iomanip"
using namespace std;
#include <cstdio>
#include <cstring>
int main() {
int n, m, count = 0, res = 0;
cin >> n >> m;
for (int i = 1; i <= n ; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 0 | 49,236,332 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
int main() {
int a=100000,n;
cin>>n;
while(n-->0){
a*=1.05;
a=(a+999)/1000;
a*=1000;
}
cout<<a<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a) for(i = 0 ; i < a ; i++)
#define whln(t) while(t--)
#define whlp(t) while(t++)
ll i=0,j=0;
int main(void){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s,t,u;
... | 0 | 53,905,310 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
string s;
cin >> s;
string ans="Yes";
for(int i=0;i<s.size();i++){
if(((i==a)+(s.at(i)=='-'))%2){
ans="No";
}
}
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
int a[200010], b[200010];
int main(int argc, char const *argv[])
{
int n;
scanf("%d", &n);
long long P = 0, Q = 0;
long long X = 0, Y = 0;
int cnt = 0;
bool good = true;
for(int i = 1; i <= n; i++) {
scanf("%d %d", &a... | 0 | 20,096,651 |
#include <stack>
#include <utility>
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <functional>
#include <cstdio>
using namespace std;
int main()
{
int n;
typedef pair <int, int> p;
while (cin >> n, n != 0) {
vector <p> map[12];
int a, b, c;
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
int main(){
ll N;
cin >> N;
string S;
cin >> S;
ll Lcounter=0;
ll Rcounter=0;
for(ll i=0;i<N;i++){
if(S[i]=='('... | 0 | 9,918,584 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VE... | #include <bits/stdc++.h>
using namespace std ;
int main()
{
long long n , k ;
vector <long long> v ;
cin >> n >> k ;
long long temp ;
for(int i = 0 ; i < n ; i++)
{
cin >> temp ;
v.push_back(temp) ;
}
sort(v.begin(), v.end(), greater <int>() ) ;
if(k >= n)
{
... | 0 | 45,657,633 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s ;
int k;
cin>>k>>s;
for (int i=0;i<min((int)s.size(),k);i++){
cout<<s[i];
}
if (s.size()>k){
cout<<"...";
}
return 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 REP(i, n) for(int i = 0; i < (int)(n); i++)
static const int fast_io = [](){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);return 0;}();
static const int p... | 0 | 73,918,672 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false) ;
cin.tie(NULL) ;
int n = 0 ;
cin >> n ;
vector<int> height(n+1), cost(n+1) ;
for(int i = 1 ; i <= n ; i++)
cin >> height[i] ;
cost[1] = 0 , cost[2] = abs(height[2]-height[1]) ;
for(int i... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 2e5 + 5;
int par[maxN], siz[maxN];
void init() {
for (int i = 0; i < maxN; ++i) {
par[i] = i, siz[i] = 1;
}
}
int find(int x) {
return par[x] == x ? x : par[x] = find(par[x]);
}
bool same(int x, int y) {
return find(x) == find(y);
}
void uni... | 0 | 19,609,280 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define P pair<ll,ll>
#define Graph vector<vector<P>>
#define fi first
#define se second
constexpr ll mod=1000000007;
constexpr ll INF=(1ll<<60);
constexpr double pi=3.14159265358979323846;
template<typename T> inline... | 0 | 92,677,240 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main(){
ll n; cin >> n;
ll ans = 0;
for(ll i = 1; i <= n; i++){
ll a = n / i, b = n % i;
if(a > b) continue;
i += b / a;
if(b % a == 0) ans += i - 1;
}... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } re... | 0 | 34,480,510 |
#include<cstdio>
#include<cctype>
using namespace std;
int main(){
char ch;
while (1) {
scanf("%c", &ch);
if (ch == '\n' ) break;
if (isalpha(ch)) {
if (isupper(ch)) ch = tolower(ch);
else if (islower(ch)) ch = toupper(ch);
}
printf("%c", ch);
}
printf("\n");
return 0;
} | #include <cstdio>
#define int long long
#define dotimes(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int rint() {
int n;
scanf("%lld", &n);
return n;
}
void wint(int n) {
printf("%lld\n", n);
}
int euclid(int a, int b, int& x, int& y) {
if (a < b) {
int d = euclid(b, a, x, y);
int t = x;
... | 0 | 41,236,831 |
#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <climits>
using namespace std;
#define MOD1097 1000000007
#define ll long long
#define pint pair<int, int>
#define pll pair<ll, ll>
#define pb push_bac... | #include <bits/stdc++.h>
using namespace std;
#define Vi vector<int>
#define FOR(i,s,e) for (int i=s; i<e; i++)
#define ITER(v) v.begin(), v.end()
constexpr int N_MAX = 100;
int adj_matrix[N_MAX+1][N_MAX+1];
array<int,N_MAX+1> depth;
int n;
void bfs(queue<int>& q, const int d) {
if (q.empty()) { return; }
queue... | 0 | 60,997,732 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int num[3];scanf("%d %d %d",&num[0],&num[1],&num[2]);
sort(num,num+3);
int ans=num[2]-num[1];
num[0]=num[0]+num[2]-num[1];
num[1]=num[2];
if((num[2]-num[0])%2==0)ans+=((num[2]-num[0])/2);
else ans+=((num[2]-num[0]+1)/2+1);
printf("%d",ans);
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long int ull;
#define endl "\n"
#define pb push_back
#define sq(a) (a)*(a)
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#... | 0 | 47,376,931 |
#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> P;
#define REP(i, x, n) for(int i = x ; i < n ; ++i)
#define rep(i, n) for(int i = 0 ; i < n ; ++i)
#define repr(i, n) for(int i = n - 1 ; i >= 0 ; --i)
#define ALL(x) (x).begin(), (x).end()
#define SORT(x) sort((x).begin(), (x)... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
vector<int> t(N+2, 0), v(N+2, 0);
for(int i = 1; i <= N; i++) cin >> t[i];
for(int i = 1; i <= N; i++) cin >> v[i];
vector<int> l(N+2, 0), r(N+2, 0);
for(int i = 2; i < N+2; i++) l[i] = l[i-1] + t[i-1];
for(int i... | 0 | 49,755,650 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000009
const long long INF = 1LL<<60;
int main() {
string s;
cin>>s;
ll n=s.length();
vector<ll> cnt(26,0);
rep(i,n) cnt[s[i]-'a']++;
... | #include <iostream>
#include <vector>
using namespace std;
int N;
vector<vector<int>> G;
int dfs(int s, int par){
int ret = 0;
for(int t : G[s]){
if(t == par) continue;
ret ^= 1+dfs(t, s);
}
return ret;
}
int main(){
cin >> N;
G.resize(N);
for(int i=0; i<N-1; i++){
in... | 0 | 46,434,874 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep1(i,n) for(int i = 1; i < n; i++)
#define repv(i,n) for(int i = n-1; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
using namespace std;
typedef long long ll;
char BUF[3500000];
inline void I(int&a){scanf("%d",&a);}
in... | #include <iostream>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <utility>
#include <queue>
#include <cmath>
#define BEGIN(x) x.begin()... | 0 | 66,459,449 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int q,w;
cin>>q;
string a;
cin>>a;
int s=a.size();
if(s<=q) cout<<a;
else
{
for(w=0;w<q;w++)
cout<<a[w];
cout<<"...";
}
} | #ifdef _MSC_VER
#include <__msvc_all_public_headers.hpp>
#undef min
#undef max
#else
#define NDEBUG
#include <bits/stdc++.h>
#endif
using namespace std;
using large = long long;
int main()
{
int t[5];
for (auto& ti : t)
cin >> ti;
auto total = 0;
for (auto ti : t)
total += (ti + 9) / 10 ... | 0 | 43,182,226 |
#include <iostream>
using namespace std;
int main() {
int n, y, m, d;
cin>>n;
while(n--) {
cin>>y>>m>>d; m--,d--;
int ans = 0;
while(true) {
if (y == 1000 && m == 0 && d == 0) break;
ans++; d++;
if ((d == 19 && m%2==1 && y%3 != 0) || d == 20) {
m++, d = 0;
}
if (m... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i = 0; i < n; i++)
#define rep2(i,x,n) for (int i = x; i < n; i++)
using ll = long long int;
int main() {
int x,n; cin >> x >> n;
if(n==0) cout << x << endl;
else {
vector<int> A(102,0);
rep(i,n) {
... | 0 | 45,387,784 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#define _USE_MATH_DEFINES
#include<math.h>
#include<map>
#define SENTINEL 1000000001
#define min(a,b) (a)>(b)?(b)... | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
#define int ll
typedef vector<char> vc;
typedef vector <vc> vvc;
typedef vector <vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef ... | 0 | 77,843,824 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
int main(int argc, char **argv)
{
string s; cin >> s;
deque<char> d;
for (auto &e : s)
d.push_back(e);
ll res{0};
while (d.size() > 1)
{
char f = d.front();
char b = d.back();
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, b, c, d, f;
c = 0, d = 0, f = 0;
cin >> N >> M;
vector<vector<char>> a(N, vector<char>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> a.at(i).at(j);
}
}
for (int i = 0; i < N; i++) {
b = 0;
... | 0 | 65,247,254 |
#include <bits/stdc++.h>
using namespace std;
void solve(long long L){
double element = (double)L / 3;
double ans = element * element * element;
cout << fixed << setprecision(12) << ans << endl;
return;
}
int main(){
long long L;
scanf("%lld",&L);
solve(L);
return 0;
} | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 0 | 95,862,446 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int n,minimum,tmp;
scanf("%d",&n);
int table[n][n];
int data[n][2];
for(int i=0;i<n;i++){
for(int k=0;k<n;k++)table[i][k] = 0;
scanf("%d %d",&data[i][0],&data[i][1]);
}
for(int i=n-2;i>=0;i--){
for(int k=0;k<=i;k++){
if(i==n-2){
... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <memory>
#include <cstring>
#include <cassert>
#include <numeric>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cctype>
#include <unordered_map>
#inclu... | 0 | 6,411,012 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
if(a<=16 && b<=16 && (a+b)<=16){
if(a==b || a==(b+1) || b==(a+1)){
cout << "Yay!" << endl;
}
else{
cout << ":(" << endl;
}
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define pragi(a,b) for(ll i = a;i<b;i++)
#define pragj(a,b) for(ll j = a;j<b;j++)
#define pragk(a,b) for(ll k = a;k>=b;k--)
#define all(v) (v.begin(),v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#define MT make_tuple... | 0 | 89,298,809 |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
int main(){
double a, b ,C;
cin >>a >> b >>C;
double C_r = C * M_PI /180;
double c = pow( (pow(a,2)+pow(b,2)-(2.0*a*b*cos(C_r))),0.5);
double S = (a * b * sin(C_r)) /2;
double L = a + b + c;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num;
int bin;
cin >> num >> bin;
map<int, int> m;
for (int i = 0; i < bin; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
if (tmp1 == 1) {
m[tmp2]++;
} else if (tmp2 == num) {
m[tmp1]+... | 0 | 75,905,077 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define int long long
int N;
void factor(map<int,int> &m, int num... | #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; string s,t;
cin>>n>>s>>t;
if(s==t){cout<<n<<endl; return 0;}
else{
int ans=n;
rep(i,n){
if(s==t){
break;
}
e... | 0 | 17,490,054 |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef deque<ll> dl;
typedef stack<ll> stl;
type... | #include <bits/stdc++.h>
int64_t mem[45][45];
int64_t V;
int64_t dp(int64_t N, int64_t v) {
if (N == 0) return 0;
if (mem[N][v] != -1) return mem[N][v];
int64_t best = -2;
for (int64_t i = v + 1; i <= N; ++i) {
if (dp(N - i, i) == -2) continue;
best = std::max(dp(N - i, i) + 1, best);
}
mem[N][v] = ... | 0 | 45,556,627 |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using P = pair<int,int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b){return b!=0 ? gcd(b, a%b) : a;}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
int main()... | 0 | 53,429,574 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<stack>
#include<queue>
using namespace std;
typedef long long ll;
ll h,w,ma,mi,ans;
ll S1,S2,S3;
ll read(){ ll s=0,f=1; char ch=getchar(); while(ch<'0' || ch>'9'){ if(ch=='-') f=-1; ch=getchar(); } while(ch>='0' && ch<='... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <cmath>
#include <complex>
#include <cassert>
#define rep(i, x) for (int i = 0; i < (x); ++i)
#def... | 0 | 45,645,260 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int a[MAXN];
int dp_old[MAXN], dp[MAXN], sums[MAXN];
int n, k;
const int MOD = 1e9 + 7;
inline int get_sum(int start, int end){
if(start == 0)
return sums[end];
int ans = sums[end] - sums[start - 1];
if(ans < 0){
ans +=... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++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 irep(i, m, n) for (int i = (... | 0 | 28,435,320 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
vector<int> to[10];
in... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>
template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
if (lhs ... | 0 | 7,737,493 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <stdlib.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define max 100001
struct node {int p,l,r;};
struct node t[max];
int d[max];
void getdepth(int i,int j){
d[i]=j;
if(t[i].r!=-1)getdepth(t[i].r,j);
if(t[i].l!=-... | #include <bits/stdc++.h>
using namespace std;
string Y = "Possible";
string N = "Impossible";
int a[110];
int cnt[110] = {};
int main(){
int n;
cin >> n;
for(int i = 0;i < n;i++){
cin >> a[i];
cnt[a[i]]++;
}
sort(a, a+n);
if(a[n-1] % 2 == 0){
int c = 0;
for(int i ... | 0 | 25,337,272 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll n;cin>>n;
vector<ll>a(n);
vector<ll>b(n);
for (int i = 0; i < n; ++i) {
... | 0 | 81,073,203 |
#include <stdio.h>
void aaa(int, int, int, int);
int a0[10][3]={{0}} ,a1[10][3]={{0}}, a2[10][3]={{0}}, a3[10][3]={{0}};
void aaa(int b, int f, int r, int v)
{
if (b==1)
{
a0[r-1][f-1]=a0[r-1][f-1]+v;
}
else if (b==2)
{
a1[r-1][f-1]=a1[r-1][f-1]+v;
}
else if (b==3)
{
a2[r-1][f-1]=a2[r-1][f-1]+v;
}
else ... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
typedef priority_queue<... | 0 | 100,875,800 |
#include<bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<map>
#include<string>
#include<vector>
#define mx(ans, cnt) ans = max(ans, cnt)
#define fauto(a) for(auto i : a) cout << i << " "; cout << endl;
#define sp(n) fixed << setprecision(n)
#define all(v) v.begin(), v.en... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n, c, k = 0, s = 0;
cin >> n >> c;
int a[n], b[n];
for(int i = 0; i < c; i++){
cin >> a[i];
}
for(int i = 0; i < c; i++){
if(i < c - 1){
b[i] = a[i + 1] - a[i];
if(s < b[i]){
s = b[i];
}
}
... | 0 | 52,188,416 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int H, W;
cin >> H >> W;
vector<string> C(H);
for (int i = 0; i < H; ++i) {
cin >> C.at(i);
cout << C.at(i) << endl;
cout << C.at(i) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b+a); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using... | 0 | 53,917,106 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ff first
#define ss second
#define MP make_pair
#define mset(x,a) memset(x,a,sizeof(x))
#define max3(x,y,z) max(x,max(y,z))
#define min3(x,y,z) min(x,min(y,z))
#define sqr(a) (a)*(a)
#define all(x) (x).begin(), (x).e... | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 75,389,642 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
string b; cin >> b;
for (int i = 0; i < b.size(); ++i) {
if (b[i] == 'A') cout << 'T';
if (b[i] == 'T') cout << 'A';
if (b[i] == 'C') cout << 'G';
if (b[i] == 'G') cout <<... | #include<bits/stdc++.h>
int_fast64_t n, a[100001], l, r, mid, x, i, t1, t2;
int main(){
scanf("%ld", &n);
for(i=0; i<n; i++) scanf("%ld", &a[i]);
l = 0;
r = 1e18;
while(r-l>1){
mid = x = (r-l)/2+l;
for(i=0; i<n; i++) x -= x%a[i];
if... | 0 | 19,990,864 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string a,b,c;
cin >> a >> b >> c;
int d = a.size() - 1;
int e = b.size() - 1;
int f = c.size() - 1;
if(a.at(d) == b.at(0)) {
if(b.at(e) == c.at(0)) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
else {
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
static const int MAX_N = 1ll<<17;
typedef pair<int,int> PII;
int dat[2*MAX_N-1];
class Segment{
public :
int n;
void inti(int n_){
n=1;
while(n<n_)n*=2;
for(int i=0;i<2*n-1;++i)dat[i]=-INT_MAX;
... | 0 | 1,024,798 |
#include<cstdio>
using namespace std;
int n,m,dis;
char str[5]="BGRY";
int main(){
scanf("%d%d%d",&n,&m,&dis);
if (dis&1){
for (int i=0;i<n;i++){
for (int j=0;j<m;j++) printf("%c",str[i+j&1]);
printf("\n");
}
}
else{
for (int i=0;i<n;i++){
for (int j=0;j<m;j++) printf("%c",str[((i+j)/dis&1)+((i-j+100... | #ifdef _DEBUG
#include ".vscode/debug_print.hpp"
#else
#define debug(...)
#endif
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
constexpr int INF32 = 1050000000;
constexpr long long INF64 = 4000000000000000000;
constexpr int MOD7 = 1000000007;
constexpr int MOD5... | 0 | 85,109,383 |
#include <vector>
#include <list>
#include <map>
#include <unordered_set>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <set>
#include <iostream>
#define MAXX (1ll<<61)
#define MAX_CARRY 10... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9+7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[... | 0 | 85,025,116 |
#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 x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x);
vector<ll> b(y);
vector<ll> c(z);
rep(i,x) cin >> a[i];
rep(i,y) cin >> b[i];
rep(i,z) cin >> c[i];
so... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <assert.h>
#include <numeric>
#include <math.h>
#include <climits>
#include <stack>
#include <iomanip>
#include <sstream>
using namespace std;
template <typename T>
inline bool sign(T A) {
return (A>0)... | 0 | 32,100,220 |
#include<bits/stdc++.h>
using namespace std;
const int MAX = 2 * 1000 * 100 + 11;
int parent[MAX];
int sizeOfSet[MAX];
int n, m;
void make_set(int node) {
parent[node] = node;
sizeOfSet[node] = 1;
}
int find_set(int node) {
if(node == parent[node]) {
return node;
}
return parent[node] = find_set(parent[node]);
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int H,W;
cin >> H >> W;
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int dist[H][W];
char A[H][W];
queue<P> que;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++... | 0 | 14,564,626 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i=0; i < (ll)(n); i++)
int main(void){
ll n;
cin>>n;
ll ans=0;
for(ll i=1;i<=n;i++){
ll p=n/i;
ans+=i*(1+p)*p/2;
}
cout<<ans<<endl;
} | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
... | 0 | 71,379,263 |
#include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | #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;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define reps(i, f, n) for (ll i = (f)... | 0 | 66,242,885 |
#include<iostream>
using namespace std;
int main(){
while(1){
int n, k;
cin>> n>> k;
if(n==0&&k==0) break;
int a[n];
for(int i=0; i<n; i++){
scanf("%d", &a[i]);
}
long long s[n+1]={0};
for(int i=0; i<n; i++){
s[i+1]=s[i]+a[i];
... | #include <iostream>
#include <queue>
using namespace std;
int main(){
int N,A,B,C,X;
while(cin>>N>>A>>B>>C>>X,N||A||B||C||X){
queue<int> lists;
for(int i=0;i<N;i++){
int a;
cin>>a;
lists.push(a);
}
int ans=-1;
for(int i=0;i<10001;i++){
int t=lists.front();
... | 0 | 44,190,993 |
#include <iostream>
using namespace std;
#define ll long long
void solve(){
ll a,b;
scanf("%lld",&a);
b=360;
while(b%a != 0)
b+=360;
printf("%lld",b/a);
}
int main()
{
int t=1;
while (t--) solve();
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
#define rep2(i,a,n) for (int i = a; i < n; i++)
using namespace std;
int X, Y;
long long res;
const int MAX = 2 * pow(10, 6) + 10;
const int MOD = pow(10, 9) + 7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
... | 0 | 99,038,270 |
#include <iostream>
using namespace std;
int main()
{
string s;
cin>>s;
int n=s.length(),sum=0;
if(s[0]=='A' && s[1]>='a' && s[1]<='z' && s[n-1]>='a' && s[n-1]<='z'){
for(int i=2;i<n-1;i++){
if(s[i]!='C' && s[i]>='A' && s[i]<='Z')
break;
if(s[i]=='C')sum++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<bool>ac(n + 1,false);
vector<int>wa(n + 1,0);
int pc = 0,sc = 0;
for(int i = 0;i < m;i++){
int p;
string s;
cin >> p >> s;
if(!ac[p]){
if(s == "AC"){
... | 0 | 21,936,739 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define F first
#define S second
#define umap unordered_map
#define uset unordered_set
#define test ll cases; cin>>cases; for(ll testCase = 1; testCase <= cases; testCase++)
#define fill(name, val) memset(name, val, sizeof(name));
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define m0(x) memset(x, 0, sizeof(x))
#define all(x) x.begin(), x.end()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define asort(x) sort(all(x));
#define dsort(x, t) sort(x.begin(), x.end(), greater<t>());
#define UNIQUE(v... | 0 | 20,911,347 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.