#include<stdio.h> #include<stdlib.h> int candidate[3]; int nTimes[3]={0,0,0}; int main() { FILE *fin; int n; int i,trigger; fin=fopen("1.txt","r"); while(fscanf(fin,"%d",&n)==1) { //printf("$$$$$$$$$$$$$$$/n"); trigger=0; for(i=0;i<3;i++) { if(nTimes[i]==0) { candidate[i]=n; nTimes[i]=1; break; } if(candidate[i]==n) { nTimes[i]++; break; } trigger++; } if(trigger==3) { for(i=0;i<3;i++) nTimes[i]--; } } for(i=0;i<3;i++) { printf("candidate[%d]=%d/n",i,candidate[i]); } return 0; }
#include <cstdio> #include<cstdlib> int judge(int n) { if(n==1) return 0; while(n!=1&&n%2==0) n/=2; if(n==1) r
code: #include<cstdio> int path[4]; int backtrack(int n) { if(n==4) { for(int i=0;i<4;i++) printf("%d%d ",i