content
stringlengths 19
11k
|
|---|
#define rep(i,n) fo(i,0,n)
#define fo(i,s,n) for((i)=(s);(i)<(n);(i)++)
#define scan(k) scanf("%d",&k)
#define PI 3.14159265359
#define INF (ll)(2e18+100)
#define MOD (int)(1e9+7)
#define MAX 10000
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef long long ll;
int comp( const void *c1, const void *c2 )
{
int tmp1 = *(int *)c1;
int tmp2 = *(int *)c2;
if( tmp1 < tmp2 ) return -1;
if( tmp1 == tmp2 ) return 0;
if( tmp1 > tmp2 ) return 1;
}
int main(void){
int n;
int l[500];
int i;
scan(n);
rep(i,500){
l[i]=0;
}
rep(i,2*n){
scan(l[i]);
}
qsort(l,500,sizeof(int),comp);
int ans=0;
for(i=0;i<500;i+=2){
ans+=l[i];
}
printf("%d\n",ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#define SRVGCNT 100
#define SKWRCNT (2 * SRVGCNT)
int sv, sc, sl[SKWRCNT];
int ic;
void read(void)
{
int i;
if (scanf("%d", &sv) != 1)
exit(EXIT_FAILURE);
for (sc = 2 * sv, i = 0; i < sc; ++i)
if (scanf("%d", &sl[i]) != 1)
exit(EXIT_FAILURE);
}
int comp(const void *v0, const void *v1)
{
int i0, i1;
i0 = *(int *)v0, i1 = *(int *)v1;
return (i0 < i1) ? -1 : ((i0 > i1) ? +1 : 0);
}
int min(int a, int b)
{
return (a < b) ? a : b;
}
void exec(void)
{
int i, j;
qsort(sl, sc, sizeof sl[0], comp);
for (ic = 0, j = 0, i = 0; i < sv; ++i, j += 2)
ic += sl[j];
}
void print(void)
{
printf("%d\n", ic);
}
void repl(void)
{
read();
exec();
print();
}
int main(void)
{
repl();
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int compare(const void *a, const void *b)
{
return *(int*)b - *(int*)a;
}
int main()
{
int num, size;
int *values;
scanf("%d", &num);
size = num * 10;
values = (int *)malloc(size * sizeof(int));
//memset(cnt, 0, num * sizeof(int));
// 読み込み
int i = 0;
//char buff[100];
//fgets(buff, sizeof(buff), stdin);
//if (sscanf(buff, "%d", &num[i]) != 1)
for (i = 0;; ++i)
{
if (size <= i)
{
void* w = malloc(size * 2 * sizeof(int));
memcpy(w, values, size);
free(values);
values = (int*)w;
size *= 2;
}
scanf("%d", &values[i]);
char chr;
chr = getchar();
if(chr == '\n' || chr == EOF)
break;
}
// 降順
qsort(values, i+1, sizeof(int), compare);
// 串
int sum = 0;
for (i = 0; i < num; ++i)
{
sum += values[i*2 + 1];
}
// 出力
printf("%d\n", sum);
free(values);
return 0;
} |
#include <stdio.h>
int get_min(int data[], int n);
int main(int argc, const char * argv[]) {
int N;
scanf("%d", &N);
int length[2 * N];
for(int i = 0; i < 2 * N; i++) {
scanf("%d", &length[i]);
}
int forSum[N];
for(int j = 0; j < N; j++) {
int kushi1 = get_min(length, 2 * N);
int kushi2 = get_min(length, 2 * N);
if(kushi1 > kushi2) {
forSum[j] = kushi2;
} else {
forSum[j] = kushi1;
}
}
int sum = 0;
for(int k = 0; k < N; k++) {
sum += forSum[k];
}
printf("%d\n", sum);
return 0;
}
int get_min(int data[], int n) {
int min = data[0], mindex = 0;
for(int i = 0; i < n; i++) {
if(min > data[i]) {
min = data[i];
mindex = i;
}
}
data[mindex] = 101;
return min;
}
|
#include <stdlib.h>
#include <string.h>
int size(const void *x,const void *y);
int main(){
int N;
int L[100];// 0 to 99
int i = 0;
char tmp[1024];
char *tp;
int sum = 0;
if(scanf("%d",&N)<0){
return 1;
}
// printf("%d\n",N);
if (scanf("%[0-9 ^\n]",tmp)<0){
return 1;
}
//fgets(tmp,512,stdin);
// printf("%s\n",tmp);
tp = strtok(tmp, " ");
L[i] = atoi(tp);
i=1;
while(tp = strtok(NULL, " ")){
L[i] = atoi(tp);
i++;
}
//ソート
qsort(L,i,sizeof(int),size);
i--;
//
for(int j = i ; 0<j && N > 0 ;j-=2){
// printf("%d[%d],%d[%d]\n",j,L[j],j-1,L[j-1]);
if(L[j]<L[j - 1]){
sum += L[j];
}else{
sum += L[j - 1];
}
N--;
}
printf("%d",sum);
return 0;
}
int size(const void *x,const void *y){
if(*(int *)x > *(int *)y){
return 1;
}else if(*(int *)x < *(int *)y){
return -1;
}else{
return 0;
}
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(void){
int n,i,j,tmp;
scanf("%d", &n);
int l[2*n];
char str[1024];
char *adr;
while( getchar() != '\n');
if(fgets(str, 1024, stdin) == NULL){
printf("No String");
}
adr = strtok(str, " ");
l[0] = atoi(adr);
for(i = 1; i < 2*n; i++){
adr = strtok(NULL , " \n");
if(adr != NULL){
l[i] = atoi(adr);
}
}
for(i = 0; i < 2*n; i++){
for(j = i + 1; j < 2*n; j++){
if(l[i] > l[j]){
tmp = l[i];
l[i] = l[j];
l[j] = tmp;
}
}
}
tmp = 0;
for(i = 0; i < 2*n; i+=2){
tmp += l[i];
}
printf("%d\n", tmp);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void){
int N;
int i,j;
int count=0;
int stackcount=0;
int buf;
int piv=0;
int delnum=0;
char str[1000];
int *stack;
int *newstack;
int ans=0;
scanf("%d\n",&N);
stack=malloc(sizeof(int)*2*N);
newstack=malloc(sizeof(int)*2*N);
for (i=0;i<1000;i++){
str[i]='\0';
}
for (i=0;i<2*N;i++){
stack[i]=0;
}
scanf("%[^\n]",str);
for (i=0;i<1000;i++){
if((str[i]!=' ')&&(str[i]!='\0')){
count++;
}
else{
for(j=0;j<count;j++){
stack[stackcount]+=(str[i-j-1]-48)*pow(10,j);
}
stackcount++;
count=0;
}
if(str[i]=='\0') break;
}
for(i=0;i<2*N;i++){
for(j=0;j<2*N;j++){
if(stack[j]>=piv){
piv=stack[j];
delnum=j;
}
}
newstack[i]=piv;
stack[delnum]=0;
piv=0;
}
for(i=0;i<N;i++){
ans+=newstack[2*i+1];
}
printf("%d\n",ans);
}
|
long n,x,s,t;main(){for(scanf("%ld%ld",&n,&x),s=n,n-=x;x;t=x,x=n%x,n=t)s+=n/x*x*2;printf("%ld",s-t);} |
#define L long long
L F(L A,L B){return B?A/B*B*2+F(B,A%B):-A;}
main(){L N,X;scanf("%lld%lld",&N,&X);printf("%lld",N+F(N-X,X));} |
#include<stdio.h>
int main(){
long long n,x,g;
scanf("%lld%lld",&n,&x);
g = n;
while(x ^= g ^= x ^= g%=x);
printf("%lld\n",(n/g-1)*3*g);
return 0;
} |
#include<stdio.h>
int main()
{
long n, x, temp1, temp2;
scanf("%ld%ld", &n, &x);
temp1= n;
while(x)
{
temp2= n;
n= x;
x= temp2% x;
}
printf("%ld\n", (temp1- n)* 3);
return 0;
} |
#include <stdio.h>
int main(void) {
unsigned long long int n,x,a,b,r;
scanf("%llu%llu",&n,&x);
a=n;
b=x;
r=a%b;
while(r!=0){
a=b;
b=r;
r=a%b;
}
printf("%llu\n",((n/b)-1)*3*b);
return 0;
} |
#include<stdio.h>
long euclid(long a,long b) {
long r;
while(1){
r = a%b;
if(r==0)break;
a = b;
b = r;
}
return b;
}
int main(){
long n,x;
scanf("%ld %ld",&n,&x);
printf("%ld\n",3*(n-euclid(n,x)));
}
|
#include <stdio.h>
long long gcd(long long a, long long b){return (a<b?a:b)==0?(a>b?a:b):gcd((a<b?a:b),(a>b?a:b)%(a<b?a:b));}
int main(void){
long long n,x;
scanf("%lld%lld",&n,&x);
printf("%lld\n",3*(n-gcd(n,x)));
return 0;
} |
#include<stdio.h>
long gcd2(long a, long b){
long t;
if(a<b){
t = a;
a = b;
b = t;
}
t = a % b;
while(t!=0){
a = b;
b = t;
t = a % b;
}
return b;
}
long n, x;
int main(void){
scanf("%ld%ld", &n, &x);
printf("%ld\n", (n-gcd2(n,x))*3);
}
|
#include <stdio.h>
typedef long long ll;
int main() {
ll N,X;
scanf("%lld %lld",&N,&X);
ll ans = N;
N -= X;
while (N%X != 0) {
ans += (N / X)*X * 2;
ll t = X;
X = N%X;
N = t;
}
ans += X*(((N / X)* 2) - 1);
printf("%lld\n",ans);
return 0;
} |
#include<stdio.h>
long f(long L, long S) {
if (S == 0) return -L;
return 2L * S * (L / S) + f(S, L % S);
}
int main()
{
long N, X;
scanf("%ld %ld", &N, &X);
long L = X > N - X ? X : N - X;
long S = N - L;
printf("%ld\n",(f(L, S) + N));
return 0;
} |
#include <stdio.h>
int main(void){
long long N,X;
scanf("%lld%lld",&N,&X);
if(X > N/2){
X = N - X;
}
long long sum = 0;
long long k;
sum += X + N - X;
N = N - X;
while(X != 0){
sum += 2*X*(N/X);
k = N % X;
N = X;
X = k;
}
sum -= N;
printf("%lld",sum);
}
|
#include<stdio.h>
#include<stdlib.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
ll ans;
void gcd(ll p,ll q){
if(p%q){
ll d=p/q;
ans+=2*q*d;
gcd(q,p%q);
}else{
ll d=p/q;
ans+=q*(2*d-1);
}
}
int main(){
ll n,x;
scanf("%lld%lld",&n,&x);
gcd(x,n-x);
printf("%lld\n",ans+n);
return 0;
} |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main() {
long long int n, x, result = 0,tmp;
scanf("%lld%lld", &n, &x);
result = n;
n = n - x;
while (n != 0) {
if (n%x != 0) { result += 2 * x*(n / x); }
else { result += (2 * x*(n / x)-x);printf("%lld",result); return 0; }
tmp = n%x;
n = x;
x = tmp;
}
} |
#include<stdio.h>
long long mod(long long a,long long b){
long long i,sum=0,syou;
while(1){
i=a%b;
syou=a/b;
sum+=syou*b;
a=b;
b=i;
if(i==0){
return sum;
}
}
}
int main(){
long long n,x,i;
scanf("%lld %lld",&n,&x);
if(2*x<n)
i=mod(n-x,x);
else
i=mod(x,n-x);
printf("%lld",i*3);
return 0;
} |
#include <stdio.h>
#include <math.h>
long long int f(long long int a,long long int b){
long long int k;
if(b==0)return -a;
if(a>b){
k=a;
a=b;
b=k;
}
return 2*a*(b/a)+f(a,b%a);
}
int main(){
long long int N,X;
scanf("%lld %lld",&N,&X);
long long int ans;
ans=N+f(N-X,X);
printf("%lld\n",ans);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
typedef long long int int64;
int64 gcd(int64 a,int64 b){
int64 r=a%b;
while(r>0){
a=b;b=r;r=a%b;
}
return b;
}
int64 calc(int64 n,int64 x){
int64 g=gcd(n,x);
return g*3*(n/g-1);
}
void run(void){
int64 n,x;
scanf("%lld%lld",&n,&x);
printf("%lld\n",calc(n,x));
}
int main(void){
run();
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
unsigned long long N, X, a, b, t, r, ans;
int main() {
scanf("%llu %llu", &N, &X);
ans += N;
a = X, b = N - X;
while (1) {
t = 2 * (a / b);
r = a%b;
ans += b*t;
if (r == 0) {
ans -= b;
break;
}
a = b;
b = r;
}
printf("%llu\n",ans);
return 0;
} |
#include<stdio.h>
long long int lgc(long long int a, long long int b){
long long int r, tmp;
r = a % b;
while(r!=0){
a = b;
b = r;
r = a % b;
}
return b;
}
int main(void){
long long int n, x;
scanf("%lld %lld",&n, &x);
long long int p, q;
p = lgc(n,x);
q = n / p;
long long int ans;
ans = p * (q - 1) * 3;
printf("%lld\n",ans);
return 0;
}
|
#include<stdio.h>
#define MAX(x,y) (((x)>(y))?(x):(y))
#define MIN(x,y) (((x)<(y))?(x):(y))
int main(void){
long long N,X,sums;
long long low,high;
scanf("%lld%lld",&N,&X);
sums=N;
low=MIN(X,N-X);
high=MAX(X,N-X);
do{
sums+=low*((high/low)*2);
high%=low;
high^=low;
low^=high;
high^=low;
}while(low!=0);
sums-=high;
printf("%lld\n",sums);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
typedef struct hoge{
long long int y;
long long int x;
long long int res;
} hoge;
int main(){
long long int n;
long long int len;
long long int swap;
hoge a;
scanf("%lld %lld",&n,&a.x);
a.y = n - a.x;
a.res = a.x + a.y;
while(a.x){
swap = a.y;
len = a.y / a.x;
a.res += len * a.x * 2;
a.y = a.x;
a.x = swap % a.x;
}
a.res -= a.y;
printf("%lld\n", a.res);
return 0;
}
|
#include <stdio.h>
int main(void){
long long int x;
long long int n;
long long int a, a_max, a_min;
long long int b, b_max, b_min, tmp;
long long int sum = 0;
int vector = 0;
scanf("%lld %lld", &n, &x);
a = x;
b = x;
if(x > n - x){
x = n - x;
}
n = n - x;
sum += x + n;
while(!(x==0&&n==0)){
if(n % x == 0){
sum += 2 * x * (n / x) - x;
x = 0; n = 0;
} else {
sum += 2 * x * (n / x);
tmp = x;
x = n % x;
n = tmp;
}
}
printf("%lld\n",sum);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
//#define DEBUG
long long dist(long long M, long long N) {
long long D;
if (M<N) {
D = M;
M = N;
N = D;
}
if (N==0) return 0;
D = (M/N)*2*N;
if (M%N==0) D -= N;
return D+dist(N,M%N);
}
int main() {
long long L, N, P, X;
scanf("%lld%lld", &N, &X);
if (2*X == N) L = 3*X;
else L = N + dist(X,N-X);
/* if (2*X < N) {
L = X + (N-X) + X;
P = N-2*X;
L += X+dist(P,X);
} else if (2*X == N) {
L = 3 * X;
} else {
L = X;
L += (N-X) + dist(X,N-X);
}*/
printf("%lld\n", L);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define INF 1000000000
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
long N;
long X;
long ans = 0;
void solve(long n, long x, int f) {
long d = n / x;
long m = n % x;
if(m > 0) {
ans += (d-f) * 2 * x;
solve(x, m, 0);
} else {
ans += d * 2 * x - x;
return;
}
}
int main() {
long i, j;
scanf("%ld %ld", &N, &X);
if(N % 2 == 0 && N/2 == X) {
ans = N/2 * 3;
} else if(N % X == 0) {
ans = (N/X - 1) * 2 * X + N - X;
} else {
solve(N, X, 1);
ans += N;
}
printf("%ld\n", ans);
return 0;
} |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
long long getgcd(long long N,long long X);
int main(void){
long long N,X;
long long buf;
long long buf2;
long long cur;
scanf("%lld %lld",&N,&X);
buf=(long long)getgcd(N,X);
buf2=(long long)(N-buf);
printf("%lld\n",(long long)(3*buf2));
}
long long getgcd(long long N,long long X) {
long long buf;
long long a;
long long b;
a=N;
b=X;
buf=(long long)(a%b);
if (buf!=0){
while(1){
a=b;
b=buf;
buf=(long long)a%b;
if(buf==0) break;
}
}
return (long long)b;
} |
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
int main(void)
{
//変数の宣言
long long int n,x;
long long int a,b;
//よく使う変数
int i,j,k,l;
int flag=0;
long long int ans=0;
int count=0;
int temp,temp1,temp2;
int min;
//データの読み込み
scanf("%lld %lld",&n,&x);
/*for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}*/
// printf("nは%dです\n", n);
// printf("データの読み込み終了\n");
//実際の処理
ans=n;
a=x;
b=n-x;
while(flag==0){
if(a==b){
ans=ans+a;
flag=1;
}else if(a<b){
if(b%a!=0){
ans=ans+(b/a)*a*2;
b=b%a;
}else{
ans=ans+(b/a-1)*a*2;
b=a;
}
}else{
if(a%b!=0){
ans=ans+(a/b)*b*2;
a=a%b;
}else{
ans=ans+(a/b-1)*b*2;
a=b;
}
}
}
// printf("計算部分終了\n");
//出力
printf("%lld",ans);
// printf("結果の出力終了\n");
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <inttypes.h>
/*
答えはXに依存しないと予想できる -> はずれ
N=2 len=3
N=3 len=6
N=4 len=9 (X=2 -> len=6)
N=5 len=12
*/
#define KABE_MIGI 1
#define KABE_UE 2
#define KABE_SITA 4
char kabe[2000][2000];
uint64_t solve(uint64_t N, uint64_t X) {
memset(kabe, 0, sizeof(kabe));
if (N <= 1000) {
static const uint64_t dputtern[6][2] = {
{0, 1}, /* 右 */
{-1, 0}, /* 右上 */
{1, 1}, /* 右下 */
{0, -1}, /* 左 */
{-1, -1}, /* 左上 */
{1, 0} /* 左下 */
};
uint64_t i;
uint64_t y, x;
int d;
int invalid;
uint64_t answer = 0;
for (i = 1; i <= N; i++) {
kabe[10+i][10+0] = KABE_UE; /* 左 */
kabe[10+i - 1][10+i - 1] = KABE_SITA; /* 右 */
kabe[10+N][10+i - 1] = KABE_MIGI; /* 底辺 */
}
y = 10+X;
x = 10;
d = 0; /* 右 */
while (answer == 0 || y != 10+X || x != 10) {
/* 壁を生やして移動する */
switch(d) {
case 0: kabe[y][x] |= KABE_MIGI; break;
case 1: kabe[y][x] |= KABE_UE; break;
case 2: kabe[y][x] |= KABE_SITA; break;
case 3: kabe[y][x-1] |= KABE_MIGI; break;
case 4: kabe[y-1][x-1] |= KABE_SITA; break;
case 5: kabe[y+1][x] |= KABE_UE; break;
}
y += dputtern[d][0];
x += dputtern[d][1];
answer++;
#if 0
printf("%d %d %d %d\n", (int)(x-10),(int)(y-10),d, kabe[y][x]);fflush(stdout);
if(answer>20)break;
#endif
/* 反射する */
invalid = 1;
if ((kabe[y][x] & KABE_MIGI) || (kabe[y][x-1] & KABE_MIGI)) {
invalid = 0;
switch(d) {
case 0: invalid = 1; break;
case 1: d = 2; break;
case 2: d = 1; break;
case 3: invalid = 1; break;
case 4: d = 5; break;
case 5: d = 4; break;
}
}
if (invalid && ((kabe[y][x] & KABE_UE) || (kabe[y+1][x] & KABE_UE))) {
invalid = 0;
switch(d) {
case 0: d = 4; break;
case 1: invalid = 1; break;
case 2: d = 3; break;
case 3: d = 2; break;
case 4: d = 0; break;
case 5: invalid = 1; break;
}
}
if (invalid && ((kabe[y][x] & KABE_SITA) || (kabe[y-1][x-1] & KABE_SITA))) {
switch(d) {
case 0: d = 5; break;
case 1: d = 3; break;
case 2: invalid = 1; break;
case 3: d = 1; break;
case 4: invalid = 1; break;
case 5: d = 0; break;
}
}
}
return answer;
} else {
/* not implemented */
return UINT64_C(3) * (N - 1);
}
}
uint64_t gcd(uint64_t a, uint64_t b) {
uint64_t r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main(void) {
uint64_t N, X;
#if 0
int wacount = 0;
for (N = 2; N < 200; N++) {
for (X = 1; X < N; X++) {
uint64_t a = solve(N, X);
uint64_t p = UINT64_C(3) * (N - gcd(N, X));
if (a != p) {
printf("Wrong answer N = %"PRIu64", X = %"PRIu64", a = %"PRIu64", p = %"PRIu64"\n", N, X, a, p);
if (++wacount >= 10) return 0;
}
}
}
#else
if (scanf("%"SCNu64"%"SCNu64, &N, &X) != 2) return 1;
#if 0
printf("%"PRIu64"\n", solve(N, X));
#else
printf("%"PRIu64"\n", UINT64_C(3) * (N - gcd(N, X)));
#endif
#endif
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#define N 2001
typedef struct vertex{
short int next[N];
short int length;
} vertex;
vertex field[N];
int count(int i,int k,int r);
int main(){
int n,k;
int i,j;
int a,b;
int r;
scanf("%d %d",&n,&k);
for(i = 0;i < n-1;i++){
scanf("%d %d",&a,&b);
field[a].next[field[a].length++] = b;
field[b].next[field[b].length++] = a;
}
r = k / 2;
b = 0;
if(k%2){
for(i = 1;i <= n;i++){
for(j = 0;j < field[i].length;j++){
a = count(i,field[i].next[j],r) + count(field[i].next[j],i,r);
if(b < a){
b = a;
}
}
}
}else{
for(i = 1;i <= n;i++){
a = count(i,0,r);
if(b < a){
b = a;
}
}
}
printf("%d\n", n - b);
return 0;
}
int count(int i,int pre,int r){
int res = 1;
int j;
if(r == 0){
return res;
}
for(j = 0;j < field[i].length;j++){
if(field[i].next[j] == pre){
continue;
}
res += count(field[i].next[j],i,r-1);
}
return res;
}
|
#include <stdio.h>
#include <stdlib.h>
void swap(int a, int b, int *A){
int tmp = A[a];
A[a] = A[b];
A[b] = tmp;
}
int main(){
int N, M, i, odd_num = 0;
scanf("%d%d", &N, &M);
int *A = (int *)malloc(sizeof(int) * M);
for(i = 0; i < M; i++){
scanf("%d", &A[i]);
odd_num += A[i] % 2;
}
if(M == 1){
if(A[0] == 1){
printf("1\n");
printf("1\n");
printf("1\n");
}
else{
printf("%d\n", A[0]);
printf("2\n");
printf("%d %d\n", 1, A[0] - 1);
}
return 0;
}
if(odd_num > 2){
printf("Impossible\n");
return 0;
}
if(odd_num > 0){
for(i = 0; A[i] % 2 == 0; i++);
swap(0, i, A);
for(i = M - 1; A[i] % 2 == 0; i--);
swap(i, M - 1, A);
}
for(i = 0; i < M; i++){
printf("%d ", A[i]);
}
printf("\n");
int *B = (int *)malloc(sizeof(int) * M);
B[0] = A[0] - 1;
for(i = 1; i < M - 1; i++){
B[i] = A[i];
}
B[M - 1] = A[M - 1] + 1;
if(B[0] == 0){
printf("%d\n", M - 1);
}
else{
printf("%d\n", M);
printf("%d ", B[0]);
}
for(i = 1; i < M; i++){
printf("%d ", B[i]);
}
printf("\n");
return 0;
} |
#include <stdio.h>
int B[10000000];
int len;
void print(int x) {
if(x > 0) B[len++]=x;
}
void yaru(int a, int islast) {
int i;
if (a%2==1) {
for(i=1;i<a;i+=2) {
print(2);
}
if(!islast) print(2); /* 最後以外で奇数が来るのは最初のみ */
} else {
if((a/2)%2==0) {
if(islast) {
print(1);
print(a-2);
} else {
print(a);
}
} else {
print(a/2-1);
if(islast) {
print(1);
print(a/2-1);
} else {
print(a/2+1);
}
}
}
}
int main(void) {
int N,M;
int A[200];
int i;
int kisuucount=0;
int k1=0,k2=0;
int tmp;
if(scanf("%d%d",&N,&M)!=2)return 1;
for(i=0;i<M;i++) {
if(scanf("%d",&A[i])!=1)return 1;
}
for(i=0;i<M;i++) {
if(A[i]%2!=0) {
if(kisuucount==0)k1=i; else k2=i;
kisuucount++;
}
}
if(kisuucount>2) {
puts("Impossible");
return 0;
}
if(kisuucount==1) {
tmp=A[k1];
A[k1]=A[0];
A[0]=tmp;
} else if(kisuucount==2) {
tmp=A[k1];
A[k1]=A[0];
A[0]=tmp;
tmp=A[k2];
A[k2]=A[M-1];
A[M-1]=tmp;
}
printf("%d", A[0]);
for(i=1;i<M;i++) printf(" %d",A[i]);
putchar('\n');
len=0;
if(A[0]%2==1) {
yaru(A[0], M==1);
if(M==1) print(1);
} else {
print(1);
yaru(A[0], M==1);
}
for(i=1;i<M;i++) {
yaru(A[i],i+1>=M);
}
printf("%d\n", len);
printf("%d", B[0]);
for(i=1;i<len;i++) printf(" %d", B[i]);
putchar('\n');
return 0;
}
/*
sample 1
ABB
CDC
C: A=B
sample 2
ABCCBA
DEEFGF
E: B=C
F: C=A
----------
123214554
AABBCCDEE
1234321565
AABBCCDDEE
122343
AABBCC
Aの列: (N-奇数の数)/2個のペアについて同じだと言える
Bの列: 同様
全部同じだと言うのに必要なペアの数は(N-1)個
奇数が0個でも、高々N/2個のペアについてしか同じと言えない
Nが偶数の場合
Aに奇数が0個 -> できる?
Aに奇数が1個 -> ありえない
Aに奇数が2個 -> できる?
Aに奇数が3個 -> ありえない
Aに奇数が4個以上 -> Impossible
Nが奇数の場合
Aに奇数が0個 -> ありえない
Aに奇数が1個 -> できる?
Aに奇数が2個 -> ありえない
Aに奇数が3個以上 -> Imposssible
123443215677658998
AABBxCCDDEEFGGFxHH
1122334455
xAABBCCDDx
1221345543
AAxBBCCxxx
1233214554
xAABCCBxDD
12345543216776
xABBACDEEDCxFF
123443215677658998
xABCDDCBAEEFGGFxHH
1221
xxAA
123456654321
xxABCDEEDCBA
1=3 2=4 5=3 6=4 5=6
Nが偶数の場合
A/2が奇数の場合
最初1個 -> 前のやつからの接続を受け入れる
次(A/2-1)個 -> 回文としてマーク
次1個 -> 次と接続する
次(A/2-1)個 -> 回文としてマーク
A/2が偶数の場合
最初1個-> 前のやつからの接続を受け入れる
次1個 -> 次と接続する
次(A-2)個 -> 回文としてマーク
123214566547887
AABBCCDDEFFExGG
1234321
AABBCCx
123454321
AABBCCDDx
Nが奇数の場合
Aが奇数のやつを最初に配置
*/
|
#include<stdio.h>
#include<stdlib.h>
int main(void){
struct{
int A,B;
}data[200000];
unsigned *board[2][4097];
unsigned **calc,*center[4097],ans=0;
int i,j,k,N;
const unsigned mod=(unsigned)1E9+7;
for(i=0;i<2;i++){
for(j=0;j<4097;j++){
board[i][j]=(unsigned *)calloc(4097,sizeof(unsigned));
if(i==1) center[j]=board[1][j]+2049;
}
}
calc=¢er[2049];
scanf("%d",&N);
for(i=0;i<N;i++) scanf("%d%d",&data[i].A,&data[i].B);
for(i=0;i<4097;i++) for(j=0;j<4097;j++) board[0][i][j]=(i==0 || j==0)?1:(board[0][i][j-1]+board[0][i-1][j])%mod;
for(i=0;i<N;i++) calc[-data[i].A][-data[i].B]++;
for(i=0;i<4097;i++){
for(j=0;j<4097;j++){
if(i!=0) board[1][i][j]+=board[1][i-1][j];
if(j!=0) board[1][i][j]+=board[1][i][j-1];
board[1][i][j]%=mod;
}
}
for(i=0;i<N;i++){
ans+=calc[data[i].A][data[i].B];
if(ans>=board[0][2*data[i].A][2*data[i].B]) ans-=board[0][2*data[i].A][2*data[i].B];
else ans+=mod-board[0][2*data[i].A][2*data[i].B];
ans%=mod;
}
if(ans%2) ans+=mod;
ans/=2;
printf("%u\n",ans%mod);
//for(i=0;i<2;i++) for(j=0;j<4097;j++) free(board[i][j]);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#define MOD 1000000007
#define AB 2000
#define AB2 4001
#define N 200005
typedef struct set {
int a;
int b;
} set;
int main(){
int i,j;
long long int ii,jj,rii,rjj;
int n;
int a,b;
long long int **dp;
long long int **root;
long long int res = 0;
set s[N];
dp = calloc(sizeof(long long int*),AB2);
for(i = 0;i < AB2;i++){
dp[i] = calloc(sizeof(long long int),AB2);
}
root = calloc(sizeof(long long int*),AB2);
for(i = 0;i < AB2;i++){
root[i] = calloc(sizeof(long long int),AB2);
}
scanf("%d",&n);
for(i = 0;i < n;i++){
scanf("%d %d",&a,&b);
s[i].a = a;
s[i].b = b;
root[AB - a][AB - b]++;
}
dp[0][0] = 1;
for(i = 0;i < AB2;i++){
for(j = 0;j < AB2;j++){
ii = (i == 0 ? 0 : dp[i - 1][j]);
jj = (j == 0 ? 0 : dp[i][j - 1]);
rii = (i == 0 ? 0 : root[i - 1][j]);
rjj = (j == 0 ? 0 : root[i][j - 1]);
dp[i][j] += (ii + jj);
dp[i][j] %= MOD;
root[i][j] += (rii + rjj);
root[i][j] %= MOD;
}
}
for(i = 0;i < n;i++){
res += root[AB + s[i].a][AB + s[i].b];
res %= MOD;
res += MOD - dp[s[i].a*2][s[i].b*2];
res %= MOD;
}
printf("%lld\n", res % 2 == 0 ? res / 2 : (res + MOD) / 2);
return 0;
} |
Subsets and Splits