- 博客(7)
- 收藏
- 关注
RSS订阅原创 2021-01-20
Specialized Four-Dight Number#include <stdio.h>int Calc(int base,int n){int sum = 0;while(n){sum =sum + n%base;n /= base;}return sum;}int main(){int i;for(i=2992;i<=9999;i++){if(Calc(16,i)==Calc(10,i) && Calc(10,i)==Calc(12,i)
2021-01-20 11:42:12
133
原创 2021-01-19
Simple Addition#include <stdio.h>struct data{ char name[10]; int cs[4]; int time[4]; int num; int sum;};int main () { int n,i,j; scanf("%d",&n); struct data a[n]; for(i=0;i<n;++i){ a[i].num=4; a[i].sum=0; } for(i=0;i<n;++i){ scanf("%s
2021-01-19 08:38:58
74
原创 2021-01-19
Function Run Fun#include <stdio.h>#include <string.h>#define N 20int f[N+1][N+1][N+1];int w(int a,int b,int c){if(a<=0||b<=0||c<=0)return 1;else if(a>N||b>N||c>N)return w(N,N,N);else if(f[a][b][c])return f[a][b][c
2021-01-19 08:37:18
107
原创 2021-01-19
Factorial!You Must be Kidding!!!#include <stdio.h>const long long Fact1=10000,Fact2=6227020800;const int N=13;long long F[N+1];int main(){int n,i;while(~scanf("%d",&n)){for(i=1;i<=n;i++){F[0]=1;F[i]=i*F[i-1];}if(n>N || (n<0
2021-01-19 08:35:28
123
原创 2021-01-19
Tic Tac Toe#include <stdio.h>char plant[4][4];int win(char c){ int i,j; for(i=0;i<3;i++){ for(j=0;j<3 && plant[i][j]c;j++) if(j2) return 1; for(j=0;j<3 && plant[j][i];j++) if(j2) return 1; } for(i=0;i<3&&p
2021-01-19 08:33:11
67
原创 2021-01-19
Pig-Latin#include <stdio.h>#include <string.h>char temp[1000005];int isab(char c){if(c>=‘a’ && c<=‘z’)return 1;if(c>=‘A’ && c<=‘Z’)return 1;return 0;}int vowell(char c){if(c==‘a’||c==‘e’||c==‘i’||c==‘o’|
2021-01-19 08:30:34
88
原创 2021-01-19
Specialized Four-Dight Number#include <stdio.h>int Calc(int base,int n){int sum = 0;while(n){sum =sum + n%base;n /= base;}return sum;}int main(){int i;for(i=2992;i<=9999;i++){if(Calc(16,i)==Calc(10,i) && Calc(10,i)==Calc(12,i
2021-01-19 08:28:31
103
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人