Ëã·¨Éè¼ÆÓë·ÖÎö(µÚ2°æ) Íõºì÷ ºúÃ÷ Ï°Ìâ´ð°¸ ÁªÏµ¿Í·þ

·¢²¼Ê±¼ä : ÐÇÆÚÈý ÎÄÕÂËã·¨Éè¼ÆÓë·ÖÎö(µÚ2°æ) Íõºì÷ ºúÃ÷ Ï°Ìâ´ð°¸¸üÐÂÍê±Ï¿ªÊ¼ÔĶÁ

5. Éè¼ÆËã·¨Çó½âan mod m£¬ÆäÖÐa¡¢nºÍm¾ùΪ´óÓÚ1µÄÕûÊý¡££¨Ìáʾ£ºÎªÁ˱ÜÃâan

³¬³öintÐ͵ıíʾ·¶Î§£¬Ó¦¸Ãÿ×öÒ»´Î³Ë·¨Ö®ºó¶ÔnÈ¡Ä££©

#include using namespace std;

int square(int x) {

return x*x; }

//Óõݹé˼Ïë

int resultmod(int a, int n) {

if(n== 0) return 1; if(n%2 == 0) return square(resultmod(a, n/2));//nΪżÊýµÄʱ£¬È¡nµÄÒ»°ë·ÀÖ¹Òç³ö else return a*resultmod(a, n-1);//nΪÆæÊýʱ£¬È¡n-1£» }

int main() {

int a, n, m;

cout<<\ÇëÊäÈëa£¬n, m: \ cin>>a>>n>>m; cout<

int result = resultmod(a, n);

cout<<\µÄ½á¹ûΪ£º\ return 0; }

6. Éè¼ÆËã·¨£¬ÔÚÊý×ér[n]ÖÐɾ³ýËùÓÐÔªËØֵΪxµÄÔªËØ£¬ÒªÇóʱ¼ä¸´ÔÓÐÔΪO(n)£¬¿Õ¼ä¸´ÔÓÐÔΪO(1)¡£

7. Éè¼ÆËã·¨£¬ÔÚÊý×ér[n]ÖÐɾ³ýÖظ´µÄÔªËØ£¬ÒªÇóÒƶ¯ÔªËصĴÎÊý½ÏÉÙ²¢Ê¹Ê£ÓàÔªËؼäµÄÏà¶Ô´ÎÐò±£³Ö²»±ä¡£ #include using namespace std;

void deletere(int a[],int N) { int b[100]={0}; int i,k; k=0; static int j=0; for(i=0;i

int main() { int a[]={1,2,1,3,2,4}; deletere(a,6); return 0; }

//ÔÚÊý×é²éÕÒÏàͬµÄÔªËØ

//°ÑÆäÖÐÒ»¸öÏàͬµÄÊýÖµµÄÔªËØλÖÃÉè³ÉÒ»¸ö¡°ÌØÊâÊýÖµ¡± //Êä³öËùÇóº¯Êý

#include

using namespace std;

int main() {

int a[]={1,2,1,5,3,2,9,4,5,5,3,5}; int i,j;

for( i=0;i<12;i++) {

for(j=0;j

a[i]=64787250;//ÉèÒ»¸öÊý×é²»´æÔÚµÄÊýÖµ } }//for

for(i=0;i<12;i++) { if(a[i]!=64787250) cout<

8. Éè±íA={a1, a2, ?, an}£¬½«A²ð³ÉBºÍCÁ½¸ö±í£¬Ê¹AÖÐÖµ´óÓÚµÈÓÚ0µÄÔªËØ´æÈë±íB£¬ÖµÐ¡ÓÚ0µÄÔªËØ´æÈë±íC£¬ÒªÇó±íBºÍC²»ÁíÍâÉèÖô洢¿Õ¼ä¶øÀûÓñíAµÄ¿Õ¼ä¡£

//ÏȶÔA½øÐпìÅÅ

//½«´óÓÚ0µÄÔªËظøB£¬Ð¡ÓÚ0µÄÔªËظøC

#include using namespace std;

int partions(int l[],int low,int high) {

int prvotkey=l[low]; l[0]=l[low];

while (low

while (low=prvotkey) --high;

l[low]=l[high];

while (low

l[high]=l[low]; }

l[low]=l[0]; return low; }

void qsort(int l[],int low,int high) {

int prvotloc; if(low

prvotloc=partions(l,low,high); //½«µÚÒ»´ÎÅÅÐòµÄ½á¹û×÷ΪÊàÖá qsort(l,low,prvotloc-1); //µÝ¹éµ÷ÓÃÅÅÐò ÓÉlow µ½prvotloc-1 qsort(l,prvotloc+1,high); //µÝ¹éµ÷ÓÃÅÅÐò ÓÉ prvotloc+1µ½ high } }

void quicksort(int l[],int n) {

qsort(l,1,n); //µÚÒ»¸ö×÷ΪÊàÖá £¬´ÓµÚÒ»¸öÅŵ½µÚn¸ö }

int main() { int a[11]={-2,2,32,43,-23,45,36,-57,14,27,-39};

quicksort(a,11);

for(int i=1;i<11;i++) { if(a[i]<0)

cout<<\ else cout<<\ }

cout<

return 0;