code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = (0); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define DEBUG(val) cout << #val << " : " << val << endl
#define MOD 1000000007
int main() {
int k, t;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000001
//A=65,a=97
int main() {
int k,t;cin >> k >> t;
vector<int> a(t);for(int i=0;i<t;i++) cin >> a[i];
sort(a.begin(),a.end());
if(a[t-1]<=(k+1)/2){
cout << 0 << endl;
return ... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <map>
#include <stdio.h>
#include <cstring> //memset(dp,0,sizeof(dp))
#include <functional>
#define ll long long
#define rep(i,n) fo... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#inclu... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1... | #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 (i... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int n, m, x, y, t;
int main() {
... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;cin>>s;
auto pos = s.find("AC");
if(pos!=string::npos){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 0 |
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n,q[40003];
long long ans,c[50];
int main(){
cin>>n;
char _a;
for(int i=1,_n=n+1;i<_n;i++){
cin>>_a;
switch(_a){
case 'R':
q[i]=1;
break;
case 'G':
q[i]=2;
... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll MOD = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int N, M;
vector<int> A, B;
long long solve()
{
ll res = 1... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string S; cin >> S;
int ok=0;
for (int i=0;i+1<S.size();++i)
if (S[i]=='A'&&S[i+1]=='C') ok=1;
cout << (ok?"Yes":"No") << '\n';
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int INF = 1e9;
int main(){
string s;cin >>s;
stack<char> st;
st.push(s[0]);
rep(i,s.size()-1){
char ch = '.';
... | 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
#include <functional>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int X = A + B, Y = C + D;
if (X > Y) cout << "Left" << endl;
else if (X == Y) cout << "Balanced" << endl;
else if (X < Y) cout << "Right" << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
char s[100];
int main(){
scanf("%s", s+1);
if(strlen(s+1) == 3) reverse(s+1, s+1+strlen(s+1));
printf("%s", s+1);
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9 + 7;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
cout << s << endl;
return 0;
}
reverse(s.begin(),s.end());
cout << s << endl;
return 0;
}
| 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
bool dfs(char board[8][8], bool v_used[], bool h_used[], bool dr_used[], bool dl_used[], int x, int y, int num) {
if (num == 8) return true;
for (int i = 0; i < 8; i++) {
if (h_used[i]) continue;
for (int j... | #include <iostream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;
int lr[4]={1, 0, -1, 0};
int ud[4]={0, 1, 0, -1};
int main() {
int H, W;
cin >> H >> W;
vector<vector<int> > A(H, vector<int>(W));
for(int h=0; h<H; h++) {
for(int w=0; w<W; w++) {
cin >... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string.h>
using namespace std;
char str[1000000];
int main() {
int ans, k, len, J, O, I;
int a;
//string str;
while(scanf("%s", str) != EOF) {
len = strlen(str);
J=0, O=0, I=0;
ans=0, k=0;
//cout << len << endl;
for(int i ... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s;
int flag = -1, ans = 0;
int J = 0, O = 0, I = 0;
cin >> s;
for(int i=0; i<s.size(); i++) {
if( flag <= 0 && s[i] == 'J' ) {
flag = 0;
J++;
}
else if( flag == 0 && s[i] == 'O' ) {
flag = 1; O++;
}
else ... | 1 |
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int n, m, in[1001], data[1002001];
main(){
while(scanf("%d %d", &n, &m) && (n|m)){
in[0] = 0;
for(int i=1;i<=n;i++) scanf("%d", &in[i]);
for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) data[i*(n+1)+j] = in[i] + in[j];
int s... | #include<iostream>
#include<vector>
#include<map>
#include<utility>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<stdlib.h>
#include<stdio.h>
#include<cmath>
#include<cstdlib>
#include<typeinfo>
#include<sstream>
#include<list>
#include<set>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#de... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <boost/tokenizer.hpp>
#include <boost/lexical_cast.hpp>
#include <vector>
#include <list>
using namespace std;
using namespace boost;
int main(int argc, char* argv[])
{
using sprtr = char_separator<char>;
using tknzr = tokenizer... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
int n, m;
int p[1010];
int main()
{
while (cin >> n >> m, n){
rep(i, n) cin >> p[i];
sort(p, p + n, greater<int>());
int res = 0;
rep(i, n) res += p[i... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define PB push_back
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define ar array
... | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
const int MOD = 1000000007;
using namespace std;
void solve(void)
{
ll n;
cin >> n;
n *= 2;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i <... | 0 |
// 去吧！皮卡丘! 把AC带回来！
// へ ／|
// /＼7 ∠＿/
// / │ ／ ／ AC AC AC AC
// │ Z ＿,＜ ／ /`ヽ AC AC AC AC
// │ ヽ / 〉 AC AC AC AC
// Y ` / / / AC AC AC AC
// 亻● . ● 〈 / / AC AC AC AC
// () へ | ＼〈 AC AC AC AC
// >- ._ ィ │ ／／ AC A... | #include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
const int mod = 998244353;
int n;
int m;
int k;
long long inv[N];
long long fac[N];
long long finv[N];
void cominit(){
fac[0] = fac[1] =1;
finv[0] = finv[1] =1;
inv[1] = 1;
for(int i = 2; i < N; i++){
fac[i] = fac[i - 1] * ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,l;
cin >> n >> l;
int a[n];
int all = 0;
for(int i = 1; i <= n; i++){
a[i] = l + i - 1;
all += a[i];
}
int minu = 0,maxmin = 2000000;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(j != i){
mi... | /*16D8103008D 西村 悠輝 ALDS10C*/
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string X, Y;
int v[1001][1001];
int dp(string X, string Y) {
int n = X.size();
int m = Y.size();
for (int i = 0; i <= n; i++) {
v[i][0] = i; ///０のテーブル
for (int j = 0; j <= m; j++) {
v[0]... | 0 |
#include <bits/stdc++.h>
/// ____ ____ ____ ____ ____
/// ||a |||t |||o |||d |||o ||
/// ||__|||__|||__|||__|||__||
/// |/__\|/__\|/__\|/__\|/__\|
///
using namespace std;
const int N_MAX = 302;
const int M_MAX = 302;
int n, m;
int a[N_MAX][M_MAX];
bool del[N_MAX];
int pos[N_MAX];
int cnt[M_MAX];
queu... | #include <cstdio> // printf(), scanf()
#include <vector>
#include <algorithm> // sort()
using namespace std;
static const int MAX_E = 100000;
class disjointSet
{
public:
vector<int> rank;
vector<int> par;
disjointSet() {}
disjointSet(int size)
{
rank.resize(size, 0);
par.resize(size, 0);
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
const ll MOD = 1000000007;
const int inf = 1e9 + 10;
const ll INF = 4e18 + 10;
const int dx[9] = {1, 0, -1, 0, 1, -1, -... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 105
#define INF 1000000000
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef pair<int,int> P;
const int MAX = 100005;
const i... | 1 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
return 0;
}
int A, B;
cin >> A >> B;
cout << A + B << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
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; } return 0; }
ll mod= 1e9 + 7;
... | 1 |
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const ll INF=1e+17;
const int MOD=1e+9+7;
//REPマクロ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
//v... | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
const int N=3e5+2;
ll M=1e9+7;
ll a[N];
int main()
{
ft
ll i,j,n,s=0,l,r,m;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
for(i=0,m=1;i<61;i++,m*=2)
{
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t ans=1;
int m,j,k,y,mod=1e9+7;
bool f;
cin>>m;
vector<int> p={2};
for(j=3;j<=m;j+=2){
f=true;
for(k=0;k<(int)p.size();k++){
if(j%p.at(k)==0){
f=false;
break;
}
}
if(f==true) p.push_back(j);
}
int ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<ll, ll>> prime_factorize(ll n) { //素因数分解と各素数の個数
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i != 0)
{
continue;
... | 1 |
#include<iostream>
using namespace std;
int dp[31] ={1,2,4},step;
int main(){
for(int i=3;i<31;i++){
dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
}
while(cin>>step,step){
cout<<(dp[step-1])/3650+1<<endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int ans[31]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,3,6,10,19,34,62,113,207,381,701,1288,2369,4357,8014,14740};
while(1){
cin>>ans[0];
if(!ans[0])
return 0;
cout<<ans[ans[0]]<<endl;
}
} | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
void computeLPSArray(string pattern, int m, int lps[]){
int len=0;
lps[0]=0; //lps[0] is always 0
int i=1;
while(i<m){
if(pattern[i]==pattern[len]){
len++;
lps[i]=len;
i++;
}else{
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
const ll ... | 1 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll count ( ll n)
{
ll ans =0;
while( n%2==0)
{
n= n/2;
ans++;
}
return ans;
}
int main()
{
ll n;
cin>>n;
ll a[n];
ll ans = INT_MAX;
for(int i=0;i<n;i++)
{
cin>>a[i];
ans = min... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int testcase=1;
for(int p=0;p<testcase;p++){
ll n=0,x=0;
cin>>n>>x;
ll array[n]={0};
ll totalsum=0;
for(int i=0;i<n;i++){
cin>>array[i];
totalsum... | #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) ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a;
int dp[n];
int ans=0;
for(int i=0;i<n;i++)dp[i]=1e9;
for(int i=0;i<n;i++){
cin >> a;
a *= (-1);
*upper_bound(dp,dp+n,a)=a;
}
cout << lower_bound(dp,dp+n,1e9)-dp;
} | #include <bits/stdc++.h>
#include<math.h>
using namespace std;
using ll = long long;
int main(){
int h1, m1, h2, m2 ,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int h3 = h2 -1;
int m3 = m2 + 60;
int a = (h3-h1)*60+(m3-m1);
cout << max(a-k, 0) << endl;
return 0;
} | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include <numeric>
#include<map>
#include<unordered_map>
#include <queue>
using namespace std;
using ll=long long;
#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... |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h... | 0 |
// ABC_104_B
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
bool flag1 = false, flag2 = false, flag3 = false;
if (s[0] == 'A') flag1 = true;
int counter_1 = 0;
for (int i = 2; i < s.size()-1; ++i) {
if (s[i] == 'C') ++counter_1;
else continue;
}
if (counter_1... | #include <bits/stdc++.h>
using namespace std;
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define forn(i, k, n) for (int i = k+1; i < int(n); i++)
typedef long long LL;
typedef pair<int, int> PII;
int digit(long n){
int dig = 1;
while(n / 10 > 0){
n ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long k; //k=123
cin>>k;
long a,b,c;
a=k/50+50; //要特别处理的数的大小 a=123/50+50 = 2+50=52
b=k%50; //要特别处理的数的个数 b=123%50=23
c=a-b-1; //正常相等的数值 c=52-23-... | #include <bits/stdc++.h>
using namespace std;
long long K;
int main()
{
cin >> K;
cout << 50 << endl;
for (int i=0; i<=50; i++)
{
if (50-i != K%50) cout << K/50 + i << " ";
}
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
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 ... | #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 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
vector<ll>vec(3);
ll a=0;
for(ll i=0;i<3;i++){
cin>>vec.at(i);
a+=vec.at(i);
}
sort(vec.begin(),vec.end());
cout<<a-vec.at(2)<<endl;
return 0;
}
| #include<iostream>
#include<math.h>
using namespace std;
int main(){
int a,b,c,e=0,z,d,f,g;
cin>>a>>b>>c;
z=min((a+b),(b+c));
z=min(z,(c+a));
cout<<z;
return 0;
}
| 1 |
#include <iostream>
#include <time.h>
#include <algorithm>
#include <stdio.h>
#include<string.h>
typedef long long LL;
using namespace std;
const int times = 20;
LL fac[1001];
int cnt;
LL mul(LL a, LL b, LL mod)
{
LL ans = 0;
while (b)
{
if (b & 1)
{
ans = (ans + a) % mod;
}
a = (a << 1) % mod;
b >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tii;
#define rep(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
int main(){
ll A,B; cin >> A >> B;
if(A<B) swap(A,B);
ll y = gcd(A,B);
ll yy = y;
ll x = 2;
ll ans = 1;
while(x*x<=y&&yy!=1)... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define CLR(x) memset((x), false, sizeof(x))
const int MAXD = 12801;
const int MAXN = 81;
int A[2][MAXN][MAXN];
bool dp[MAXN][MAXN][MAXD];
int H, W;
int solve() {
CLR(dp);
dp[0][0][0] = true;
dp[0][1][0] = true;
dp[1][0][0] = true;
for (int i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<vector<int>> A(H, vector<int>(W)), B(H, vector<int>(W));
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
cin >> A.at(i).at(j);
}
}
for (int i = 0; i < H... | 1 |
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
#define V(a) a.begin(), a.end()
typedef set<int> s;
int main()
{
s a[2], C;
for (auto &i : a) {
int n, x;
cin >> n;
while (n--) {
cin >> x;
i.insert(x);
}
}
set_intersection(V(a[0]), V(a[1]), inserter(C, C.end()));
cout... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *S = new int[n];
for (int i = 0; i < n; ++i) {
cin >> S[i];
}
int q;
cin >> q;
int *T = new int[q];
for (int i = 0; i < q; ++i) {
cin >> T[i];
}
int count = 0;
for (int i = 0; i... | 1 |
#include <iostream>
#include <cctype>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <complex>
#include <cstring>
#include <set>
using namespace std;
#define loop(i,a,b) for(int i=a; i<b; i++)
#define rep(i,a) loop(i,0,a)
int input[1111][3], res[1111];
int main(){
int a,b,c;
... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fa... | #include <bits/stdc++.h>
int main(){
long long D, G;
std::cin >> D >> G;
G /= 100;
std::vector< int > P(D);
std::vector< int > C(D);
for(int i=0; i<D; i++){
std::cin >> P[i] >> C[i];
P[i];
C[i] /= 100;
}
std::vector< std::vector< int > > dp(D+1, std::vector<... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 50 + 5, mod = 1e9 + 7;
int n, k;
int a[N], dp[N][N][102];
int solve(int l, int r, int left)
{
if (l > r)
return 0;
if (dp[l][r][left] != -1)
return dp[l][r][left];
int ans = 0;
if (a[l] < 0)
{
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){return b%a ? gcd(b%a,a) : a;}
int main(){
int N;
cin>>N;
int a,b,c;
cin>>a>>b;
if(N==3) cin>>c;
int tmp=gcd(a,b);
if(N==3) tmp=gcd(tmp,c);
for(int i=1;i<=tmp;i++){
if(tmp%i==0) cout<<i<<endl;
}
return 0;
}
... | #include<bits/stdc++.h>
using namespace std;
#define rg register
#define rep(i,a,b) for (rg int i=a;i<=b;i++)
#define per(i,a,b) for (rg int i=b;i>=a;i--)
#define pb push_back
#define lowbit(x) (x&(-x))
#define mk make_pair
#define VI vector<int>
#define pii pair<int,int>
#define pLL pair<long long,long long>
#define f... | 0 |
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
class Dice{
private:
public:
int num[6];
void roll(char c){
int b;
if(c == 'S'){
b = num[0];
num[0] = num[4];
num[4] = num[5];
num[5] = num[1];
num[1] = b;
}
if(c == 'W'){
b = num[0... | #include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
void dice1();
void dice2();
void dice3();
void dice4();
class DICE{
int face[6],a;
public:
bool operator==(const DICE&di)const{
int cont=0;
for(int i=0;i<6;++i){
if(face[i]==di.face[i]){
cont++;
}
}
if(cont==6){
return tru... | 1 |
#include<iostream>
#include<cmath>
#include<stdio.h>
#include<string.h>
using namespace std;
struct node
{
double x,y;
};
double PI=acos(-1.0);
int n;
node p[111];
double ans[111];
void merge(double &from,double &to,double ff,double tt)
{
if(from>ff)
{
swap(from,ff);
swap(to,tt);
}
... | #include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define LL long long
#define double long double
using namespace std;
const double pi=acos(-1);
struct poLL {LL x,y,num;}p[110],a[110];
double ans[110];
LL multi(poLL p1,poLL p2,poLL p0)
{
LL x1=p1.x-p0.x,y1=... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll l,r,ans=2e9;
cin >> l >> r;
if (r-l+1 <= 2019) {
for (ll i=l; i<r; i++) {
for (ll j=i+1; j<=r; j++) {
ans = min(ans, ((i%2019)*(j%2019))%2019);
}
}
cout << ans << '\n';
} else {
cout << 0 << '\n';
}
return 0;
}... | #include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
int N, K; cin >> N >> K;
int x[N]; rep... | 0 |
/*
* d.cc:
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functi... | #include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
inline int rd(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 5e5+5, oo = ... | 0 |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N=0, a=0, b=0, c=10;
cin >> N;
a = N % c;
for(int i=0; i<8; i++){
if(c > N){
break;
}
b = N / c;
a += b % 10 ;
c = c * 10;
}
if(N % a == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | 1 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
u... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
double condition = 0.0;
void func()
{
int X;
cin >> X;
int Y, Z;
Y = X / 500;
Z = (X % 500) / 5;
cout << 1000 * Y + Z * 5 << endl;
}
int main() {
// while(1)
f... | 0 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int R;
cin >> R;
string s;
if(R < 1200) s = "ABC";
else if(R < 2800) s = "ARC";
else s = "AGC";
cout << s << ... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
#include <algorithm>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
T i=0;char c;
while(!isdigit(c=getchar())&&c!='-');
bool flag=c=='-';
f... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
struct UnionFind
{
void init(int n)
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
class UnionFindDS{
private:
vector<int> p, h, sz; // parent, height (rank), size
int num;
public:
UnionFindDS(int N){
p.assign(N,0); for (int i=0; i<N; i++) p[i] = i;
h.assign(... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI aco... | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
int x[MAXN], st[MAXN][18];
int main()
{
int n; scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &x[i]);
int L, Q; scanf("%d%d", &L, &Q);
// memset(st, 0x3f3f3f3f, sizeof(st));
for (int i = 1; i <= n; i++)
st[i][0... | 1 |
#include <iostream>
using namespace std;
int main(){
while(1){
int a, b, c, n, list[1001][4], parts[301], judge, defect;
cin >> a >> b >> c >> n;
if(a == 0 && b == 0 && c == 0){
break;
}
for(int i = 1; i <= a + b + c; i++){
parts[i] = 2;
}
... | #include <stdio.h>
int main(){
int i,n,pm,pj,pe;
double avg,emav;
char type;
scanf("%d",&n);
while(n!=0){
for(i=0;i<n;i++){
scanf("%d%d%d",&pm,&pe,&pj);
avg = (pm+pe+pj) / 3.0;
emav = (pm+pe) / 2.0;
if(pm==100.0||pe==100.0||pj==100.0||emav>=90.0||avg>=80.0) type = 'A';
else if(avg>=70.0) type = 'B... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
#define fs first
#define se second
using namespace std;
typedef long long llong;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<llong, llong> pll;
typedef pair<ld, ld> pdd;
... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<string>
#include<sstream>
#include<iomanip>
#include<utility>
#include<cmath>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long int ll;
const ... | 0 |
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
i64 MOD = 998244353;
long long inv_mod(long long a, long long m = MOD) {
long long b, x, u, q, abs_m, tmp;
abs_m = (m < 0) ? -m : m;
b = m;
x = 1;
u =... | #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--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
map<ll... | 0 |
#include <iostream>
#include <list>
#include <algorithm>
#include <iterator>
using namespace std;
int gcd(int a, int b){
while(b){
int r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
list<int> ls;
list<int>::iterator it = ls.begin();
int n, a, b, c;
cin >> n >> a >> b >> c;
a = gcd(a, b);
if(n == 3... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <math.h>
//#define PI 3.141592653589
using namespace std;
int main()
{
int n;
long seisuu[3];
cin >> n;
for (int i=0; i<n; i++) cin >> seisuu[i];
sort(seisuu, seisuu+n);
for (int i=1; i<=seisuu[0]; i++)
{
if (n == 2)... | 1 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#defi... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9+7;
int f[301000][3][3],n;
char s[301000];
void upd(int&a,int b){a+=b;if(a>=mod) a-=mod;}
int main(){
ios::sync_with_stdio(0);
cin>>s+1;
int n=strlen(s+1);
f[1][0][0]=1;
for(int i=1;i<=n;i++)
for(int j=0;j<=2;j++)
for(int k=0... | 0 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + ... | #include <bits/stdc++.h>
#define ri register
#define int long long
using namespace std; const int N=210;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
return s*w;
}
int n,bo... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
typedef pair<ll, ll> P;
#define bit(n) (1LL << (n))
//#define int long l... |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
#define rep(a,n) for(ll a = 0;a < n;a++)
static const ll INF = 1e15;
static const ll mod = 1e9+7;
template<typ... | 0 |
#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define FOR(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) )
typedef long long ll;
using namespace std;
typedef pair... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s = to_string(n);
int ans = 0;
for(int i = 0; i < 3; i++){
if(s.at(i) == '7'){
ans = 1;
}
}
if(ans == 0){
cout << "No" << endl;
}
else{
cout << "Yes" << endl;
}
} | #include<iostream>
using namespace std;
int main (void)
{
int r;
cin>>r;
while(r>1)
{
if(r%10==7)
{
cout<<"Yes";return 0;
}
r=r/10;
}
cout<<"No";
} | 1 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
using namespace std;
const int maxn=1e5+5;
int fa[maxn];
int tot;
struct way{
int u,v;
long long w;
}edge[maxn*4];
struct node
{
int x,y,id;
}a[maxn];
int find(int x){return fa[x]==x?fa[x]:fa[x]=find(fa[x]);}
void link(int ... | #include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MAX 2000005
#define MOD 1000000007
#define MOD2 998244353
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define vi vector<... | 1 |
#include <iostream>
#include <memory>
#include <cmath>
constexpr int max_size()
{
return static_cast<int>(1e+6);
}
int insert(int* a, const int i, const int gear)
{
if (i < gear) {
return 0;
}
if (a[i - gear] <= a[i]) {
return 0;
}
std::swap(a[i - gear], a[i]);
return 1 +... | #include <iostream>
using namespace std;
int main(void){
int cnt=0,m=0,n,a[1000000],g[100]={0};
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
g[0]=1;
while(g[m]<n){
g[m+1]=3*g[m]+1;
m++;
}
if(n==1)
m=1;
for(int i=m-1;i>=0;i--){
for(int k=g[i];k<n;k++){
int v=a[k];
int j=k-g[i];... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define very_slow ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans=0;
for(int i=0;i<s.size()-1;i++){
if(s.at(i)=='A'&&s.at(i+1)=='C') ans++;
}
if(ans>=1) cout << "Yes";
else cout << "No";
} | 0 |
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(... | #include <bits/stdc++.h>
#define r(i,n) for(i=0;i<n;i++)
using namespace std;
int main(){
int a,b,i;
while(cin>>a>>b,a){
int c[a],s=0,k=0,p=0;
r(i,a){cin>>c[i];p+=c[i];}
sort(c,c+a);
for(i=a-1;i>=0;i--){
k++;
if(k==b){
s+=c[i];
k=0;
}
}
cout<<p-s<<endl;;
}... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string sa;
cin >> sa;
int chain = 0;
int ma = 0;
for (char j : sa){
if (j == 'R'){
chain ++;
}else chain = 0;
ma = max(ma,chain);
}
cout << ma << endl;
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll N,K;
cin>>N>>K;
ll cnt=1;
rep(i,N){
if(cnt<K){
cnt*=2;
}
else{
cnt+=K;
}
}
cout... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define d 1000000007
using namespace std;
int main()
{
int t;
t=1;
while(t--)
{
int n,k;
cin >> n;
cin >> k;
int result=1;
while(n>0)
{
result=min(result*2,result+k);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;
int main(){
int N;
cin>>N;
vector<pair<int,int>> a(N),b(N);
for(int i(0);i<N;i++){
cin>>a[i].second>>a[i].first;
}
for(int i(0);i<N;i++){
cin>>b[i].first>>b[i].s... | 1 |
#include<stdio.h>
#include<algorithm>
#define reg register
#define ri reg int
#define rep(i, x, y) for(ri i = x; i <= y; ++i)
#define nrep(i, x, y) for(ri i = x; i >= y; --i)
#define DEBUG 1
#define ll long long
#define max(i, j) (i) > (j) ? (i) : (j)
#define min(i, j) (i) < (j) ? (i) : (j)
struct IO {
#define MAXSIZE... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,res=0;
scanf("%d",&n);
n*=2;
vector<int>arr(n);
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
sort(arr.begin(),arr.end());
for(int i=0;i<n;i+=2)
{
res+=arr[i];
}
printf("%d",res);
}
| 1 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
//ll mod = 998244353;
#define rep(i,n) for(int i = 0; i < (n); ++i... | #include <bits/stdc++.h>
using namespace std;
#include <stdlib.h>
int main() {
string B;
cin >> B;
vector<char>vec(B.size());
for(int i=0;i<B.size();i++){
vec.at(i)=B.at(i);
}
int count=99999;
for(int i=2 ;i<B.size();i++){
int A=vec.at(i-2)- '0',B=vec.at(i-1)- '0',C=vec.at(i)- '0';
int D;... | 0 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#define N 100005
using namespace std;
struct st{
int l, r;
} a[N];
int n, mx, fl[N], fr[N], bl[N], br[N];
bool cmp(st p, st q) {
if (p.r != q.r) return p.r < q.r;
else return p.l < q.l;
}
int main()
{
int i;
cin >> n;
for (i = 0; i < n; i++) {
scanf... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<int,int>> ab(n),cd(n);
for(int i=0;i<n;++i){
int a,b;
cin >> a >> b;
ab[i]=make_pair(b,a);
}
for(int i=0;i<n;++i){
int c,d;
cin >> c >> d;
cd[i]=make_pair(c,d);
}
sort(ab.begin(),ab.end(),grea... | 0 |
#include <cstdio>
#include <cstring>
using namespace std;
const int mod = 998244353;
char s[301];
int a[300];
int dp[301][301][301][4];
int main() {
int n, k, i, j, l, r;
long long ans = 0;
scanf("%s %d", s, &k);
n = strlen(s);
for (i = 0; i < n; i++) a[i] = s[i] - '0';
dp... | //#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x)... | 0 |
#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
ll MX = 1e18;
int n,k;
cin >> n >> k;
vector<int> neg,pos;
rep(i,n){
int temp;cin >> temp;
if(te... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n, k; cin >> n >> k;
V<ll> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
ll ans = 1e9;
for(int l = 0; l <= n - k; l++){
ll r = l + k - 1;... | 1 |
#include<iostream>
using namespace std;
int main(){
int n=1;
int a = 0;
int f = 0;
int quest[10000] = { 1 };
double ans[10000];
int checkc = 0;
int i = 4;
double check[3] = { 1, 2, 4 };
do{
cin >> quest[a];
a++;
} while (quest[a-1] != 0);
while (a > f+1){
switch (quest[f]){
case 1:
ans[f] = 1;
... | #include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <utility>
#include <set>
#include <cmath>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pi ac... | 1 |
#include <bits/stdc++.h>
using namespace std;
//type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007 //10^9+7:合同式の法
#define MAXR 100000 //10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
#define F first //pa... | #include<stdio.h>
int main(){
char a[100];
scanf("%[^\n]", a);
int ctr = 0;
for(int i= 0; a[i] != '\0'; i++){
if(a[i] == ' '){
if(a[i - 1] == a[i + 1]){
ctr++;
}
}
}
if(ctr == 2){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | 1 |
#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 H,W,K;
const int MOD = 1e9+7;
vector<int> ch... | #include<cstdio>
using ull = unsigned long long;
const static int MOD = 1000000007;
const static int MAX_H = 100;
const static int MAX_W = 8;
ull dp[MAX_H+1][MAX_W], fibonacci[8] = {1, 1, 2, 3, 5, 8, 13, 21};
int main(){
unsigned H, W, K;
scanf("%u %u %u", &H, &W, &K);
if(W == 1){
printf("1\n");
... | 1 |
//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>
namespace n91 {
using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std:... | #include <iostream>
#include <vector>
#include <algorithm>
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
const int MAX_N = 1e4+10;
const int INF = 1e9+10;
typedef long long ll;
vector <int> vec[MAX_N];
bool ans[MAX_N];
int dp[MAX_N],depth[MAX_N];
void dfs(int v,int cnt,int p){
depth[... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define INF (1<<29)
int G[101][101];
int n, k;
void init(){
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < n ; j++){
G[i][j] = INF;
if(i == j) G[i][j] = 0;
}
}
}
int main()... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#define loop(i,a,b) for(int i=a; i<b; i++)
#define rep(i,a) loop(i,0,a)
using namespace std;
int main(){
int a[5];
while(scanf("%d,%d,%d,%d,%d",&a[0],&a[1],&a[2],&a[3],&a[4])!=EOF){
sort(a,a+5);
int n=0;
rep(i... | 0 |
#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... | #include <iostream>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<(int)(n); i++)
signed main() {
int a, b;
cin >> a >> b;
int s = 0, n = (int)1e6;
rep(i0,n) {
int i = i0 + 2, fa = 0, fb = 0;
while(a % i == 0) a /= i, fa = 1;
while(b % i == 0) b /= i, fb = 1;
s ... | 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
// output
#define SPBR(w, n... | #include <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;
scanf("%d", &n);
int l = 0, r = n;
printf("%d\n", l);
fflush(stdout);
string sl;
cin >> sl;
while (sl != "Vacant") {
int m = (l + r) / 2;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
ll x;
cin>>x;
if(x<=6)
cout<<1;
else if(x<=11)
cout<<2;
else if(x%11>6)
cout<<(x/11)*2+2;
else if(x%... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
int n;
cin >> n;
n -= 2;
cout << n * 180 << endl;
} | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | 1 |
#include <bits/stdc++.h>
using namespace std;
template< typename T >
struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int()... | #include <bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<vector<int>> a(H, vector<int>(W));
for (int i = 0; i < H; i++){
for (int j = 0; j < W; j++){
cin >> a[i][j];
}
}
vector<tuple<int, int, int, int>> op;
for (int i = 0; i < H; i++){
for (int j = 0; j ... | 0 |
#include <bits/stdc++.h>
#define gcd std::__gcd
#define EB emplace_back
typedef std::vector <int> vector;
const int N = 100054;
int n;
vector a;
inline bool judge(const vector &v) {
int c[2] = {0}, g = 0; bool one = false; vector u(v);
for (int x : v) ++c[x & 1], one |= x == 1;
if (*c & 1) return true;
if (one |... | #include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+10;
int n,a[N];
void Put(int p) {p&1?puts("First"):puts("Second");exit(0);}
void dfs(int p)
{
int od=0,ov=0,g=0,mn=1e9;
for(int i=1;i<=n;i++) a[i]&1?od++:ov++,mn=min(mn,a[i]);
if(ov&1) Put(p);
if(od>1||mn==1) Put(p^1);
for(i... | 1 |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll MOD = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int N, M;
vector<int> A, B;
long long solve()
{
ll res = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
typedef vector<vll> vvll;
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
int count = 0;
int score = 0;
cin >> N;
vector<string> s(N);
for(int i=0;i<N;i++){
cin >> s.at(i);
}
cin >> M;
vector<string> t(M);
for(int i=0;i<M;i++){
cin >> t.at(i);
}
for(int i=0;i<N;... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
long x;
cin >> N >> x;
vector<long> a(N);
for (int i=0; i<N; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
int cnt=0;
for (int i=0; i<N; i++) {
cnt++;
x -= a.at(i);
if (x<... | 0 |
#include <iostream>
#include <string>
//class
class Baseball{
public:
int firstbase, secondbase, thirdbase;
int inningNumber, out, score;
Baseball(int num){
inningNumber = num;
firstbase = 0;
secondbase = 0;
thirdbase = 0;
out = 0;
score = 0;
}
void playball(){
for(int i = 0; i < inningNumber; ++i... | #include <iostream>
using namespace std;
int main(){
int m,d;
while(cin>>m>>d){
if(!m) break;
int daym[12]={0,31,60,91,121,152,182,213,244,274,305,335};
int wd = (daym[m-1] + d + 2)%7;
switch(wd){
case 0:
cout <<"Monday"<<endl;
break;
case 1:
cout<<"Tuesday"<<endl;
break;
case 2:
cout<<"W... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n,m;
while(cin>>n>>m&&n)
{
vector<int> a;
int ans=0;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
a.push_back(x);
}
sort(a.begin(),a.end());
for(int i=0;i<n%m;i++)
{
ans+=a[0];;
a.erase(a.begin()... | //
// main.cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n,k,cards[11];
bool selected[11];
vector<vector<int>> selectlist;
vector<int> makelist;
void reset(){
n = k = 0;
selectlist.clear();
makelist.clear();
for(int i=0;i<11;i++){
cards[i] = 0;
selected[i] = false;
... | 0 |
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_5_D
#include <iostream>
using namespace std;
bool div(int n){
if(n % 3 == 0) return true;
else return false;
}
bool isIn3(int n){
if((n-3) % 10 == 0) return true;
else return false;
}
bool in3(int n){
while(n > 10){
n /= 10;
if(isIn3(n)... | #include <bits/stdc++.h>
using namespace std;
#define pb(s) push_back(s)
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PI 3.1415926... | 0 |
#include<iostream>
#include<vector>
using namespace std;
long long N,ans;
string S;
string S1,S2;
vector <string> V1,V2;
string convstr(string str,long long key){
string f="";string l="";
for (long long i=0;i<N;i++){
if ((key&(1<<i))!=0){
f=f+str[i];
} else l=str[i]+l;
}
return f+" "+l;
}
int m... | #include <bits/stdc++.h>
using namespace std;
string s;
int memo[310][310][310];
int dp(int l, int r, int k){
if(l > r){
return 0;
}
if(l == r){
return 1;
}
if(memo[l][r][k] != -1) return memo[l][r][k];
int ans = 0;
ans = max(ans, dp(l+1, r, k));
ans = max(ans, dp(l,... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
const int N=5005,P=998244353;
int n,k,C[N][N];
inline int Cs(int n,int m){return n<0||m<0||n<m?0:C[n][m];}
int main()
{
scanf("%d%d",&k,&n);
for(int i=C[0][0]=1;i<=5001;++i)
for(int j=C[i][0]=1;j<=i;++j)
if((C[i][j]=C[i-1][j]+C[i-1][j-1])>=P)
C[i][j]-=P;
for... | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int N, K;
const ll MOD = 998244353;
ll F[4002], F_inv[4002];
ll modpow(ll a, ll b) {
ll rtn = 1, kakeru = a;
while (b > 0) {
if (b & 1)rtn *= kakeru;
kakeru *= kakeru;
kakeru %= MOD;
rtn %= MOD;
b >>= 1;
}
return rtn;
... | 1 |
#include <iostream>
#include <cstring>
using namespace std;
int main(){
int md[11] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30};
int m, d;
string str[7] = {"Wednesday", "Thursday", "Friday", "Saturday", "Sunday", "Monday", "Tuesday"};
while(true){
cin >> m >> d;
if(m == 0 && d == 0) return 0;
for(i... | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
int l[10],v1,v2;
int result,ans;
double total, time, distance;
while(scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d",&l[0],&l[1],&l[2],&l[3],&l[4],&l[5],&l[6],&l[7],&l[8],&l[9],&v1,&v2) != EOF){
total=0;
for(int i=0; i<10; i++)
tot... | 0 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<cmath>
#define REP(i,n) for (int i = 0; (i) < (n); ++ (i))
#define FOR(i,n) for (int i = 1; (i) <= (n); ++ (i))
#define dump(x) cout << #x << " = " << (x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | 0 |
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-8;
long double a = 25.0;
long double b = 26.0;
long double c = 1.0;
long long seek(long long Ntemp){
long double X = a*( (long double) Ntemp ) + b ;
return (long long) ceil( log10(X)/log10(b) - c );
}
int main(){
long long N;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n;
int main(){
cin >> n;
string ans = "";
while(n>0){
n--;
ans = char((n)%26+'a')+ans;
n/=26;
}
cout << ans << endl;
}
| 1 |
#include <iostream>
using namespace std;
int main() {
int n, m, i, point[1000] = { 0 }, kyougi[1000] = { 0 }, ans = 0, tmp = 0, j;
cin >> n >> m;
for (i = 0; i < n; i++) {
cin >> kyougi[i];
}
for (i = 0; i < m; i++) {
int sinsa;
cin >> sinsa;
for (j = 0; j < n; j++) {
if (kyougi[j] <= sinsa) {
point... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
while(true){
int n,m;
cin >> n ;
if(cin.eof()) break;
cin >> m;
vector<int> a(1000);
vector<int> b(1000);
vector<int> c(1000);
vector<bool> u(1000);
vector<int> ans(1000);
fill... | 1 |
/*
Contest 091
B - Two Colors Card Game
Rakesh Kumar --> 21/09/2020
*/
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
std::unordered_map<std::string, int> dict;
int n = 0;
std::cin >> n;
std::cin.ignore();
while (n--)... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <map>
#include <iomanip>
using ll = long long;
using ld = long double;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 200000;
std::vector<std::pair<int,int>... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#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)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
#define X ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(2)<<(x)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int n,m,v,p,u,ans;
long long g,a[200005],sy,d,s[200005];
int main()
{
scanf("%d%d%d%d",&n,&m,&v,&p);
for (int i=1;i<=n;i++)
scanf("%lld",&a[i]);
sort(a+1,a+n+1);
g=a[n-p+1];
for (int i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
ans=p;
for (int i=1;i<=n-p;i++)
{
if (g>a[i]+... | ///Bismillahir Rahmanir Rahim
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp ... | 1 |
#include <iostream>
#include <vector>
using namespace std;
int dfs(auto& nodes, int current_index, int parent_index, int& time) {
int children = 0;
auto& current_node = nodes[current_index];
current_node.time = time;
current_node.low = time;
for (auto adjacent_index : current_node.adjace... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vv... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005],b[100005];
int q[100005];
int main() {
int n,s;
scanf("%d%d",&n,&s);
int id=0;
for(int i=1;i<=n;i++) {
scanf("%lld%lld",&a[i],&b[i]);
if (a[i]<s) id=i;
}
int cnt=0,l=1,r=n;
while ((l<=id)^(r<=id))
if (b[l]>=b[r]... | #include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
const double PI = acos(-1.0);
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using e... | 0 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
#define accum(x) accumulate((x).begin(), (x).end(), 0)
using nam... | #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;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n;
cin>>n;
int cn... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <string>
#include <map>
#include <functional>
#include <cmath>
#include <cstdio>
using namespace std;
#define PI 4*atan(1);
int main(){
int n, a, b, c;
vector<int> ans;
ans.push_back(1);
cin >> n;
if(n == 2){
cin >> a >... |
#include <iostream>
using namespace std;
int main()
{
int h,w,t,maxh=0,maxw=0;
long taikakusen[200][200],max=0;
//??¢?´¢ i=w j=h
for(int i=1;i<=150;i++){
for(int j=1;j<i;j++){
taikakusen[i][j] = i*i + j*j;
}
}
cin>>h>>w;
while(h != 0 && w != 0){
... | 0 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | #include <iostream>
#include <cstring>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int t[n+1][n+1];
memset(t,0,sizeof(t));
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>t[i][j];
t[i][n] += t[i][j];
t[n][j] += t[i][j];
t[n][n] += t[i][j];
}
... | 1 |
//Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | //
// main.c
// ITP1_4_D
//
// Created by ??±??°?????? on 2015/09/29.
// Copyright ?? 2015??´ HamadaShogo. All rights reserved.
//
#include <stdio.h>
#include <stdlib.h>
long long intSum(int *num, int size);
int intMax(int *num, int size);
int intMin(int *num, int size);
int main(int argc, const char * argv[]) {... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.