http://mendo.mk/jforum/posts/list/7.page JForum - http://www.jforum.net #include<iostream>
using namespace std;
int main()
{
int i, j, x, y;
long long br=0;
cin>>x;
int n[x];
for(i=0;i<x;i++)
{
cin>>n[i];
}
cin>>y;
for(i=0;i<x;i++)
{
for(j=x;j>i;j--)
{
if(n[i]+n[j]==y)
{
br++;
}
}
}
cout<<br;
}


Задачава ми работи на 8/10 тест случаи. На другите два е надминат временски лимит. Ги симнав двата случаи и увидов дека не можат да се внесат. Кога ги променам променливите во long long, повеќе случаи се неточни. Дали може некој да ми помогне? ]]> http://mendo.mk/jforum/posts/preList/389/2832.page http://mendo.mk/jforum/posts/preList/389/2832.page GMT
[code]#include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <queue>
#include <stack>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#include <list>
#include <cctype>
#include <climits>

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int>::iterator viter;
typedef vector<vector<int> > vii;

#define DEBUG 1
#define dbg(x) if(DEBUG) x
#define all(c) (c).begin(), (c).end()
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define spresent(s,x) ((s).find(x) != string::npos)

int main()
{

map<int, int> m;
int n,x,cnt = 0;

cin >> n;

for (int i=0; i<n; i++) {
int in;
cin >> in;
m[in] = i;
}

cin >> x;

for (map<int,int>::iterator it = m.begin(); it != m.end(); it++) {
if (m.find(x-it->first) != m.end() && it->second < m.find(x-it->first)->second)
cnt++;
}

cout << cnt << endl;

return 0;
}[/code]]]> http://mendo.mk/jforum/posts/preList/389/2833.page http://mendo.mk/jforum/posts/preList/389/2833.page GMT
]]> http://mendo.mk/jforum/posts/preList/389/2834.page http://mendo.mk/jforum/posts/preList/389/2834.page GMT