با کتابخونه algorithm آشنایی داری ؟به نقل از daneshvar.amr :
به نقل از MajiiiiiD :
int x = 1,p[7000][4]
for (int i=1;i<10;i++)
{
for (int j=1;j<10;j++)
{
for (int k=1;k<10;k++)
{
for (int l=1;l<10;l++)
{
p[x,1] = i;
p[x,2] = j;
p[x,3] = k;
p[x,4] = l;
x++;
}
}
}
}
http://paste.ubuntu.com/6673191به نقل از daneshvar.amr :
لوپ بی‌نهایت، دستور اشتباه دادن به تابع system و ... می‌تونه مشکل ایجاد کنه. برنامه‌ت رو بزار ببینیم چیه.به نقل از puzzle :
#include<iostream>
#include<math.h>
using namespace std;
bool pcheck(unsigned long int x)
{
for (int i=2;i<=sqrt(x);i++)
if (x%i==0)
return false;
return true;
}
int main()
{
int t;
cin>>t;
unsigned long int n;
while(t>0)
{
cin>>n;
unsigned long int x=n;
unsigned int b=2;
double sum=1;
unsigned int power;
while (n!=1)
{
while ( ((pcheck(b)==false) || (n%b!=0)) && (b<=sqrt(n) ) )
b++;
power = 0;
while (n%b==0)
{
power++;
n/=b;
}
sum*=(pow(b,power+1)-1)/(b-1);
b++;
}
sum-=x;
cout<<sum<<endl;
t--;
}
return 0;
}/*
* SumOfDivisors.cpp
*
* Copyright 2014 Javad Bahoosh <javad@javad-HP-620>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
*/
#include <stdio.h>
#include <time.h>
#include <math.h>
int SumOfDivisors(int num)
{
int sum=0;
int r=floor(sqrt((double)num));
if(r*r==num) //case that n is a perfect square
{
sum += r;
r -= 1;
}
if( num%2 != 0 ) //number is odd
for(int i=1; i<=r; i+=2)
{
if(num%i==0)
sum += i + num/i ;
}
else //number is even
for(int i=1; i<=r; i+=1)
{
if(num%i==0)
sum += i + num/i ;
}
return sum;
}
int main()
{
clock_t start,end;
int ans=0;
start = clock();
ans = SumOfDivisors(97132312);
end = clock();
printf("%d\n%d msec\n",ans,(end-start));
}double res = c/n*100
cout<<"%"<<fixed << std::setprecision(3)<<res<<endl;به نقل از daneshvar.amr :
double res = (double) c/n*100
یه سری کلمه داری توی یه فایل که قراره به ترتیب الفبا مرتب بشن؟ من اینکار رو میکنم:به نقل از innocent :
/*
* Sort.cpp
*
* Copyright 2014 Javad Bahoosh <javad@javad-HP-620>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
*/
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
int main() {
// Empty vector holding all names from file
vector<string> names;
// Read names from file test.text
ifstream in("test.text");
if(!in.is_open())
cout << "Unable to open file\n";
string word;
while(getline(in, word))
names.push_back(word);
sort(names.begin(), names.end());
// Loop to print names
for (size_t i = 0; i < names.size(); i++)
cout << names[i] << '\n';
}
۲ بار تعریف داری میکنی خوببه نقل از madrid 4 life :
کدتونو بدین من یه نگاهی بندازم.به نقل از madrid 4 life :