1.2~1.5

1 files changed, 72 insertions, 0 deletions

diff --git a/1.5/ariprog.c b/1.5/ariprog.c
new file mode 100644
index 0000000..385fe8a
--- /dev/null
+++ b/1.5/ariprog.c
@@ -0,0 +1,72 @@
+/*
+ID: mytbk921
+LANG: C
+TASK: ariprog
+*/
+
+#include <stdio.h>
+
+int squares[251];
+int notpass[251*251*2+1]={};
+int n,m;
+
+int check(int x) //check if x is p^2+q^2
+{
+	int i,j;
+	if (notpass[x]==1)
+		return 0;
+	if (notpass[x]==-1)
+		return 1;
+	for (i=0; i<=m&&squares[i]<=x/2; i++){
+		for (j=m; j>=i; j--){
+			if (squares[i]+squares[j]==x){
+				notpass[x]=-1;
+				return 1;
+			}
+			if (squares[i]+squares[j]<x)
+				break;
+		}
+	}
+	notpass[x]=1;
+	return 0;
+}
+
+int test(int a, int b) //test if a to a+nb can pass the ckecks
+{
+//	printf("test %d %d\n",a,b);
+	int i;
+	for (i=0; i<=n; i++){
+		if (!check(a)){
+//			printf("%d failed\n",a);
+			return 0;
+		}
+		a += b;
+	}
+	return 1;
+}
+
+int main()
+{
+	int a,b;
+	int found=0;
+	FILE *fin=fopen("ariprog.in","r");
+	FILE *fout=fopen("ariprog.out","w");
+	fscanf(fin, "%d%d", &n, &m);
+	for (a=0;a<=m;a++)
+		squares[a]=a*a;
+	n--;
+	fclose(fin);
+	for (b=1; b*n<=squares[m]*2; b++){
+		for (a=0; a+b*n<=squares[m]*2; a++){
+			if (test(a,b)){
+				fprintf(fout,"%d %d\n",a,b);
+				found=1;
+			}
+		}
+	}
+	if (!found)
+		fprintf(fout,"NONE\n");
+	fclose(fout);
+	return 0;
+}
+